2008 |
50 | EE | Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
Applications of algebra to cryptography.
Discrete Applied Mathematics 156(16): 3071 (2008) |
49 | EE | Rainer Steinwandt,
Viktória I. Villányi:
A one-time signature using run-length encoding.
Inf. Process. Lett. 108(4): 179-185 (2008) |
2007 |
48 | EE | Willi Geiselmann,
Rainer Steinwandt:
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit.
EUROCRYPT 2007: 466-481 |
47 | EE | Willi Geiselmann,
Rainer Steinwandt:
Cryptanalysis of a Hash Function Proposed at ICISC 2006.
ICISC 2007: 1-10 |
46 | EE | Michel Abdalla,
Jens-Matthias Bohli,
Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
(Password) Authenticated Key Establishment: From 2-Party to Group.
TCC 2007: 499-514 |
45 | EE | Jens-Matthias Bohli,
Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
Secure group key establishment revisited.
Int. J. Inf. Sec. 6(4): 243-254 (2007) |
2006 |
44 | EE | Dominik Raub,
Rainer Steinwandt:
An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction.
ETRICS 2006: 130-144 |
43 | EE | Willi Geiselmann,
Fabian Januszewski,
Hubert Köpfer,
Jan Pelzl,
Rainer Steinwandt:
A Simpler Sieving Device: Combining ECM and TWIRL.
ICISC 2006: 118-135 |
42 | EE | Jens-Matthias Bohli,
Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
A Subliminal-Free Variant of ECDSA.
Information Hiding 2006: 375-387 |
41 | EE | Jens-Matthias Bohli,
Rainer Steinwandt:
Deniable Group Key Agreement.
VIETCRYPT 2006: 298-311 |
40 | EE | Jens-Matthias Bohli,
Benjamin Glas,
Rainer Steinwandt:
Towards Provably Secure Group Key Agreement Building on Group Theory.
VIETCRYPT 2006: 322-336 |
39 | EE | Thomas Beth,
Willi Geiselmann,
Rainer Steinwandt:
Mathematical Techniques in Cryptology-Editorial.
Appl. Algebra Eng. Commun. Comput. 16(6): 377-378 (2006) |
38 | EE | Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
Pitfalls in public key cryptosystems based on free partially commutative monoids and groups.
Appl. Math. Lett. 19(10): 1037-1041 (2006) |
37 | EE | Jens-Matthias Bohli,
Stefan Röhrich,
Rainer Steinwandt:
Key substitution attacks revisited: Taking into account malicious signers.
Int. J. Inf. Sec. 5(1): 30-36 (2006) |
36 | EE | Thomas Beth,
Jörn Müller-Quade,
Rainer Steinwandt:
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm.
J. Symb. Comput. 41(3-4): 372-380 (2006) |
35 | EE | 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 |
34 | EE | 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 |
33 | EE | Willi Geiselmann,
Hubert Köpfer,
Rainer Steinwandt,
Eran Tromer:
Improved Routing-Based Linear Algebra for the Number Field Sieve.
ITCC (1) 2005: 636-641 |
32 | EE | Dominik Raub,
Rainer Steinwandt,
Jörn Müller-Quade:
On the Security and Composability of the One Time Pad.
SOFSEM 2005: 288-297 |
31 | EE | Maria Isabel Gonzalez Vasco,
Consuelo Martínez,
Rainer Steinwandt,
Jorge Luis Villar:
A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes.
TCC 2005: 495-509 |
30 | EE | Jens-Matthias Bohli,
Rainer Steinwandt,
Maria Isabel Gonzalez Vasco,
Consuelo Martínez:
Weak Keys in MST1.
Des. Codes Cryptography 37(3): 509-524 (2005) |
2004 |
29 | EE | Willi Geiselmann,
Rainer Steinwandt:
Yet Another Sieving Device.
CT-RSA 2004: 278-291 |
28 | EE | Michael Backes,
Markus Dürmuth,
Rainer Steinwandt:
An Algebra for Composing Enterprise Privacy Policies.
ESORICS 2004: 33-52 |
27 | EE | Jens-Matthias Bohli,
Rainer Steinwandt:
On Subliminal Channels in Deterministic Signature Schemes.
ICISC 2004: 182-194 |
26 | EE | Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem.
Appl. Algebra Eng. Commun. Comput. 14(5): 335-340 (2004) |
25 | EE | Maria Isabel Gonzalez Vasco,
Dennis Hofheinz,
Consuelo Martínez,
Rainer Steinwandt:
On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups.
Des. Codes Cryptography 32(1-3): 207-216 (2004) |
24 | EE | Maria Isabel Gonzalez Vasco,
Consuelo Martínez,
Rainer Steinwandt:
Towards a Uniform Description of Several Group Based Cryptographic Primitives.
Des. Codes Cryptography 33(3): 215-226 (2004) |
23 | EE | Willi Geiselmann,
Rainer Steinwandt:
Power attacks on a side-channel resistant elliptic curve implementation.
Inf. Process. Lett. 91(1): 29-32 (2004) |
2003 |
22 | EE | Willi Geiselmann,
Rainer Steinwandt:
Hardware to Solve Sparse Systems of Linear Equations over GF(2).
CHES 2003: 51-61 |
21 | EE | Dennis Hofheinz,
Jörn Müller-Quade,
Rainer Steinwandt:
Initiator-Resilient Universally Composable Key Exchange.
ESORICS 2003: 61-84 |
20 | | Willi Geiselmann,
Rainer Steinwandt:
On the security of cryptographic primitives regarding technological innovations.
GI Jahrestagung (1) 2003: 99-102 |
19 | EE | Dennis Hofheinz,
Rainer Steinwandt:
A Practical Attack on Some Braid Group Based Cryptographic Primitives.
Public Key Cryptography 2003: 187-198 |
18 | EE | Willi Geiselmann,
Rainer Steinwandt:
A Dedicated Sieving Hardware.
Public Key Cryptography 2003: 254-266 |
17 | EE | Willi Geiselmann,
Rainer Steinwandt:
A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits.
IEEE Trans. Computers 52(7): 848-853 (2003) |
16 | EE | 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 |
15 | | Willi Geiselmann,
Jörn Müller-Quade,
Rainer Steinwandt,
Thomas Beth:
Über Quantencomputer und Quantenkryptographie.
Datenschutz und Datensicherheit 26(8): (2002) |
14 | EE | 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) |
13 | | Rainer Steinwandt,
Willi Geiselmann:
Cryptanalysis of Polly Cracker.
IEEE Transactions on Information Theory 48(11): 2990-2991 (2002) |
12 | EE | Rainer Steinwandt,
Willi Geiselmann,
Regine Endsuleit:
Attacking a polynomial-based cryptosystem: Polly Cracker.
Int. J. Inf. Sec. 1(3): 143-148 (2002) |
11 | EE | Marcus Hausdorf,
Werner M. Seiler,
Rainer Steinwandt:
Involutive Bases in the Weyl Algebra.
J. Symb. Comput. 34(3): 181-198 (2002) |
2001 |
10 | EE | Willi Geiselmann,
Rainer Steinwandt,
Thomas Beth:
Attacking the Affine Parts of SFLASH.
IMA Int. Conf. 2001: 355-359 |
9 | EE | Rainer Steinwandt,
Willi Geiselmann,
Thomas Beth:
A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH.
ISC 2001: 280-293 |
8 | EE | 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 |
7 | EE | Rainer Steinwandt:
Loopholes in Two Public Key Cryptosystems Using the Modular Group.
Public Key Cryptography 2001: 180-189 |
6 | | Willi Geiselmann,
Rainer Steinwandt:
Kryptoanalyse der Ruland/Schweitzer-Signatur von Bitströmen.
Datenschutz und Datensicherheit 25(10): (2001) |
5 | EE | Maria Isabel Gonzalez Vasco,
Rainer Steinwandt:
Clouds over a public key cryptosystem based on Lyndon words.
Inf. Process. Lett. 80(5): 239-242 (2001) |
2000 |
4 | EE | Rainer Steinwandt,
Markus Grassl,
Willi Geiselmann,
Thomas Beth:
Weaknesses in the SL2(IFs2) Hashing Scheme.
CRYPTO 2000: 287-299 |
3 | EE | Jörn Müller-Quade,
Rainer Steinwandt:
Recognizing Simple Subextensions of Purely Transcendental Field Extensions.
Appl. Algebra Eng. Commun. Comput. 11(1): 35-41 (2000) |
2 | | Jörn Müller-Quade,
Rainer Steinwandt:
Gröbner Bases Applied to Finitely Generated Field Extensions.
J. Symb. Comput. 30(4): 469-490 (2000) |
1999 |
1 | | Jörn Müller-Quade,
Rainer Steinwandt:
Basic Algorithms for Rational Function Fields.
J. Symb. Comput. 27(2): 143-170 (1999) |