| 2008 |
37 | | Jacques Calmet,
Willi Geiselmann,
Jörn Müller-Quade:
Mathematical Methods in Computer Science, MMICS 2008, Karlsruhe, Germany, December 17-19, 2008 - Essays in Memory of Thomas Beth
Springer 2008 |
36 | | Jacques Calmet,
Willi Geiselmann:
In memoriam Thomas Beth.
Appl. Algebra Eng. Commun. Comput. 19(3): 175-176 (2008) |
| 2007 |
35 | | Willi Geiselmann,
Rainer Steinwandt:
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit.
EUROCRYPT 2007: 466-481 |
34 | | Willi Geiselmann,
Rainer Steinwandt:
Cryptanalysis of a Hash Function Proposed at ICISC 2006.
ICISC 2007: 1-10 |
33 | | Delphine Boucher,
Willi Geiselmann,
Felix Ulmer:
Skew-cyclic codes.
Appl. Algebra Eng. Commun. Comput. 18(4): 379-389 (2007) |
32 | | Willi Geiselmann,
Rainer Steinwandt:
Special-Purpose Hardware in Cryptanalysis: The Case of 1, 024-Bit RSA.
IEEE Security & Privacy 5(1): 63-66 (2007) |
| 2006 |
31 | | Willi Geiselmann,
Fabian Januszewski,
Hubert Köpfer,
Jan Pelzl,
Rainer Steinwandt:
A Simpler Sieving Device: Combining ECM and TWIRL.
ICISC 2006: 118-135 |
30 | | Thomas Beth,
Willi Geiselmann,
Rainer Steinwandt:
Mathematical Techniques in Cryptology-Editorial.
Appl. Algebra Eng. Commun. Comput. 16(6): 377-378 (2006) |
29 | | 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) |
| 2005 |
28 | | 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 |
27 | | Willi Geiselmann,
Hubert Köpfer,
Rainer Steinwandt,
Eran Tromer:
Improved Routing-Based Linear Algebra for the Number Field Sieve.
ITCC (1) 2005: 636-641 |
| 2004 |
26 | | Willi Geiselmann,
Rainer Steinwandt:
Yet Another Sieving Device.
CT-RSA 2004: 278-291 |
25 | | Willi Geiselmann,
Rainer Steinwandt:
Power attacks on a side-channel resistant elliptic curve implementation.
Inf. Process. Lett. 91(1): 29-32 (2004) |
| 2003 |
24 | | Willi Geiselmann,
Rainer Steinwandt:
Hardware to Solve Sparse Systems of Linear Equations over GF(2).
CHES 2003: 51-61 |
23 | | Willi Geiselmann,
Rainer Steinwandt:
On the security of cryptographic primitives regarding technological innovations.
GI Jahrestagung (1) 2003: 99-102 |
22 | | Willi Geiselmann,
Rainer Steinwandt:
A Dedicated Sieving Hardware.
Public Key Cryptography 2003: 254-266 |
21 | | Willi Geiselmann,
Rainer Steinwandt:
A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits.
IEEE Trans. Computers 52(7): 848-853 (2003) |
20 | | 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) |
| 2002 |
19 | | Willi Geiselmann,
Jörn Müller-Quade,
Rainer Steinwandt,
Thomas Beth:
Über Quantencomputer und Quantenkryptographie.
Datenschutz und Datensicherheit 26(8): (2002) |
18 | | Willi Geiselmann,
Jörn Müller-Quade,
Rainer Steinwandt:
On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits".
IEEE Trans. Computers 51(12): 1460-1461 (2002) |
17 | | Rainer Steinwandt,
Willi Geiselmann:
Cryptanalysis of Polly Cracker.
IEEE Transactions on Information Theory 48(11): 2990-2991 (2002) |
16 | | Rainer Steinwandt,
Willi Geiselmann,
Regine Endsuleit:
Attacking a polynomial-based cryptosystem: Polly Cracker.
Int. J. Inf. Sec. 1(3): 143-148 (2002) |
| 2001 |
15 | | Willi Geiselmann,
Rainer Steinwandt,
Thomas Beth:
Attacking the Affine Parts of SFLASH.
IMA Int. Conf. 2001: 355-359 |
14 | | Rainer Steinwandt,
Willi Geiselmann,
Thomas Beth:
A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH.
ISC 2001: 280-293 |
13 | | 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 |
12 | | Willi Geiselmann,
Harald Lukhaub:
Redundant Representation of Finite Fields.
Public Key Cryptography 2001: 339-352 |
11 | | Willi Geiselmann,
Rainer Steinwandt:
Kryptoanalyse der Ruland/Schweitzer-Signatur von Bitströmen.
Datenschutz und Datensicherheit 25(10): (2001) |
| 2000 |
10 | | Rainer Steinwandt,
Markus Grassl,
Willi Geiselmann,
Thomas Beth:
Weaknesses in the SL2(IFs2) Hashing Scheme.
CRYPTO 2000: 287-299 |
| 1999 |
9 | | Markus Grassl,
Willi Geiselmann,
Thomas Beth:
Quantum Reed-Solomon Codes.
AAECC 1999: 231-244 |
| 1997 |
8 | | Willi Geiselmann,
Felix Ulmer:
Constructing a Third-Order Linear Differential Equation.
Theor. Comput. Sci. 187(1-2): 3-6 (1997) |
| 1996 |
7 | | Willi Geiselmann,
Dieter Gollmann:
Correlation Attacks on Cascades of Clock Controlled Shift Registers.
ASIACRYPT 1996: 346-359 |
6 | | Willi Geiselmann:
A Note on the Hash Function of Tillich and Zémor.
FSE 1996: 51-52 |
| 1995 |
5 | | Willi Geiselmann:
A Note on the Hash Function of Tillich and Zémor.
IMA Conf. 1995: 257-263 |
| 1993 |
4 | | Willi Geiselmann,
Dieter Gollmann:
Self-Dual Bases in Fqn.
Des. Codes Cryptography 3(4): 333-345 (1993) |
| 1991 |
3 | | Thomas Beth,
Willi Geiselmann,
F. Meyer:
Finding (good) Normal Bases in Finite Fields.
ISSAC 1991: 173-178 |
| 1990 |
2 | | Willi Geiselmann,
Dieter Gollmann:
VLSI Design for Exponentiation in GF (2n).
AUSCRYPT 1990: 398-405 |
| 1988 |
1 | | Willi Geiselmann,
Dieter Gollmann:
Symmetry and Duality in Normal Basis Multiplication.
AAECC 1988: 230-238 |