Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor

다국어 초록 (Multilingual Abstract)

This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field multiplication operations are performed in parallel to improve system latency. As a result, our approach can reduce hardware costs, while the total time required for point multiplication is kept to a reasonable amount. The results on a Xilinx Virtex-5, Virtex-7 FPGAs and VLSI implementation show that the proposed architecture has less hardware complexity, number of clock cycles and higher efficiency than the previous works.

목차 (Table of Contents)

• Abstract
• Ⅰ. INTRODUCTION
• Ⅱ. BACKGROUND
• Ⅲ. MODIFIED LOPEZ-DAHAB AND LEFT-TORIGHT ALGORITHM
• Ⅳ. PROPOSED ECC POINT MULTIPLICATION ARCHITECTURE
• Ⅴ. RESULTS AND COMPARISON
• Ⅵ. CONCLUSION
• REFERENCES

참고문헌 (Reference)

1 N. Koblitz, "The state of elliptic curve cryptography" 19 (19): 173-193, 2000

2 H. Li, "Simple Power Analysis Attacks Using Chosen Message against ECC Hardware Implementations" 68-72, 2011

3 H. Mahdizadeh, "Novel Architecture for Efficient FPGA Implementation of Elliptic Curve Cryptographic Processor Over GF(2163)" 21 (21): 2330-2333, 2013

4 U. Kocabas, "Implementation of binary Edwards curves for very-constrained devices" 185-191, 2010

5 G. Meurice de Dormale, "High-speed hardware implementations of elliptic curve cryptography : A survey" 53 (53): 72-84, 2007

6 J. P. Deschamps, "Hardware Implementation of Finite-Field Arithmetic" McGrawHill 2009

7 J.-P. Deschamps, "Hardware Implementation of Finite-Field Arithmetic" McGraw-Hill 2009

8 R. Hankerson, "Guide to Elliptic Curve Cryptography" Springer-Verlag 2004

9 W. N. Chelton, "Fast elliptic curve cryptography on FPGA" 16 (16): 198-205, 2008

10 S. M. Shohdy, "FPGA implementation of elliptic curve point multiplication over GF(2191)" 619-634, 2009

11 Y. K. Lee, "Elliptic curve-based security processor for RFID" 57 (57): 1514-1527, 2008

12 G. D. Sutter, "Efficient Elliptic Curve Point Multiplication using Digit-Serial Binary Field Operations" 60 (60): 217-225, 2013

13 R. Azarderakhsh, "Efficient Algorithm and Architecture for Elliptic Curve Cryptography for Extremely Constrained Secure Application" 64 (64): 1144-1155, 2014

14 C. W. Chiou, "Concurrent error detection and correction in dual basis multiplier over GF(2m)" 3 (3): 22-40, 2009

15 A. Hariri, "Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)" 58 (58): 1332-1345, 2009

16 J. -C. Bajard, "Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation" 55 (55): 1167-1177, 2006

17 F. Rodríguez-Henríquez, "A fast parallel implementation of elliptic curve point multiplication over GF(2m)" 28 (28): 329-339, 2004