Veröffentlichungen

Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

1998 - D. Bailey, Chris­tof Paar

CRYPTO '98, Santa Barbara, CA, USA, August 23-27, 1998 [ps] [pdf]

Optimized Arithmetic for Reed-Solomon Encoders

1997 - Chris­tof Paar

1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29 - July 4, 1997. [ps]

Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)

1997 - Chris­tof Paar, P. Soria-Rodriguez

EUROCRYPT '97, Konstanz, Germany, May 11-15, 1997. [ps]

Comparison of Arithmetic Architectures for Reed-Solomon Decoders in Reconfigurable Hardware

1997 - Chris­tof Paar, M. Rosner

Fifth Annual IEEE Symposium on Field-Programmable Custom Computing Machines "FCCM '97", Nappa Valley, CA, USA, April 16-18, 1997. [web] [ps]
Seite: