论文信息 - Implementation Options for Finite Field Arithmetic for Elliptic Curve Cryptosystems - 字舞流文

Implementation Options for Finite Field Arithmetic for Elliptic Curve Cryptosystems

Christof Paar | C. Paar

[1] Christof Paar,et al. A super-serial Galois fields multiplier for FPGAs and its application to public-key algorithms , 1999, Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00375).

[2] Thomas Blum,et al. Modular Exponentiation on Reconfigurable Hardware , 1999 .

[3] Christof Paar,et al. Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms , 1998, CRYPTO.

[4] Keshab K. Parhi,et al. Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .

[5] Christof Paar,et al. Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m) , 1997, EUROCRYPT.

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

[7] Tolga Acar,et al. Analyzing and comparing Montgomery multiplication algorithms , 1996, IEEE Micro.

[8] David M'Raïhi,et al. Cryptographic smart cards , 1996, IEEE Micro.

[9] Colin D. Walter,et al. Hardware Implementation of Montgomery's Modular Multiplication Algorithm , 1993, IEEE Trans. Computers.

[10] Dieter Gollmann,et al. Algorithm engineering for public key algorithms , 1989, IEEE J. Sel. Areas Commun..