JCS Cover
Frequency: Monthly
ISSN: 1549-3636 (Print)
ISSN: 1552-6607 (Online)
Research Article Open Access

HARDWARE REALIZATION OF HIGH SPEED ELLIPTIC CURVE POINT MULTIPLICATION USING PRECOMPUTATION OVER GF(P)

N. Shylashree1 and V. Sridhar1
  • 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.

Journal of Computer Science
Volume 10 No. 7, 2014, 1094-1106

DOI: https://doi.org/10.3844/jcssp.2014.1094.1106

Submitted On: 7 December 2013 Published On: 4 February 2014

How to Cite: 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

Open AccessCopyright: © 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.

  • 3,190 Views
  • 2,537 Downloads
  • 0 Citations

Download

Keywords

  • Elliptic Curve Point Adders
  • Point Doublers
  • Elliptic Curve Point Multiplier
  • Point Multiplexers
  • Galois Field