Alexander May |
|
|---|---|
Author's Web Page  | |
| 16 papers in database with 394 citations  H-number: 11 | |
Journal Papers |
|
| 1. Jean-SÊbastien Coron, Alexander May, Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring, Journal of Cryptology,
Volume 20(1), pp. 39 - 50,
Springer, 2007. [  Cited
20 times
] | |
Conference Papers |
|
| 1. Mathias Herrmann, Alexander May, Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?, pp. 487 - 504, ASIACRYPT 2009. [  Electronic
Edition][Cited
2 times
] | |
| 2. Alexander May, Maike Ritzenhofen, Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint, pp. 1 - 14, PKC 2009. [ Electronic
Edition][Cited
9 times
] | |
| 3. Mathias Herrmann, Alexander May, Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits, pp. 406 - 424, ASIACRYPT 2008. [ Electronic
Edition][Cited
10 times
] | |
| 4. Alexander May, Maike Ritzenhofen, Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?, pp. 37 - 46, PKC 2008. [ Electronic
Edition][Cited
3 times
] | |
| 5. Ellen Jochemsz, Alexander May, A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than , pp. 395 - 411, CRYPTO 2007. [ Electronic
Edition][Cited
22 times
] | |
| 6. Daniel Bleichenbacher, Alexander May, New Attacks on RSA with Small Secret CRT-Exponents, pp. 1 - 13, PKC 2006. [ Electronic
Edition][ IACR Online
Archive ][Cited
29 times
] | |
| 7. Ellen Jochemsz, Alexander May, A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants, pp. 267 - 282, ASIACRYPT 2006. [ Electronic
Edition][Cited
35 times
] | |
| 8. Johannes BlÜmer, Alexander May, A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, pp. 251 - 267, EUROCRYPT 2005. [ Electronic
Edition][IACR Online
Archive][Cited
27 times
] | |
| 9. Matthias Ernst, Ellen Jochemsz, Alexander May, Benjamin M. M. de Weger, Partial Key Exposure Attacks on RSA up to Full Size Exponents, pp. 371 - 386, EUROCRYPT 2005. [ Electronic
Edition][IACR Online
Archive][Cited
44 times
] | |
| 10. Alexander May, Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring, pp. 213 - 219, CRYPTO 2004. [ Electronic
Edition][IACR Online
Archive][Cited
43 times
] | |
| 11. Alexander May, Secret Exponent Attacks on RSA-type Schemes with Moduli N= p, pp. 218 - 230, PKC 2004. [ Electronic
Edition][IACR Online
Archive][Cited
29 times
] | |
| 12. Johannes BlÜmer, Alexander May, A Generalized Wiener Attack on RSA, pp. 1 - 13, PKC 2004. [ Electronic
Edition][IACR Online
Archive][Cited
28 times
] | |
| 13. Johannes BlÜmer, Alexander May, New Partial Key Exposure Attacks on RSA, pp. 27 - 43, CRYPTO 2003. [ Electronic
Edition][IACR Online
Archive][Cited
54 times
 ] | |
| 14. Alexander May, Cryptanalysis of Unbalanced RSA with Small CRT-Exponent, pp. 242 - 256, CRYPTO 2002. [ Electronic
Edition][IACR Online
Archive][Cited
36 times
] | |
| 15. Johannes BlÜmer, Alexander May, Key Revocation with Interval Cover Families, pp. 325 - 341, SAC 2001. [ Electronic
Edition][Cited
3 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals