• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.1
• /
• pp.28-38
• /
• 2007

In this paper, we implement Microsoft COM software modules for elliptic curve cryptographic applications and analyze its performance. The implemented COM software modules support all elliptic curve key exchange protocols and elliptic curve digital signature algorithm in IEEE 1363 finite fields GF(p) and GF(2m). Since the implemented software modules intend to focus on a component-based software development method, and thus it have a higher productivity and take systematic characteristics to be open outward and to be standardized. Accordingly, it enable a software to be developed easier and faster rather than a method using C library. In addition it support the Microsoft COM interface, we can easily implement secure software applications based on elliptic curve cryptographic algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6C
• /
• pp.572-578
• /
• 2007

To establish eye contact in video teleconferencing, it is necessary to synthesize a front view image by viewpoint interpolation. We can find the viewing direction of a user, and interpolate an image seen from that viewpoint, which will result in a face image observed from the front. There are two categories of previous research: image based method and model based method. The former is simple to calculate, however, it shows limited performance for complex objects. And the latter is robust to noise while it is computationally expensive. We propose to approximate face images as ellipses and match them to build an ellipsoid and then synthesize a new image from a given virtual camera position. We show that it is simple and robust from various experiments.

• Journal of Navigation and Port Research
• /
• v.27 no.1
• /
• pp.41-48
• /
• 2003

The most great GPS is working on CNS(Car navigation System) and Personal terminal, but ocean has not been. First studied GPS is sailing to ship but We have been connivance that The ship is not need detail navigation. Lately, harbor facilities and transportation service in harbors are complication. We have need accurate ship navigation system. In this paper, author developed algorithms of ellipsoid conversion between WGS84 and BESSEL and develope algorithms of map projection between ellipsoid coordinate system, and plane cartesian system. Author used 3-parameter in covering ellipsoids and used TM and UTM projection in converting between ellipsoid and plane cartesian coordinate. And author analyzed errors through static surveying and dynamic surveying of GPS for proving accuracy of GPS sensor, Furthermore author analyzed deflection error of received position. Finally author developed real time ship navigation system using cheep GPS sensor.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.341-344
• /
• 2001

본 논문에서는 타원곡선 알고리즘에 기반한 공개키암호시스템 구현을 다룬다. 공개키의 길이는 193비트를 갖고 기약다항식은 p(x)=x/sup 193＋x/sup 15＋1을 사용하였다. 타원곡선은 polynomial basis 로 표현하였으며 SEC 2 파라메터를 기준으로 하였다 암호시스템은 polynomial basis 유한체 연산기로 구성되며 특히, digit-serial 구조로 스마트카드와 같이 제한된 면적에서 구현이 가능하도록 하였다. 시스템의 회로는 VHDL, SYNOPSYS 시뮬레이션 및 회로합성을 이용하여 XILINX FPGA로 회로를 구현하였다. 본 시스템 은 Diffie-Hellman 키교환에 적용하여 동작을 검증하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.593-595
• /
• 2000

본 논문에서는 최적확장체(Optimal Extension Field; OEF)에서 정의되는 타원곡선 상에서 효율적인 스칼라 곱셈 알고리즘을 제안한다. 이 스칼라 곱셈 알고리즘은 프로비니어스 사상(Frobenius map)을 이용하여 스칼라 값을 Horner의 방법으로 Base-Ф 전개하고, 이 전개된 수식을 일괄처리 기법(batch-processing technique)을 사용하여 연산한다. 이 알고리즘을 적용할 경우, Kobayashi 등이 제안한 스칼라 곱셈 알고리즘보다 40% 정도의 성능향상을 보인다.

• Proceedings of the KIEE Conference
• /
• 2005.04a
• /
• pp.64-66
• /
• 2005

본 논문에서는 압전체의 타원 운동을 이용한 선형 Micro-Positioning Actuator(MPA)에 대한 설계 및 해석 기법을 제안하였다. 또한 MPA의 해석을 위해 3차원 압전체의 유한요소의 정식화를 통한 유한요소 해석기법의 검증을 수행하였다. 검증된 3차원 유한요소 해석을 이용하여 MPA의 공진 특성 즉 impedance, 모드, 그리고 타원운동 해석을 하였다. 마지막으로 제안된 해석기법을 이용하여 기계 시스템을 고려한 MPA의 최종 설계를 하였다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.11
• /
• pp.902-910
• /
• 2018

This paper deals with spacecraft intercept problem on non-coplanar elliptical obit considering J2 perturbation. This disturbance addressed in this work is a major factor changing the trajectory of a spacecraft orbiting the Earth. To resolve this issue, a real-time intercept method is proposed. This method is based on the optimization problem which consist of the equation of motion considering spherical earth and impulse, and the optimal solution numerically obtained is set as the direction of the thrust of the interceptor. The position error is resolved by iteratively solving the optimization problem and modifying the direction of thrust of interceptor. The proposed method in this paper is verified by using various numerical examples.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.242-245
• /
• 2002

본 논문은 ARM7TDMI 프로세서를 사용하여 유한체 GF(2$^{m}$ ) 상에 정의된 타원곡선 암호시스템을 구현한 결과를 제시한다. 타원곡선의 점을 표현하는 좌표계에 따른 비교를 하였고, 사전 계산과 사전 계산을 하지 않는 알고리즘의 구현 결과를 비교하고 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.143-152
• /
• 2012

In this paper hardware implementation of GF($2^{191}$) elliptic curve cryptographic coprocessor which supports 7 operations such as scalar multiplication(kP), Menezes-Vanstone(MV) elliptic curve cipher/decipher algorithms, point addition(P+Q), point doubling(2P), finite-field multiplication/division is described. To meet structure resistant against simple power analysis, the ECC processor adopts the Montgomery scalar multiplication scheme which main loop operation consists of the key-independent operations. It has operational characteristics that arithmetic units, such GF_ALU, GF_MUL, and GF_DIV, which have 1, (m/8), and (m-1) fixed operation cycles in GF($2^m$), respectively, can be executed in parallel. The processor has about 68,000 gates and its simulated worst case delay time is about 7.8 ns under 0.35um CMOS technology. Because it has about 320 kbps cipher and 640 kbps rate and supports 7 finite-field operations, it can be efficiently applied to the various cryptographic and communication applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1267-1275
• /
• 2017

This paper describes a design of cryptographic processor supporting 233-bit elliptic curves over binary field defined by NIST. Scalar point multiplication that is core arithmetic in elliptic curve cryptography(ECC) was implemented by adopting modified Montgomery ladder algorithm, making it robust against simple power analysis attack. Point addition and point doubling operations on elliptic curve were implemented by finite field multiplication, squaring, and division operations over $GF(2^{233})$, which is based on affine coordinates. Finite field multiplier and divider were implemented by applying shift-and-add algorithm and extended Euclidean algorithm, respectively, resulting in reduced gate counts. The ECC processor was verified by FPGA implementation using Virtex5 device. The ECC processor synthesized using a 0.18 um CMOS cell library occupies 49,271 gate equivalents (GEs), and the estimated maximum clock frequency is 345 MHz. One scalar point multiplication takes 490,699 clock cycles, and the computation time is 1.4 msec at the maximum clock frequency.