default search action
Willi Geiselmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c24]Christoph Beck, Daniel Masny, Willi Geiselmann, Georg Bretthauer:
Block cipher based security for severely resource-constrained implantable medical devices. ISABEL 2011: 62:1-62:5 - 2010
- [j17]Willi Geiselmann, Kenneth Matheis, Rainer Steinwandt:
PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware. Trans. Comput. Sci. 10: 298-328 (2010) - [c23]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
2000 – 2009
- 2009
- [i9]Willi Geiselmann, Kenneth Matheis, Rainer Steinwandt:
PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware. IACR Cryptol. ePrint Arch. 2009: 222 (2009) - 2008
- [j16]Jacques Calmet, Willi Geiselmann:
In memoriam Thomas Beth. Appl. Algebra Eng. Commun. Comput. 19(3): 175-176 (2008) - [e1]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. Lecture Notes in Computer Science 5393, Springer 2008, ISBN 978-3-540-89993-8 [contents] - 2007
- [j15]Delphine Boucher, Willi Geiselmann, Felix Ulmer:
Skew-cyclic codes. Appl. Algebra Eng. Commun. Comput. 18(4): 379-389 (2007) - [j14]Willi Geiselmann, Rainer Steinwandt:
Special-Purpose Hardware in Cryptanalysis: The Case of 1, 024-Bit RSA. IEEE Secur. Priv. 5(1): 63-66 (2007) - [c22]Willi Geiselmann, Rainer Steinwandt:
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit. EUROCRYPT 2007: 466-481 - [c21]Willi Geiselmann, Rainer Steinwandt:
Cryptanalysis of a Hash Function Proposed at ICISC 2006. ICISC 2007: 1-10 - [i8]Willi Geiselmann, Rainer Steinwandt:
Cryptanalysis of a Hash Function Proposed at ICISC 2006. IACR Cryptol. ePrint Arch. 2007: 272 (2007) - 2006
- [j13]Thomas Beth, Willi Geiselmann, Rainer Steinwandt:
Mathematical Techniques in Cryptology-Editorial. Appl. Algebra Eng. Commun. Comput. 16(6): 377-378 (2006) - [j12]Willi Geiselmann, María Isabel González Vasco, Rainer Steinwandt:
Entwurf asymmetrischer kryptographischer Verfahren unter Berücksichtigung von Quantenalgorithmen (Design of Asymmetric Cryptographic Schemes Taking Into Account Quantum Algorithms). it Inf. Technol. 48(6): 327- (2006) - [c20]Willi Geiselmann, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, Rainer Steinwandt:
A Simpler Sieving Device: Combining ECM and TWIRL. ICISC 2006: 118-135 - [i7]Willi Geiselmann, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, Rainer Steinwandt:
A Simpler Sieving Device: Combining ECM and TWIRL. IACR Cryptol. ePrint Arch. 2006: 109 (2006) - [i6]Willi Geiselmann, Rainer Steinwandt:
Non-Wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-bit. IACR Cryptol. ePrint Arch. 2006: 403 (2006) - 2005
- [c19]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 - [c18]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
- [j11]Willi Geiselmann, Rainer Steinwandt:
Power attacks on a side-channel resistant elliptic curve implementation. Inf. Process. Lett. 91(1): 29-32 (2004) - [c17]Willi Geiselmann, Rainer Steinwandt:
Yet Another Sieving Device. CT-RSA 2004: 278-291 - [c16]Willi Geiselmann, Rainer Steinwandt:
Attacks on a secure group communication scheme with hierarchical access control. ISIT 2004: 14 - 2003
- [j10]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) - [j9]Willi Geiselmann, Rainer Steinwandt:
A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits. IEEE Trans. Computers 52(7): 848-853 (2003) - [c15]Willi Geiselmann, Rainer Steinwandt:
Hardware to Solve Sparse Systems of Linear Equations over GF(2). CHES 2003: 51-61 - [c14]Willi Geiselmann, Rainer Steinwandt:
On the security of cryptographic primitives regarding technological innovations. GI Jahrestagung (1) 2003: 99-102 - [c13]Willi Geiselmann, Rainer Steinwandt:
A Dedicated Sieving Hardware. Public Key Cryptography 2003: 254-266 - [i5]Willi Geiselmann, Rainer Steinwandt:
Yet Another Sieving Device. IACR Cryptol. ePrint Arch. 2003: 202 (2003) - [i4]Willi Geiselmann, Rainer Steinwandt:
A short comment on the affine parts of SFLASHv3. IACR Cryptol. ePrint Arch. 2003: 220 (2003) - [i3]Willi Geiselmann, Rainer Steinwandt:
Attacks on a Secure Group Communication Scheme With Hierarchical Access Control. IACR Cryptol. ePrint Arch. 2003: 227 (2003) - [i2]Willi Geiselmann, Rainer Steinwandt:
A Key Substitution Attack on SFLASHv3. IACR Cryptol. ePrint Arch. 2003: 245 (2003) - 2002
- [j8]Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt, Thomas Beth:
Über Quantencomputer und Quantenkryptographie. Datenschutz und Datensicherheit 26(8) (2002) - [j7]Rainer Steinwandt, Willi Geiselmann, Regine Endsuleit:
Attacking a polynomial-based cryptosystem: Polly Cracker. Int. J. Inf. Sec. 1(3): 143-148 (2002) - [j6]Willi Geiselmann, Rainer Steinwandt:
Cryptanalysis of a knapsack-like cryptosystem. Period. Math. Hung. 45(1-2): 35-41 (2002) - [j5]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) - [j4]Rainer Steinwandt, Willi Geiselmann:
Cryptanalysis of Polly Cracker. IEEE Trans. Inf. Theory 48(11): 2990-2991 (2002) - [i1]Willi Geiselmann, Willi Meier, Rainer Steinwandt:
An Attack on the Isomorphisms of Polynomials Problem with One Secret. IACR Cryptol. ePrint Arch. 2002: 143 (2002) - 2001
- [j3]Willi Geiselmann, Rainer Steinwandt:
Kryptoanalyse der Ruland/Schweitzer-Signatur von Bitströmen. Datenschutz und Datensicherheit 25(10) (2001) - [c12]Willi Geiselmann, Rainer Steinwandt, Thomas Beth:
Attacking the Affine Parts of SFLASH. IMACC 2001: 355-359 - [c11]Rainer Steinwandt, Willi Geiselmann, Thomas Beth:
A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH. ISC 2001: 280-293 - [c10]Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu:
Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. Public Key Cryptography 2001: 153-164 - [c9]Willi Geiselmann, Harald Lukhaub:
Redundant Representation of Finite Fields. Public Key Cryptography 2001: 339-352 - 2000
- [c8]Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth:
Weaknesses in the SL2(IFs2) Hashing Scheme. CRYPTO 2000: 287-299
1990 – 1999
- 1999
- [c7]Markus Grassl, Willi Geiselmann, Thomas Beth:
Quantum Reed-Solomon Codes. AAECC 1999: 231-244 - 1997
- [j2]Willi Geiselmann, Felix Ulmer:
Constructing a Third-Order Linear Differential Equation. Theor. Comput. Sci. 187(1-2): 3-6 (1997) - 1996
- [c6]Willi Geiselmann, Dieter Gollmann:
Correlation Attacks on Cascades of Clock Controlled Shift Registers. ASIACRYPT 1996: 346-359 - [c5]Willi Geiselmann:
A Note on the Hash Function of Tillich and Zémor. FSE 1996: 51-52 - 1995
- [c4]Willi Geiselmann:
A Note on the Hash Function of Tillich and Zémor. IMACC 1995: 257-263 - 1994
- [b1]Willi Geiselmann:
Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in endlichen Körpern. Karlsruhe Institute of Technology, Germany, Shaker 1994, ISBN 978-3-86111-905-0, pp. 1-130 - 1993
- [j1]Willi Geiselmann, Dieter Gollmann:
Self-Dual Bases in Fqn. Des. Codes Cryptogr. 3(4): 333-345 (1993) - 1991
- [c3]Thomas Beth, Willi Geiselmann, F. Meyer:
Finding (good) Normal Bases in Finite Fields. ISSAC 1991: 173-178 - 1990
- [c2]Willi Geiselmann, Dieter Gollmann:
VLSI Design for Exponentiation in GF (2n). AUSCRYPT 1990: 398-405
1980 – 1989
- 1988
- [c1]Willi Geiselmann, Dieter Gollmann:
Symmetry and Duality in Normal Basis Multiplication. AAECC 1988: 230-238
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint