Exploration of Design Space in ECDSA

Authors:
Jan Schmidt;Martin Novotný;Martin Jäger;Milos Becvár;Michal Jáchim
Affiliations:
-;-;-;-;-
Venue:
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Year:
2002

Citing 5
Cited 0

Optimal normal bases in GF(pn)

Discrete Applied Mathematics
On Computing Multiplicative Inverses in GF(2/sup m/)

IEEE Transactions on Computers
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Elliptic Curve Scalar Multiplier Design Using FPGAs

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper compares FPGA implementation of scaled polynomial basis and normal basis arithmetic units in the context of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF(2m). The hardware uses GCD division in polynomial basis and Itoh-Teechai-Tsujii inversion in normal basis. Where an optimal normal basis exists, the normal basis arithmetic performs better. The digit width of 6 is shown to give the best area/performance ratio for optimal normal basis arithmetic.