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]

Securing ATM

1997 - G. Haskins, Chris­tof Paar, S. Dempsey

1997 RSA Data Security Conference, San Francisco, CA, USA, January 28-31, 1997. [web]

A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields

1996 - Chris­tof Paar

IEEE Transactions on Computers, vol. 45, no. 7, pp. 856-861, July, 1996. [ps]

Recent Developments in Digital Wireless Network Security

1996 - G. Pierce, Chris­tof Paar

Massachusetts Telecommunication Council and UMass Technical Conference on Telecommunications, Lowell, March, 1996. [ps]

Some Remarks on Efficient Inversion in Finite Fields

1995 - Chris­tof Paar

1995 IEEE International Symposium on Information Theory, Whistler, B.C. Canada, September, 1995. [ps]

A Comparitive VLSI Synthesis of Finite Field Multipliers

1995 - Chris­tof Paar, N. Lange

3rd International Symposium on Communication Theory and its Applications, Lake District, UK, July, 1995. [ps]

Implementation of a Reprogrammable Reed-Solomon Decoder over GF(216) on a Digital Signal Processor with External Arithmetic Unit

1994 - Chris­tof Paar, O. Hooijen

Fourth International European Space Agency (ESA) Workshop on Digital Signal Processing Techniques Applied to Space Communications, King's College, London, September, 1994. [ps]

Low Complexity Parallel Multipliers for Galois Fields GF((2n)4) Based on Special Types of Primitive Polynomials

1994 - Chris­tof Paar

1994 IEEE International Symposium on Information Theory, Trondheim, Norway, June, 1994