Cryptology ePrint Archive: Report 2009/001
A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem
Brian Baldwin and Richard Moloney and Andrew Byrne and Gary McGuire and William P. Marnane
Abstract: This paper presents implementation results of a reconfigurable elliptic curve processor defined over prime fields $GF(p)$. We use this processor to compare a new algorithm for point addition and point doubling operations on the twisted Edwards curves, against a current standard algorithm in use, namely the Double-and-Add. Secure power analysis versions of both algorithms are also examined and compared. The algorithms are implemented on an FPGA, and the speed, area and power performance of each are then evaluated for various modes of circuit operation using parallel processing. To the authors' knowledge, this work introduces the first documented FPGA implementation for computations on twisted Edwards curves over fields $GF(p)$.
Category / Keywords: implementation / Hardware, elliptic curve cryptosystem, Edwards curves, FPGA
Publication Info: To appear in ARC 2009, the 5th International Workshop on Applied Reconfigurable Computing
Date: received 30 Dec 2008
Contact author: brianb at rennes ucc ie
Available format(s): PDF | BibTeX Citation
Note: The paper has been updated (approx +2 pages) to now include a more complete hardware section and also a hardware description of modular addition and Montgomery multiplication operation.
None of this is included in the ARC09 version.
Version: 20090104:222542 (All versions of this report)
Short URL: ia.cr/2009/001
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]