Paper 2009/001 Original: eprint.iacr.org/2009/001 ↗
A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem
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)$.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2009-01-04: last updated
- 2009-01-04: published
- Short URL
- https://ia.cr/2009/001
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/001,
author = {Brian Baldwin and Richard Moloney and Andrew Byrne and Gary McGuire and William P. Marnane},
title = {A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/001},
year = {2009},
url = {https://eprint.iacr.org/2009/001}
}