TAILIEUCHUNG - Efficient Elliptic Curve Processor Architectures for Field Programmable Logic

Abstract Elliptic curve cryptosystems offer security comparable to that of traditional asymmetric cryptosystems, such as those based on the RSA encryption and digital signature algorithms, with smaller keys and computationally more efficient algorithms. | Efficient Elliptic Curve Processor Architectures for Field Programmable Logic by Gerardo Orlando A Dissertation Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements for the Degree of Doctor of Philosophy in Electrical Engineering by March 4 2002 APPROVED Dr. Christof Paar Dissertation Advisor ECE Department Dr. Berk Sunar Dissertation Committee ECE Department Dr. Fred J. Looft Dissertation Committee ECE Department Dr. Wayne P. Burleson Dissertation Committee ECE Department University of Massacusetts Dr. John Orr Head of ECE Department Abstract Elliptic curve cryptosystems offer security comparable to that of traditional asymmetric cryptosystems such as those based on the RSA encryption and digital signature algorithms with smaller keys and computationally more efficient algorithms. The ability to use smaller keys and computationally more efficient algorithms than traditional asymmetric cryptographic algorithms are two of the main reasons why elliptic curve cryptography has become popular. As the popularity of elliptic curve cryptography increases the need for efficient hardware solutions that accelerate the computation of elliptic curve point multiplications also increases. This dissertation introduces elliptic curve processor architectures suitable for the computation of point multiplications for curves defined over fields GF 2m and curves defined over fields GF p . Each of the processor architectures presented here allows designers to tailor the performance and hardware requirements according to their performance and cost goals. Moreover these architectures are well suited for implementation in modern field programmable gate arrays FPGAs . This point was proved with prototyped implementations. The fastest prototyped GF 2m processor can compute an arbitrary point multiplication for curves defined over fields GF 2167 in milliseconds and the prototyped processor for the field GF 2192 264 1 is capable of .

• An ninh - Bảo mật
• Field Programmable Logic
• Efficient Elliptic Curve Processor Architectures
• Hard ware Implementation Models
• Acronyms and Symbols
• Critical Path Delay
• Most Significant Bit First Multiplier
• Programmable Logic
• Hardware Description Languages
• digital systems
• traditional glue logic
• programming techniques
• Designing
• alternative architectures
• logic devices
• Complex Programmable Logic Devices
• Field Programmable Gate Arrays
• Engineering managers