Translator Disclaimer
17 September 2005 An efficient hardware architecture of a scalable elliptic curve crypto-processor over GF(2n)
Author Affiliations +
Abstract
This paper presents a scalable Elliptic Curve Crypto-Processor (ECCP) architecture for computing the point multiplication for curves defined over the binary extension fields (GF(2n)). This processor computes modular inverse and Montgomery modular multiplication using a new effcient algorithm. The scalability feature of the proposed crypto-processor allows a fixed-area datapath to handle operands of any size. Also, the word size of the datapath can be adjusted to meet the area and performance requirements. On the other hand, the processor is reconfigurable in the sense that the user has the ability to choose the value of the field parameter (n). Experimental results show that the proposed crypto-processor is competitive with many other previous designs.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lo'ai Tawalbeh, Alexandre Tenca, Song Park, and Cetin Koc "An efficient hardware architecture of a scalable elliptic curve crypto-processor over GF(2n)", Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100Q (17 September 2005); https://doi.org/10.1117/12.615975
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Faster and smaller hardware implementation of XTR
Proceedings of SPIE (August 25 2006)
Novel single-chip evolutionary hardware design using FPGAs
Proceedings of SPIE (October 08 1998)
Hardware-based image processing library for Virtex FPGA
Proceedings of SPIE (October 06 2000)
Malleable architecture generator for FPGA computing
Proceedings of SPIE (October 21 1996)
Partial reconfiguration-oriented design of logic controllers
Proceedings of SPIE (December 28 2007)

Back to Top