Redundant Representation of Finite Fields

Authors:
Willi Geiselmann;Harald Lukhaub
Affiliations:
-;-
Venue:
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Year:
2001

Citing 6
Cited 1

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Discrete logarithms in finite fields and their cryptographic significance

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases

IEEE Transactions on Computers
Optimal normal bases in GF(pn)

Discrete Applied Mathematics
VLSI design for exponentiation in GF(2n)

AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Differential Power Analysis

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology

Quantum binary field inversion: improved circuit depth via choice of basis representation

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A redundant representation of finite fields with 2n elements is presented. It unifies the advantages of polynomial and normal bases by the cost of redundancy. The arithmetic, especially exponentiation, in this representation is perfectly suited for low power computing: multiplication can be built up with reversible gates very efficient and squaring is a cyclic shift.