Theoretical Modeling of Elliptic Curve Scalar Multiplier on LUT-Based FPGAs for Area and Speed
- 6 June 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 21 (5), 901-909
- https://doi.org/10.1109/tvlsi.2012.2198502
Abstract
This paper uses a theoretical model to approximate the delay of different characteristic two primitives used in an elliptic curve scalar multiplier architecture (ECSMA) implemented on k input lookup table (LUT)-based field-programmable gate arrays. Approximations are used to determine the delay of the critical paths in the ECSMA. This is then used to theoretically estimate the optimal number of pipeline stages and the ideal placement of each stage in the ECSMA. This paper illustrates suitable scheduling for performing point addition and doubling in a pipelined data path of the ECSMA. Finally, detailed analyses, supported with experimental results, are provided to design the fastest scalar multiplier over generic curves. Experimental results for GF(2163) show that, when the ECSMA is suitably pipelined, the scalar multiplication can be performed in only 9.5 μs on a Xilinx Virtex V. Notably the design has an area which is significantly smaller than other reported high-speed designs, which is due to the better LUT utilization of the underlying field primitives.Keywords
This publication has 15 references indexed in Scilit:
- Optimized FPGA-based elliptic curve cryptography processor for high-speed applicationsIntegration, 2010
- Revisiting the Itoh-Tsujii Inversion Algorithm for FPGA PlatformsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2010
- On Repeated Squarings in Binary FieldsLecture Notes in Computer Science, 2009
- On Parallelization of High-Speed Processors for Elliptic Curve CryptographyIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2008
- High-Performance Architecture of Elliptic Curve Scalar MultiplicationIEEE Transactions on Computers, 2008
- Fast Elliptic Curve Cryptography on FPGAIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2008
- Security on FPGAsACM Transactions on Embedded Computing Systems, 2004
- Optimal left-to-right binary signed-digit recodingIEEE Transactions on Computers, 2000
- Fast Multiplication on Elliptic Curves Over GF(2m) without precomputationLecture Notes in Computer Science, 1999
- Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)Lecture Notes in Computer Science, 1999