HARDWARE REALIZATION OF HIGH SPEED ELLIPTIC CURVE POINT MULTIPLICATION USING PRECOMPUTATION OVER GF(P)
N. Shylashree1 & V. Sridhar1 Show affiliations
- , India
Journal of Computer Science, Volume 10, Issue 7, pp. 1094–1106 · doi.org/10.3844/jcssp.2014.1094.1106
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Shylashree, N. & Sridhar, V. (2014). HARDWARE REALIZATION OF HIGH SPEED ELLIPTIC CURVE POINT MULTIPLICATION USING PRECOMPUTATION OVER GF(P). Journal of Computer Science, 10(7), 1094–1106. https://doi.org/10.3844/jcssp.2014.1094.1106
- Licence
- © Science Publications
- Issue
- Volume 10, Issue 7
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
