Architectures for exponentiation in GF (2n)

Authors:
T. Beth;B. M. Cook;D. Gollmann
Affiliations:
Univ. of Karlsruhe, Karlsruhe, W. Germany;Univ. of Surrey, Surrey, UK;Univ. of Karlsruhe, Karlsruhe, W. Germany
Venue:
Proceedings on Advances in cryptology---CRYPTO '86
Year:
1987

Citing 0
Cited 7

THOMAS—A complete single chip RSA device

Proceedings on Advances in cryptology---CRYPTO '86
Efficient zero-knowledged identification scheme for smart cards

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Constructing normal bases in finite fields

Journal of Symbolic Computation
Efficient Exponentiation of a Primitive Root in GF(2m)

IEEE Transactions on Computers
Architectures for Exponentiation Over GD(2/sup n/) Adopted for Smartcard Application

IEEE Transactions on Computers
A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)

CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Low-power and high-speed design of a versatile bit-serial multiplier in finite fields GF(2m)

Integration, the VLSI Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate different data structures in GF(2n) and their correspondence to silicon architectures to examine possible hardware implementations of the Diffie-Hellman key exchange system.