• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.3
• /
• pp.265-272
• /
• 1999

The map coordinate systems of Korea, based on the Bessel 1841 ellipsoid with Tokyo Datum, applied in digital mapping. So, the new geocentric system have some coordinate differences compared to GRS80 ellipsoid with the International Terrestrial Reference Frame(ITRF). Therefore, map transition procedures are needed to establish for the new coordinate system. In this paper, characteristics and tendencies about coordinate differences and map tiles systems are investigated and modules for the map coordinate transformations between two systems are developed and simulated.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.5 no.1
• /
• pp.17-24
• /
• 1995

In spite of the good security of the cryptosystem on an elliptic curve defined over finite field, the cryptosystem on an elliptic curve is slower than that on a finite field. To be practical, we need a better method to improve a speed of the cryptosystem on an elliptic curve defined over a finite field. In 1991, Koblitz suggested to use an anomalous curve over $F_2$, which is an elliptic curve with Frobenious map whose trace is 1, and reduced a speed of computation of mP. In this paper, we consider an elliptic curve defined over $F_4$ with Frobenious map whose trace is 3 and suggest an efficient algorithm to compute mP. On the proposed elliptic curve, we can compute multiples mP with ${\frac{3}{2}}log_2m$+1 addition in worst case.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.643-645
• /
• 1999

타원곡선에 이어 초타원곡선을 공개키 암호시스템에 적용하는 방법이 Koblitz에 의해 제안되었다. 이를 위해 우선 곡선을 선택해야 하는데, 선택될 곡선은 현재까지 알려진 공격에 대해 안전하여야 한다. 본 논문에서는 초타원 암호시스템(hyperelliptic cryptosystem을 구성하기 위해 genus 2인 초타원곡선 v2+v=u5+u3+u와 특성계수(characteristic) 3인 기본 체(field)를 선택하고, 이로써 만들어질 암호시스템이 안전함을 보인다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.56-56
• /
• 1997

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2001.10a
• /
• pp.83-89
• /
• 2001

• Geophysics and Geophysical Exploration
• /
• v.9 no.2
• /
• pp.171-175
• /
• 2006

Gravity reduction and Bouguer anomaly are frequently misunderstood by many geoscientists as follows; the observed gravity is reduced to a common datum plane, so that gravity effects by all materials above the datum is removed, therefore, Bouguer anomaly is located on the datum plane. In reality, Bouguer anomaly does not lie on a common datum plane, but is difference between observed gravity and reference gravity at the actual point of measurement. Commonly used gravity reduction formulas are approximate formulas. Here, we introduce complete formulas, and suggest to use them for more accurate results. We also suggest to use not the geoid but the reference ellipsoid as the vertical datum.

• Journal of Digital Contents Society
• /
• v.13 no.2
• /
• pp.255-262
• /
• 2012

Human motion tracking algorithm is receiving attention from many research areas, such as human computer interaction, video conference, surveillance analysis, and game or entertainment applications. Over the last decade, various tracking technologies for each application have been demonstrated and refined among them such of real time computer vision and image processing, advanced man-machine interface, and so on. In this paper, we introduce cost-effective and real-time human motion tracking algorithms based on depth image 3D point matching with a given superellipsoid body representation. The body representative model is made by using parametric volume modeling method based on superellipsoid and consists of 18 articulated joints. For more accurate estimation, we exploit initial inverse kinematic solution with classified body parts' information, and then, the initial pose is modified to more accurate pose by using 3D point matching algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.2
• /
• pp.117-123
• /
• 2001

Requiring topographic information of map due to retaining russia map, which needed accuracy analysis of russia map and relation between its and south korea's map. In order to obtain exact location information from the map which has different reference datum. We have to operate coordinate transformation between maps applied different ellipsoid. In this paper, in order to evaluate accuracy between two maps applied different ellipsoid, it has studied theory of map projection and coordinate transformation. Then, select each point which can be recognized on the two maps for accuracy evaluation. After obtaining coordinate values for each point of same area, it is evaluated accuracy each geodetic coordinate and each TM coordinate. As a result of this study, the maps which have different reference datum could be used if the exact origin shift could be obtained and applied.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.65-76
• /
• 2005

Speeding up scalar multiplication of an elliptic curve point has been a prime approach to efficient implementation of elliptic curve schemes such as EC-DSA and EC-ElGamal. Koblitz introduced a $base-{\phi}$ expansion method using the Frobenius map. Kobayashi et al. extended the $base-{\phi}$ scalar multiplication method to suit Optimal Extension Fields(OEF) by introducing the table reference method. In this paper we propose an efficient scalar multiplication algorithm on elliptic curve over OEF. The proposed $base-{\phi}$ scalar multiplication method uses an optimized batch technique after rearranging the computation sequence of $base-{\phi}$ expansion usually called Horner's rule. The simulation results show that the new method accelerates the scalar multiplication about $20\%{\sim}40\%$ over the Kobayashi et al. method and is about three times as fast as some conventional scalar multiplication methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.419-426
• /
• 2021

A high-performance elliptic curve cryptography processor (HP-ECCP) was designed to support five field sizes of 192, 224, 256, 384 and 521 bits over GF(p) defined in NIST FIPS 186-2, and it provides eight modes of arithmetic operations including ECPSM, ECPA, ECPD, MA, MS, MM, MI and MD. In order to make the HP-ECCP resistant to side-channel attacks, a modified left-to-right binary algorithm was used, in which point addition and point doubling operations are uniformly performed regardless of the Hamming weight of private key used for ECPSM. In addition, Karatsuba-Ofman multiplication algorithm (KOMA), Lazy reduction and Nikhilam division algorithms were adopted for designing high-performance modular multiplier that is the core arithmetic block for elliptic curve point operations. The HP-ECCP synthesized using a 180-nm CMOS cell library occupied 620,846 gate equivalents with a clock frequency of 67 MHz, and it was evaluated that an ECPSM with a field size of 256 bits can be computed 2,200 times per second.