A microcoded elliptic curve processor using FPGA technology
نویسندگان
چکیده
The implementation of a microcoded elliptic curve processor using field-programmable gate array technology is described. This processor implements optimal normal basis field operations in 2 . The design is synthesized by a parameterized module generator, which can accommodate arbitrary and also produce field multipliers with different speed/area tradeoffs. The control part of the processor is microcoded, enabling curve operations to be incorporated into the processor and hence reducing the chip’s I/O requirements. The microcoded approach also facilitates rapid development and algorithmic optimization: for example, projective and affine coordinates were supported using different microcode. The design was successfully tested on a Xilinx Virtex XCV1000-6 device and could perform an elliptic curve multiplication over the field 2 using affine and projective coordinates for = 113 155 and 173.
منابع مشابه
FPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor
Elliptic curve cryptography (ECC) has been the focus of much recent attention since it ooers the highest security per bit of any known public key cryptosystem. This beneet of smaller key sizes makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper a microcoded Xilinx Virtex based elliptic curve processor is d...
متن کاملA High Performance VLIW Processor for Finite Field Arithmetic
Finite field arithmetic forms the mathematical basis for a variety of applications from the area of cryptography and coding. For finite fields of large extension degrees (as for cryptography), arithmetic operations are computation intensive and require dedicated hardware support under given timing constraints. We present a new architecture of a high performance VLIW processor that can perform b...
متن کاملElliptic Curve Crypto-processor
In this paper, we propose an elliptic curve key generation processor over GF(2 163 ) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using...
متن کاملAn FPGA Implementation of an Elliptic Curve Processor over
This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock f...
متن کاملEfficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations
This paper presents a processor architecture for elliptic curve cryptography computations over GF(p). The speed to compute the Elliptic-curve point multiplication over the prime fields GF(p) is increased by using the maximum degree of parallelism, and by carefully selecting the most appropriate coordinates system. The proposed Elliptic Curve processor is implemented using FPGAs. The time, area ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. VLSI Syst.
دوره 10 شماره
صفحات -
تاریخ انتشار 2002