Alexander May

Horst Görtz Institut, Ruhr-Universität Bochum

other persons with the same name:

• Alexander May 0002 - The Robotics Institute, Carnegie Mellon University

	2012
c24		Saqib A. Kakvi, Eike Kiltz, Alexander May: Certifying RSA. ASIACRYPT 2012: 404-414
c23		Anja Becker, Antoine Joux, Alexander May, Alexander Meurer: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. EUROCRYPT 2012: 520-536
i5		Anja Becker, Antoine Joux, Alexander May, Alexander Meurer: Decoding Random Binary Linear Codes in $2^{n/20}$: How $1+1=0$ Improves Information Set Decoding. IACR Cryptology ePrint Archive 2012: 26 (2012)
	2011
c22		Alexander May, Alexander Meurer, Enrico Thomae: Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$. ASIACRYPT 2011: 107-124
c21		Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren: On CCA-Secure Somewhat Homomorphic Encryption. Selected Areas in Cryptography 2011: 55-72
i4		Marc Fischlin, Anna Lysyanskaya, Ueli Maurer, Alexander May: Public-Key Cryptography (Dagstuhl Seminar 11391). Dagstuhl Reports 1(9): 76-94 (2011)
	2010
c20		Wilko Henecka, Alexander May, Alexander Meurer: Correcting Errors in RSA Private Keys. CRYPTO 2010: 351-369
c19		Mathias Herrmann, Alexander May: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. Public Key Cryptography 2010: 53-69
i3		Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren: On CCA-Secure Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2010: 560 (2010)
	2009
c18		Mathias Herrmann, Alexander May: Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? ASIACRYPT 2009: 487-504
c17		Alexander May, Maike Ritzenhofen: Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint. Public Key Cryptography 2009: 1-14
	2008
c16		Mathias Herrmann, Alexander May: Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. ASIACRYPT 2008: 406-424
c15		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
j2		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)
c14		Ellen Jochemsz, Alexander May: A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073. CRYPTO 2007: 395-411
c13		Mathias Herrmann, Alexander May: On Factoring Arbitrary Integers with Known Bits. GI Jahrestagung (2) 2007: 195-199
i2		Mathias Herrmann, Alexander May: On Factoring Arbitrary Integers with Known Bits. IACR Cryptology ePrint Archive 2007: 374 (2007)
	2006
j1		Johannes Buchmann, Alexander May, Ulrich Vollmer: Perspectives for cryptographic long-term security. Commun. ACM 49(9): 50-55 (2006)
c12		Ellen Jochemsz, Alexander May: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants. ASIACRYPT 2006: 267-282
c11		Daniel Bleichenbacher, Alexander May: New Attacks on RSA with Small Secret CRT-Exponents. Public Key Cryptography 2006: 1-13
	2005
c10		Johannes Blömer, Alexander May: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. EUROCRYPT 2005: 251-267
c9		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
c8		Alexander May: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. CRYPTO 2004: 213-219
c7		Johannes Blömer, Alexander May: A Generalized Wiener Attack on RSA. Public Key Cryptography 2004: 1-13
c6		Alexander May: Secret Exponent Attacks on RSA-type Schemes with Moduli N= prq. Public Key Cryptography 2004: 218-230
i1		Jean-Sébastien Coron, Alexander May: Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring. IACR Cryptology ePrint Archive 2004: 208 (2004)
	2003
b1		Alexander May: New RSA vulnerabilities using lattice reduction methods. University of Paderborn 2003, pp. 1-159
c5		Johannes Blömer, Alexander May: New Partial Key Exposure Attacks on RSA. CRYPTO 2003: 27-43
	2002
c4		Alexander May: Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. CRYPTO 2002: 242-256
	2001
c3		Johannes Blömer, Alexander May: Low Secret Exponent RSA Revisited. CaLC 2001: 4-19
c2		Alexander May, Joseph H. Silverman: Dimension Reduction Methods for Convolution Modular Lattices. CaLC 2001: 110-125
c1		Johannes Blömer, Alexander May: Key Revocation with Interval Cover Families. Selected Areas in Cryptography 2001: 325-341

Coauthor Index

Colors in the list of coauthors

Last update Wed May 22 05:39:08 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page