Symmetry and Duality in Normal Basis Multiplication. - Willi Geiselmann; Dieter Gollmann (AAECC, 1988)

VLSI Design for Exponentiation in GF (2n). - Willi Geiselmann; Dieter Gollmann (AUSCRYPT, 1990)

Finding (good) Normal Bases in Finite Fields. - Thomas Beth; Willi Geiselmann; F. Meyer (ISSAC, 1991)

Self-Dual Bases in Fqn. - Willi Geiselmann; Dieter Gollmann (Des. Codes Cryptogr., 1993)

Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in endlichen Körpern. - Willi Geiselmann (Shaker, 1994)

A Note on the Hash Function of Tillich and Zémor. - Willi Geiselmann (IMACC, 1995)

Correlation Attacks on Cascades of Clock Controlled Shift Registers. - Willi Geiselmann; Dieter Gollmann (ASIACRYPT, 1996)

Constructing a Third-Order Linear Differential Equation. - Willi Geiselmann; Felix Ulmer (Theor. Comput. Sci., 1997)

Quantum Reed-Solomon Codes. - Markus Grassl; Willi Geiselmann; Thomas Beth (AAECC, 1999)

Weaknesses in the SL2(IFs2) Hashing Scheme. - Rainer Steinwandt; Markus Grassl; Willi Geiselmann; Thomas Beth (CRYPTO, 2000)

Attacking the Affine Parts of SFLASH. - Willi Geiselmann; Rainer Steinwandt; Thomas Beth (IMACC, 2001)

A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH. - Rainer Steinwandt; Willi Geiselmann; Thomas Beth (ISC, 2001)

Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. - Feng Bao 001; Robert H. Deng; Willi Geiselmann; Claus-Peter Schnorr; Rainer Steinwandt; Hongjun Wu 001 (Public Key Cryptography, 2001)

Redundant Representation of Finite Fields. - Willi Geiselmann; Harald Lukhaub (Public Key Cryptography, 2001)

Kryptoanalyse der Ruland/Schweitzer-Signatur von Bitströmen. - Willi Geiselmann; Rainer Steinwandt (Datenschutz und Datensicherheit, 2001)

Über Quantencomputer und Quantenkryptographie. - Willi Geiselmann; Jörn Müller-Quade; Rainer Steinwandt; Thomas Beth (Datenschutz und Datensicherheit, 2002)

An Attack on the Isomorphisms of Polynomials Problem with One Secret. - Willi Geiselmann; Willi Meier; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2002)

Attacking a polynomial-based cryptosystem: Polly Cracker. - Rainer Steinwandt; Willi Geiselmann; Regine Endsuleit (Int. J. Inf. Sec., 2002)

Cryptanalysis of a knapsack-like cryptosystem. - Willi Geiselmann; Rainer Steinwandt (Period. Math. Hung., 2002)

On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits". - Willi Geiselmann; Jörn Müller-Quade; Rainer Steinwandt (IEEE Trans. Computers, 2002)

Cryptanalysis of Polly Cracker. - Rainer Steinwandt; Willi Geiselmann (IEEE Trans. Inf. Theory, 2002)

Hardware to Solve Sparse Systems of Linear Equations over GF(2). - Willi Geiselmann; Rainer Steinwandt (CHES, 2003)

On the security of cryptographic primitives regarding technological innovations. - Willi Geiselmann; Rainer Steinwandt (GI Jahrestagung (1), 2003)

A Dedicated Sieving Hardware. - Willi Geiselmann; Rainer Steinwandt (Public Key Cryptography, 2003)

Yet Another Sieving Device. - Willi Geiselmann; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2003)

A short comment on the affine parts of SFLASHv3. - Willi Geiselmann; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2003)

Attacks on a Secure Group Communication Scheme With Hierarchical Access Control. - Willi Geiselmann; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2003)

A Key Substitution Attack on SFLASHv3. - Willi Geiselmann; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2003)

A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits. - Willi Geiselmann; Rainer Steinwandt (IEEE Trans. Computers, 2003)

Power attacks on a side-channel resistant elliptic curve implementation. - Willi Geiselmann; Rainer Steinwandt (Inf. Process. Lett., 2004)

Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization. - Willi Geiselmann; Adi Shamir; Rainer Steinwandt; Eran Tromer (CHES, 2005)

Improved Routing-Based Linear Algebra for the Number Field Sieve. - Willi Geiselmann; Hubert Köpfer; Rainer Steinwandt; Eran Tromer (ITCC (1), 2005)

Mathematical Techniques in Cryptology-Editorial. - Thomas Beth; Willi Geiselmann; Rainer Steinwandt (Appl. Algebra Eng. Commun. Comput., 2006)

A Simpler Sieving Device: Combining ECM and TWIRL. - Willi Geiselmann; Fabian Januszewski; Hubert Köpfer; Jan Pelzl; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2006)

Non-Wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-bit. - Willi Geiselmann; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2006)

Entwurf asymmetrischer kryptographischer Verfahren unter Berücksichtigung von Quantenalgorithmen (Design of Asymmetric Cryptographic Schemes Taking Into Account Quantum Algorithms). - Willi Geiselmann; María Isabel González Vasco; Rainer Steinwandt (it Inf. Technol., 2006)

Skew-cyclic codes. - Delphine Boucher; Willi Geiselmann; Felix Ulmer (Appl. Algebra Eng. Commun. Comput., 2007)

Cryptanalysis of a Hash Function Proposed at ICISC 2006. - Willi Geiselmann; Rainer Steinwandt (IACR Cryptol. ePrint Arch., 2007)

Special-Purpose Hardware in Cryptanalysis: The Case of 1, 024-Bit RSA. - Willi Geiselmann; Rainer Steinwandt (IEEE Secur. Priv., 2007)

In memoriam Thomas Beth. - Jacques Calmet; Willi Geiselmann (Appl. Algebra Eng. Commun. Comput., 2008)

Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials. - Delphine Boucher; Philippe Gaborit; Willi Geiselmann; Olivier Ruatta; Felix Ulmer (PQCrypto, 2010)

PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware. - Willi Geiselmann; Kenneth Matheis; Rainer Steinwandt (Trans. Comput. Sci., 2010)

Block cipher based security for severely resource-constrained implantable medical devices. - Christoph Beck; Daniel Masny; Willi Geiselmann; Georg Bretthauer (ISABEL, 2011)