2009 |
19 | EE | Alexander May,
Maike Ritzenhofen:
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint.
Public Key Cryptography 2009: 1-14 |
2008 |
18 | EE | Mathias Herrmann,
Alexander May:
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits.
ASIACRYPT 2008: 406-424 |
17 | EE | Alexander May,
Maike Ritzenhofen:
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
Public Key Cryptography 2008: 37-46 |
2007 |
16 | EE | Ellen Jochemsz,
Alexander May:
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073.
CRYPTO 2007: 395-411 |
15 | | Mathias Herrmann,
Alexander May:
On Factoring Arbitrary Integers with Known Bits.
GI Jahrestagung (2) 2007: 195-199 |
14 | EE | Jean-Sébastien Coron,
Alexander May:
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring.
J. Cryptology 20(1): 39-50 (2007) |
2006 |
13 | EE | Ellen Jochemsz,
Alexander May:
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants.
ASIACRYPT 2006: 267-282 |
12 | EE | Daniel Bleichenbacher,
Alexander May:
New Attacks on RSA with Small Secret CRT-Exponents.
Public Key Cryptography 2006: 1-13 |
11 | EE | Johannes Buchmann,
Alexander May,
Ulrich Vollmer:
Perspectives for cryptographic long-term security.
Commun. ACM 49(9): 50-55 (2006) |
2005 |
10 | EE | Johannes Blömer,
Alexander May:
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.
EUROCRYPT 2005: 251-267 |
9 | EE | Matthias Ernst,
Ellen Jochemsz,
Alexander May,
Benne de Weger:
Partial Key Exposure Attacks on RSA up to Full Size Exponents.
EUROCRYPT 2005: 371-386 |
2004 |
8 | EE | Alexander May:
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.
CRYPTO 2004: 213-219 |
7 | EE | Johannes Blömer,
Alexander May:
A Generalized Wiener Attack on RSA.
Public Key Cryptography 2004: 1-13 |
6 | EE | Alexander May:
Secret Exponent Attacks on RSA-type Schemes with Moduli N= prq.
Public Key Cryptography 2004: 218-230 |
2003 |
5 | EE | Johannes Blömer,
Alexander May:
New Partial Key Exposure Attacks on RSA.
CRYPTO 2003: 27-43 |
2002 |
4 | EE | Alexander May:
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.
CRYPTO 2002: 242-256 |
2001 |
3 | EE | Alexander May,
Joseph H. Silverman:
Dimension Reduction Methods for Convolution Modular Lattices.
CaLC 2001: 110-125 |
2 | EE | Johannes Blömer,
Alexander May:
Low Secret Exponent RSA Revisited.
CaLC 2001: 4-19 |
1 | EE | Johannes Blömer,
Alexander May:
Key Revocation with Interval Cover Families.
Selected Areas in Cryptography 2001: 325-341 |