HARDWARE REALIZATION OF HIGH SPEED ELLIPTIC CURVE POINT MULTIPLICATION USING PRECOMPUTATION OVER GF(P)
- 1 , India
Abstract
Two new theoretical approaches for the hardware realization of high speed elliptic curve point multiplication over a prime field (GF(p)) are presented. These hardware implementations use multiple units of elliptic curve point doublers, point adders and multiplexers. The modular hardware approach used here provides high speed and scalability.
DOI: https://doi.org/10.3844/jcssp.2014.1094.1106
Copyright: © 2014 N. Shylashree and V. Sridhar. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 2,940 Views
- 2,399 Downloads
- 0 Citations
Download
Keywords
- Elliptic Curve Point Adders
- Point Doublers
- Elliptic Curve Point Multiplier
- Point Multiplexers
- Galois Field