Willi Geiselmann

Willi Geiselmann, Kenneth Matheis, Rainer Steinwandt: PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware. Transactions on Computational Science 10: 298-328 (2010)

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

Willi Geiselmann, Kenneth Matheis, Rainer Steinwandt: PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware. IACR Cryptology ePrint Archive 2009: 222 (2009)

Jacques Calmet, Willi Geiselmann: In memoriam Thomas Beth. Appl. Algebra Eng. Commun. Comput. 19(3): 175-176 (2008)

Jacques Calmet, Willi Geiselmann, Jörn Müller-Quade (Eds.): Mathematical Methods in Computer Science, MMICS 2008, Karlsruhe, Germany, December 17-19, 2008 - Essays in Memory of Thomas Beth. Lecture Notes in Computer Science 5393, Springer 2008, isbn 978-3-540-89993-8

Delphine Boucher, Willi Geiselmann, Felix Ulmer: Skew-cyclic codes. Appl. Algebra Eng. Commun. Comput. 18(4): 379-389 (2007)

Willi Geiselmann, Rainer Steinwandt: Special-Purpose Hardware in Cryptanalysis: The Case of 1, 024-Bit RSA. IEEE Security & Privacy 5(1): 63-66 (2007)

Willi Geiselmann, Rainer Steinwandt: Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit. EUROCRYPT 2007: 466-481

Willi Geiselmann, Rainer Steinwandt: Cryptanalysis of a Hash Function Proposed at ICISC 2006. ICISC 2007: 1-10

Willi Geiselmann, Rainer Steinwandt: Cryptanalysis of a Hash Function Proposed at ICISC 2006. IACR Cryptology ePrint Archive 2007: 272 (2007)

Thomas Beth, Willi Geiselmann, Rainer Steinwandt: Mathematical Techniques in Cryptology-Editorial. Appl. Algebra Eng. Commun. Comput. 16(6): 377-378 (2006)

Willi Geiselmann, Maria Isabel Gonzalez Vasco, Rainer Steinwandt: Entwurf asymmetrischer kryptographischer Verfahren unter Berücksichtigung von Quantenalgorithmen (Design of Asymmetric Cryptographic Schemes Taking Into Account Quantum Algorithms). it - Information Technology 48(6): 327- (2006)

Willi Geiselmann, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, Rainer Steinwandt: A Simpler Sieving Device: Combining ECM and TWIRL. ICISC 2006: 118-135

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

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

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

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

Willi Geiselmann, Rainer Steinwandt: Power attacks on a side-channel resistant elliptic curve implementation. Inf. Process. Lett. 91(1): 29-32 (2004)

Willi Geiselmann, Rainer Steinwandt: Yet Another Sieving Device. CT-RSA 2004: 278-291

Willi Geiselmann, Willi Meier, Rainer Steinwandt: An attack on the isomorphisms of polynomials problem with one secret. Int. J. Inf. Sec. 2(1): 59-64 (2003)

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

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

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

Willi Geiselmann, Rainer Steinwandt: A Dedicated Sieving Hardware. Public Key Cryptography 2003: 254-266

Willi Geiselmann, Rainer Steinwandt: Yet Another Sieving Device. IACR Cryptology ePrint Archive 2003: 202 (2003)

Willi Geiselmann, Rainer Steinwandt: A short comment on the affine parts of SFLASH^{v3}. IACR Cryptology ePrint Archive 2003: 220 (2003)

Willi Geiselmann, Rainer Steinwandt: Attacks on a Secure Group Communication Scheme With Hierarchical Access Control. IACR Cryptology ePrint Archive 2003: 227 (2003)

Willi Geiselmann, Rainer Steinwandt: A Key Substitution Attack on SFLASH^{v3}. IACR Cryptology ePrint Archive 2003: 245 (2003)

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

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

Willi Geiselmann, Rainer Steinwandt: Cryptanalysis of a knapsack-like cryptosystem. Periodica Mathematica Hungarica 45(1-2): 35-41 (2002)

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

Rainer Steinwandt, Willi Geiselmann: Cryptanalysis of Polly Cracker. IEEE Transactions on Information Theory 48(11): 2990-2991 (2002)

Willi Geiselmann, Willi Meier, Rainer Steinwandt: An Attack on the Isomorphisms of Polynomials Problem with One Secret. IACR Cryptology ePrint Archive 2002: 143 (2002)

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

Willi Geiselmann, Rainer Steinwandt, Thomas Beth: Attacking the Affine Parts of SFLASH. IMA Int. Conf. 2001: 355-359

Rainer Steinwandt, Willi Geiselmann, Thomas Beth: A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH. ISC 2001: 280-293

Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu: Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. Public Key Cryptography 2001: 153-164

Willi Geiselmann, Harald Lukhaub: Redundant Representation of Finite Fields. Public Key Cryptography 2001: 339-352

Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth: Weaknesses in the SL₂(IF_s²) Hashing Scheme. CRYPTO 2000: 287-299

Markus Grassl, Willi Geiselmann, Thomas Beth: Quantum Reed-Solomon Codes. AAECC 1999: 231-244

Willi Geiselmann, Felix Ulmer: Constructing a Third-Order Linear Differential Equation. Theor. Comput. Sci. 187(1-2): 3-6 (1997)

Willi Geiselmann, Dieter Gollmann: Correlation Attacks on Cascades of Clock Controlled Shift Registers. ASIACRYPT 1996: 346-359

Willi Geiselmann: A Note on the Hash Function of Tillich and Zémor. FSE 1996: 51-52

Willi Geiselmann: A Note on the Hash Function of Tillich and Zémor. IMA Conf. 1995: 257-263

Willi Geiselmann, Dieter Gollmann: Self-Dual Bases in F_qⁿ. Des. Codes Cryptography 3(4): 333-345 (1993)

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

Willi Geiselmann, Dieter Gollmann: VLSI Design for Exponentiation in GF (2ⁿ). AUSCRYPT 1990: 398-405

Willi Geiselmann, Dieter Gollmann: Symmetry and Duality in Normal Basis Multiplication. AAECC 1988: 230-238