#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2001

2019

- This year (6)
- Last 5 years (19)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mathias Herrmann, Alexander May
- ASIACRYPT
- 2008

We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N . An important application of this problem is factorization of N with givenâ€¦ (More)

- Anja Becker, Antoine Joux, Alexander May, Alexander Meurer
- IACR Cryptology ePrint Archive
- 2012

Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes relies on theâ€¦ (More)

- Ellen Jochemsz, Alexander May
- ASIACRYPT
- 2006

We describe a strategy for finding small modular and integer roots of multivariate polynomials using lattice-based Coppersmith techniques. Applying our strategy, we obtain new polynomial-time attacksâ€¦ (More)

- Johannes BlÃ¶mer, Alexander May
- Public Key Cryptography
- 2004

Constant round authenticated group key agreement via distributed computation p. 115 Efficient ID-based group key agreement with bilinear maps p. 130 New security results on encrypted key exchange p.â€¦ (More)

- Johannes BlÃ¶mer, Alexander May
- CRYPTO
- 2003

In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called partial key exposure attacksâ€¦ (More)

- Wilko Henecka, Alexander May, Alexander Meurer
- CRYPTO
- 2010

Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q , d , dp , dq , q âˆ’1 p ). Assume that we obtain partial error-free information of sk, e.g., assume that we obtain halfâ€¦ (More)

- Johannes BlÃ¶mer, Alexander May
- CaLC
- 2001

We present a lattice attack on low exponent RSA with short secret exponent d = N for every Î´ < 0.29. The attack is a variation of an approach by Boneh and Durfee [4] based on lattice reductionâ€¦ (More)

- Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger
- EUROCRYPT
- 2005

We present several attacks on RSA that factor the modulus in polynomial time under the condition that a fraction of the most significant bits or least significant bits of the private exponent isâ€¦ (More)

- Alexander May, Maike Ritzenhofen
- Public Key Cryptography
- 2009

We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs bits of p1, we useâ€¦ (More)

- Alexander May
- 2003