타원곡선 암호 시스템의 고속 구현을 위한 VLSI 구조
VLSI Architecture for High Speed Implementation of Elliptic Curve Cryptographic Systems
1
조회
0
다운로드
3
인용
0
참고문헌
키워드
초록
본 논문에서는 상의 고속 타원곡선 암호 프로세서를 제안한다. 제안한 암호 프로세서는 타원곡선 정수 곱셈을 위해 수정된 Lez-Dahab Montgomery 알고리즘을 채택하고, 상의 산술 연산을 위해 가우시안 정규 기저(Gaussian Normal Basis: GNB)를 이용한다. 높은 처리율을 위해 Lpez-Dahab 방식에 기반한 규칙적인 주소화 방식의 병렬 타원곡선 좌표 덧셈 및 배 연산 알고리즘을 유도하고 상의 연산을 수행하는 두 개의 워드-레벨 산술 연산기(Arithmetic Unit: AU)를 설계한다. 제안된 타원곡선 암호 프로세서는 Xilinx사의 XC4VLX80 FPGA 디바이스에 구현되었으며, 24,263개의 슬라이스를 사용하고 최대 동작주파수는 143MHz이다. 제안된 구조를 Shu 등의 하드웨어 구현과 비교했을 때 하드웨어 복잡도는 약 2배 증가 하였지만 4.8배의 속도 향상을 보인다. 따라서 제안된 타원곡선 암호 프로세서는 네트워크 프로세서와 웹 서버등과 같은 높은 처리율을 요구하는 타원곡선 암호시스템에 적합하다.
Abstract
In this paper, we propose a high performance elliptic curve cryptographic processor over . The proposed architecture is based on a modified Lpez-Dahab elliptic curve point multiplication algorithm and uses Gaussian normal basis for field arithmetic. To achieve a high throughput rates, we design two new word-level arithmetic units over and derive a parallelized elliptic curve point doubling and point addition algorithm with uniform addressing based on the Lpez-Dahab method. We implement our design using Xilinx XC4VLX80 FPGA device which uses 24,263 slices and has a maximum frequency of 143MHz. Our design is roughly 4.8 times faster with 2 times increased hardware complexity compared with the previous hardware implementation proposed by Shu. et. al. Therefore, the proposed elliptic curve cryptographic processor is well suited to elliptic curve cryptosystems requiring high throughput rates such as network processors and web servers.
참고문헌 (23)
- V.S. Miller, "Use of Elliptic Curves in Cryptography", in Advances in Cryptology-Proc. of CRYPTO'85, pp.417~426 (1986)
- N. Koblitz, "Elliptic Curve Cryptosystems", Mathematics of Computation, 48, pp.203~209 (1987)
- M. Rosing, "Implementing Elliptic Curve Cryptography" (1999), Manning
- D. Hankerson, "Software Implementation of Elliptic Curve Cryptography Over Binary Fields", Proc. of CHES 2000, Lecture Notes in Computer Science, 통권 : 1965, pp.1~24 (2000)
- A. Satoh, "A Scalable Dual-Field Elliptic Curve Cryptographic Processor", IEEE Trans. on Computers, 52(4), pp.449~460 (2003)
- G. Orlando, "High Performance Reconfigurable Elliptic Curve Processor for", CHES 2000, Lecture Notes in Computer Science, 통권 : 1965 (2000)
- C. Shu, "Low Latency Elliptic Curve Cryptography Accelerators for NIST Curves over Binary Fields", FPT 2005 1965, pp.309~310 (2005)
- N. Gura, "An End-to-End Systems Approach to Elliptic Curve Cryptography", CHES 2002, Lecture Notes in Computer Science, 통권 : 2523, pp.349~365 (2002)
- A. K. Daneshbeh, "Area efficient high speed elliptic curve cryptoprocessor for random curves", IEEE Symposium on Information Technology: Coding and Computing(ITCC), 통권 : 2, pp.588~592 (2004)
- H. Eberle, "A cryptographic processor for arbitrary elliptic curves over", pp.444~454 (2003), Application-Specific Systems, Architectures, and Processors (ASAP)
- C. Grabbe, "A high performance vliw processor for finite field arithmetic", Reconfigurable Architectures Workshop (RAW) (2003)
- K. Jӓrvinen, "A scalable architecture for elliptic curve point multiplication", pp.303~306 (2004), IEEE Field-Programmable Technology (FPT)
- N.A. Saqib, "A parallel architecture for fast computation of elliptic curve scalar multiplication over", Parallel & Distributed Processing Symposium (IPDPS) (2004)
- "IEEE 1363, Standard Specifications for Publickey Cryptography, 2000", ~ (2000)
- NIST, "Recommended elliptic curves for federal government use, May 1999. http:", encryption, 1999[DOI]
- A.J. Menezes, "Applications of Finite Fields" (1993), Kluwer Academic Publisher
- S. Kwon, "Efficient Linear Array for Multiplication in Using a Normal Basis for Elliptic Curve Cryptography", CHES 2004 Lecture Notes in Computer Science, 통권 : 3156, pp.76~91 (2004)
- J. López, "Fast Multiplication on Elliptic Curves over without Precomputation", CHES 1999, Lecture Notes in Computer Science, 통권 : 1717, pp.316~327 (1999)
- T. Itoh, "A fast algorithm for computing multiplicative inverses in using normal bases", Information and Computing, 78(3), pp.171~177 (1988)
- High Performance Architecture of Elliptic Curve Scalar Multiplication, "B. Ansari", ~, pp.Tech. Report CACR 2006-01 (2006)
- M. Benaissa, "Design of Flexible Elliptic Curve Cryptography Processors", IEEE Trans. VLSI Syst, 14(6), pp.659~662 (2006)
- C.J. McIvor, "Hardware Elliptic Curve Cryptography Processor over GF(p)", IEEE Trans. Circuits Syst. I: Reg. Papers, 53(9), pp.1946~1957 (2006)
- G. Chen, "A High-Performance Elliptic Curve Cryptographic Processor for General Curves Over GF(p) Based on a Systolic Arithmetic Unit", IEEE Trans. Circuits Syst. II: Express Briefs, 54(5), pp.412~416 (2007)