Demo Data from SIGIR 2026 / reviewers in the wild / expert
Willi Geiselmann
dblp:21/4037
· DBLP profile ↗
19ranked-venue papers
14as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 12 · 9 first-authorTheory of computation · 4 · 2 first-authorSystems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
6 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
4 papers |
Integrated circuit design · 54% High-performance computing · 46% | |
| Theoretical computer science
2 papers |
Coding theory · 100% |
Topics — the 16 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
integer factorization |
0.2 | 3 | 2007 | Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit · EUROCRYPT 2007 Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization · CHES 2005 Hardware to Solve Sparse Systems of Linear Equations over GF(2) · CHES 2003 |
High-performance computing
sparse linear solver |
0.1 | 2 | 2005 | Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization · CHES 2005 Hardware to Solve Sparse Systems of Linear Equations over GF(2) · CHES 2003 |
Integrated circuit design › digital circuit design
arithmetic circuit design |
0.1 | 2 | 2003 | A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits · IEEE Trans. Computers 2003 On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits" · IEEE Trans. Computers 2002 |
Coding theory › finite fields
finite field arithmetic |
0.1 | 2 | 2003 | A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits · IEEE Trans. Computers 2003 On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits" · IEEE Trans. Computers 2002 |
Cryptographic primitives and cryptanalysis › integer factorization
number field sieve |
0.1 | 1 | 2007 | Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit · EUROCRYPT 2007 |
Coding theory › finite fields › finite field arithmetic
redundant representation |
0.0 | 1 | 2003 | A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits · IEEE Trans. Computers 2003 |
Cryptographic primitives and cryptanalysis › provable security › security notions
chosen ciphertext attack |
0.0 | 1 | 2002 | Cryptanalysis of Polly Cracker · IEEE Trans. Inf. Theory 2002 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key cryptanalysis |
0.0 | 1 | 2002 | Cryptanalysis of Polly Cracker · IEEE Trans. Inf. Theory 2002 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.0 | 1 | 2002 | Cryptanalysis of Polly Cracker · IEEE Trans. Inf. Theory 2002 |
Integrated circuit design › finite field arithmetic
finite field arithmetic circuit |
0.0 | 1 | 2002 | On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits" · IEEE Trans. Computers 2002 |
Cryptographic primitives and cryptanalysis
hash function cryptanalysis |
0.0 | 1 | 2000 | Weaknesses in the SL2(IFs2) Hashing Scheme · CRYPTO 2000 |
Cryptographic primitives and cryptanalysis › hash functions
SL2 hashing |
0.0 | 1 | 2000 | Weaknesses in the SL2(IFs2) Hashing Scheme · CRYPTO 2000 |
Cryptographic primitives and cryptanalysis › stream cipher
clock-controlled shift registers |
0.0 | 1 | 1996 | Correlation Attacks on Cascades of Clock Controlled Shift Registers · ASIACRYPT 1996 |
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
correlation attack |
0.0 | 1 | 1996 | Correlation Attacks on Cascades of Clock Controlled Shift Registers · ASIACRYPT 1996 |
Cryptographic primitives and cryptanalysis
stream cipher |
0.0 | 1 | 1996 | Correlation Attacks on Cascades of Clock Controlled Shift Registers · ASIACRYPT 1996 |
Cryptographic primitives and cryptanalysis
algebraic cryptanalysis |
0.0 | 1 | 2000 | Weaknesses in the SL2(IFs2) Hashing Scheme · CRYPTO 2000 |
Methods — techniques the papers use, named apart from their topics
sparse linear algebra · 0.2residue class algebra · 0.1algebraic characterization · 0.1chosen-ciphertext attack · 0.0algebraic attack · 0.0correlation attack · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
Delphine Boucher, Philippe Gaborit, Willi Geiselmann, Olivier Ruatta, Felix Ulmer |
PQCrypto | 3 |
| 2007 | Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
Willi Geiselmann, Rainer Steinwandt |
EUROCRYPT | 1 |
| 2005 | Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, Eran Tromer |
CHES | 1 |
| 2004 | Yet Another Sieving Device
Willi Geiselmann, Rainer Steinwandt |
CT-RSA | 1 |
| 2004 | Attacks on a secure group communication scheme with hierarchical access controlabstractThis paper describes the attacks on a secure group communication with hierarchical access control, which arises in the communication group involving users with different privilege levels. The basic idea is to enable each subgroup to read the messages of those subgroups that are located at a lower level in the hierarchy. For such a setting, the Chinese remainder theorem based hierarchical access control scheme CRTHACS is proposed, which also aims at hiding the underlying hierarchy. Here we describe practical attacks, which allow for revealing at least parts of the hierarchy. Willi Geiselmann, Rainer Steinwandt |
ISIT | 1 |
| 2004 | Power attacks on a side-channel resistant elliptic curve implementation
Willi Geiselmann, Rainer Steinwandt |
Inf. Process. Lett. | 1 |
| 2003 | Hardware to Solve Sparse Systems of Linear Equations over GF(2)
Willi Geiselmann, Rainer Steinwandt |
CHES | 1 |
| 2003 | A Redundant Representation of GF(q^n) for Designing Arithmetic CircuitsabstractGeneralizing a construction of Silverman (1999), we describe a redundant representation of finite fields GF(qn), where computations in GF(qn) are realized through computations in a suitable residue class algebra. Our focus is on fields of characteristic ≠ 2 and we show that the representation discussed here can, in particular, be used for designing a highly regular multiplication circuit for GF qn). Willi Geiselmann, Rainer Steinwandt |
IEEE Trans. Computers | 1 |
| 2002 | On "A New Representation of Elements of Finite Fields GF (2m) Yielding Small Complexity Arithmetic Circuits"abstractFor original article see G. Drolet, ibid., vol. 47, no. 9, p. 938-946, (Sept 1998). We characterize the smallest n with GF(2)[X]/(X/sup n/ + 1) containing an isomorphic copy of GF(2/sup m/). This characterization shows that the representation of finite fields described in a previous issue of the IEEE Transactions on Computers is not "optimal" as claimed. The representation considered there can often be improved significantly. Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt |
IEEE Trans. Computers | 1 |
| 2002 | Cryptanalysis of Polly CrackerabstractAn attack on the public key cryptosystem Polly Cracker is described, that reveals the complete secret key /spl sigma/ /spl isin/ F/sub q//sup n/ by means of n (nonadaptively) chosen "fake" ciphertexts. Rainer Steinwandt, Willi Geiselmann |
IEEE Trans. Inf. Theory | 2 |
| 2001 | Attacking the Affine Parts of SFLASH
Willi Geiselmann, Rainer Steinwandt, Thomas Beth |
IMACC | 1 |
| 2001 | A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH
Rainer Steinwandt, Willi Geiselmann, Thomas Beth |
ISC | 2 |
| 2000 | Weaknesses in the SL2(IFs2) Hashing Scheme
Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth |
CRYPTO | 3 |
| 1997 | Constructing a Third-Order Linear Differential Equation
Willi Geiselmann, Felix Ulmer |
Theor. Comput. Sci. | 1 |
| 1996 | Correlation Attacks on Cascades of Clock Controlled Shift Registers
Willi Geiselmann, Dieter Gollmann |
ASIACRYPT | 1 |
| 1996 | A Note on the Hash Function of Tillich and Zémor
Willi Geiselmann |
FSE | 1 |
| 1995 | A Note on the Hash Function of Tillich and Zémor
Willi Geiselmann |
IMACC | 1 |
| 1993 | Self-Dual Bases in Fqn
Willi Geiselmann, Dieter Gollmann |
Des. Codes Cryptogr. | 1 |
| 1991 | Finding (good) Normal Bases in Finite FieldsabstractAn algorithm to generate low complexity normal bases in finite fields is presented.This algorithm generalizes the method of Ash et al. to fields of arbitrary characteristic.It can be applied to most finite fields and produces (under certain conditions) the multiplication matrix for the normal basis multiplication of GF'(qn) : GI'(q) in 0(n2 log2 n log q) bit-operations. Thomas Beth, Willi Geiselmann |
ISSAC | 2 |