论文信息 - Dual-Field Arithmetic Unit for GF(p) and GF(2m)

Dual-Field Arithmetic Unit for GF(p) and GF(2m)

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.

Johannes Wolkerstorfer | J. Wolkerstorfer

[1] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .

[2] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[3] Q. K. Kop,et al. Fast algorithm for modular reduction , 1998 .

[4] Erkay Savas,et al. A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) , 2000, CHES.

[5] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Public Key Cryptography.

[6] Alfred Menezes,et al. Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.

[7] Johann Großschädl,et al. A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) , 2001, CHES.

[8] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.

[9] Alfred Menezes,et al. Software Implementation of the NIST Elliptic Curves Over Prime Fields , 2001, CT-RSA.

[10] David Naccache,et al. Cryptographic Hardware and Embedded Systems — CHES 2001 , 2001 .

[11] A. P. Chandrakasan,et al. An energy-efficient reconfigurable public-key cryptography processor , 2001, IEEE J. Solid State Circuits.