In this article we present a hardware solution for finite field arithmetic with application in asymmetric cryptography. It supports calculation in GF(p) as well as in GF(2m). Addition and multiplication with interleaved modular reduction are the main functionality of the unit. Additional functions - like shift operations and integer incrementation - allow the calculation of the multiplicative inverse and covering all operations required to implement Elliptic Curve Cryptography. Redundant number representation and efficient modular reduction make it ready for future cryptographic bitlengths and allow operation at high clock frequency on moderate hardware resources. © Springer-Verlag 2003.
CITATION STYLE
Wolkerstorfer, J. (2003). Dual-field arithmetic unit for GF(p) and GF(2m). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2523, 500–514. https://doi.org/10.1007/3-540-36400-5_36
Mendeley helps you to discover research relevant for your work.