• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.88-95
• /
• 2002

In recent years, the security of hardware and software systems is one of the most essential factor of our safe network community. As elliptic Curve Cryptosystems proposed by N. Koblitz and V. Miller independently in 1985, require fewer bits for the same security as the existing cryptosystems, for example RSA, there is a net reduction in cost size, and time. In this thesis, we propose an efficient hardware architecture of underlying field arithmetic processor for Elliptic Curve Cryptosystems, and a very useful method for implementing the architecture, especially multiplicative inverse operator over GF$GF (2^m)$ onto FPGA and futhermore VLSI, where the method is based on optimized unit operation components. We optimize the arithmetic processor for speed so that it has a resonable number of gates to implement. The proposed architecture could be applied to any finite field $F_{2m}$. According to the simulation result, though the number of gates are increased by a factor of 8.8, the multiplication speed We optimize the arithmetic processor for speed so that it has a resonable number of gates to implement. The proposed architecture could be applied to any finite field $F_{2m}$. According to the simulation result, though the number of gates are increased by a factor of 8.8, the multiplication speed and inversion speed has been improved 150 times, 480 times respectively compared with the thesis presented by Sarwono Sutikno et al. [7]. The designed underlying arithmetic processor can be also applied for implementing other crypto-processor and various finite field applications.

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

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

• Review of KIISC
• /
• v.4 no.1
• /
• pp.20-29
• /
• 1994

Shamir가1984년 개인정보(ID)를 이용한 암호시스템의 개념을 제안한 이래 Fiat-Shamir방식을 필두로 하여 Ohta, Guillou 등이 개인정보에 기반을 둔 서명법과 영지식 대화형 증명방식을 조합한 각종 개인식별 방식 및 디지탈 서명 방식들이 제안되어 왔다. 또한, Okamoto 등이 개인 정보를 이용한 키분배 방식을 제안하였다. 본고에서는 지금까지 제안된 개인정보를 이용한 암호시스템의 대표적인 방식들에 대해 그들의 특징과 장단점을 비교 분석하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.640-645
• /
• 2001

본 논문에서는 무선환경을 고려하여 타원곡선 암호시스템을 기반으로 하는 AKC 프로토콜(Authenticated Key Agreement with Key Confirmation Protocol)을 제안한다. 제안 프로토콜은 2명의 객체가 한번의 세션과정을 통해서 복수개의 공유키를 생성하며 주기적으로 키를 refresh함으로써, 현재 안전한 암호 알고리즘의 수출규제에 따른 대안으로 사용되어질 수 있다. 또한 이미 알려진 여러 공격에 대한 안전성을 상세히 고찰한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.769-772
• /
• 2007

Quantum cryptography is considered as a promising solution towards absolute security in long term cryptosystems. While the application of quantum cryptography in fiber networks has significant advances, research on the application of quantum cryptography in mobile networks is still prematures. In this paper, we analyses the interests of using quantum technique.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.148-151
• /
• 2000

In recent years, security is essential factor of our safe network community. Therefore, data encryption/ decryption technology is improving more and more. Elliptic Curve Cryptosystem proposed by N. Koblitz and V. Miller independently in 1985, require fewer bits lot the same security, there is a net reduction in cost, size, and time. In this paper, we design high speed underlying field arithmetic processor for elliptic curve cryptosystem. The targeting device is VIRTEX V1000FG680 and verified by Xilinx simulator.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.935-938
• /
• 2003

The performance of elliptic curve based on public key cryptosystems is mainly appointed by the efficiency of the underlying finite field arithmetic. This work describes a finite field multiplier and divider which is implemented using SystemC. Also this present an efficient hardware for performing the elliptic curve point multiplication using the polynomial basis representation. In order to improve the speed of the multiplier with as a little extra hardware as possible, adopted hybrid finite field multiplication and finite field divider.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.407-410
• /
• 2001

본 논문에서는 자바 카드용 ECC (Elliptic Curve Cryptosystems) 및 ECDSA (Elliptic Curve Digital Signature Algorithm) 알고리즘 구현 및 시험 결과에 대해 언급하고자 한다. 163비트 타원곡선 암호시스템(ECC)은 현재 많이 사용되고 있는 RSA 1024 비트 이상의 안전성을 보장한다. 또한, 짧은 키 길이를 사용하기 때문에 메모리와 처리능력이 제한된 스마트 카드나 이동 통신 등과 같은 분야에서 매우 유용하게 사용될 수 있으며, ECC나 ECDSA를 자바 카드 상에 구현하여 사용함으로써 사용자들은 보다 강화된 보안성과 안전성을 제공받을 수 있을 것이다.

• Journal of the military operations research society of Korea
• /
• v.12 no.1
• /
• pp.38-49
• /
• 1986

Cryptography attempts to protect information by altering its form to make it unreadable to all but the authorized readers. DBMS is a most important computer application area requiring data security, but only a few cryptosystems are suggested for the database encryption. This research develops a new Residue-Coded Cryptosystem based on the Chinese Remainder Theorem, which is considered to be more efficient than the database encryption scheme introduced by Davida, Wells and Kam in 1981.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1995.11a
• /
• pp.195-199
• /
• 1995

본 논문에서는 지금까지 ${\gamma}$$^{th}$ -잉여류 문제를 이용하여 제안된 공개키 잉여류 암호알고리즘들을 살펴보고, ${\gamma}$의 크기에 따라 제안된 각 암호알고리즘들을 분류해 본다. 특히 이산대수 문제를 이용하여 현재까지 제안된 공개키 잉여류 암호알고리즘에서 사용하는 ${\gamma}$의 크기와 헝태를 더욱더 일반화한 새로운 공개키 잉여류 암호알고리즘을 제안한다.