Search results for "Alexander May"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	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	DBLP BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Marc Fischlin, Anna Lysyanskaya, Ueli Maurer, Alexander May	Public-Key Cryptography (Dagstuhl Seminar 11391).	Dagstuhl Reports	2011	DBLP DOI BibTeX RDF
1	Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren	On CCA-Secure Somewhat Homomorphic Encryption.	Selected Areas in Cryptography	2011	DBLP DOI BibTeX RDF
1	Alexander May, Alexander Meurer, Enrico Thomae	Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$.	ASIACRYPT	2011	DBLP DOI BibTeX RDF
1	Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren	On CCA-Secure Fully Homomorphic Encryption.	IACR Cryptology ePrint Archive	2010	DBLP BibTeX RDF
1	Mathias Herrmann, Alexander May	Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.	Public Key Cryptography	2010	DBLP DOI BibTeX RDF
1	Wilko Henecka, Alexander May, Alexander Meurer	Correcting Errors in RSA Private Keys.	CRYPTO	2010	DBLP DOI BibTeX RDF
1	Alexander May, Maike Ritzenhofen	Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint.	Public Key Cryptography	2009	DBLP DOI BibTeX RDF	Factoring with an oracle, lattices
1	Mathias Herrmann, Alexander May	Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?	ASIACRYPT	2009	DBLP DOI BibTeX RDF	small roots, lattices, power generator, systems of equations
1	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	DBLP DOI BibTeX RDF	Chinese Remaindering, Coppersmith’s method, Håstad’s attack, systems of univariate modular polynomials
1	Mathias Herrmann, Alexander May	Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits.	ASIACRYPT	2008	DBLP DOI BibTeX RDF	small roots, factoring with known bits, Lattices
1	Mathias Herrmann, Alexander May	On Factoring Arbitrary Integers with Known Bits.	IACR Cryptology ePrint Archive	2007	DBLP BibTeX RDF
1	Jean-Sébastien Coron, Alexander May	Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring.	J. Cryptology	2007	DBLP DOI BibTeX RDF
1	Ellen Jochemsz, Alexander May	A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073.	CRYPTO	2007	DBLP DOI BibTeX RDF	small exponents, Coppersmith’s method, cryptanalysis, RSA, CRT
1	Mathias Herrmann, Alexander May	On Factoring Arbitrary Integers with Known Bits.	GI Jahrestagung	2007	DBLP BibTeX RDF
1	Johannes Buchmann, Alexander May, Ulrich Vollmer	Perspectives for cryptographic long-term security.	Commun. ACM	2006	DBLP DOI BibTeX RDF
1	Daniel Bleichenbacher, Alexander May	New Attacks on RSA with Small Secret CRT-Exponents.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF	small exponents, Coppersmith’s method, RSA, lattices
1	Ellen Jochemsz, Alexander May	A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants.	ASIACRYPT	2006	DBLP DOI BibTeX RDF	small roots, Coppersmith’s method, RSA variants, cryptanalysis, lattices
1	Johannes Blömer, Alexander May	A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.	EUROCRYPT	2005	DBLP DOI BibTeX RDF	Coppersmiths method, univariate vs. bivariate, RSA
1	Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger	Partial Key Exposure Attacks on RSA up to Full Size Exponents.	EUROCRYPT	2005	DBLP DOI BibTeX RDF
1	Jean-Sébastien Coron, Alexander May	Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring.	IACR Cryptology ePrint Archive	2004	DBLP BibTeX RDF
1	Johannes Blömer, Alexander May	A Generalized Wiener Attack on RSA.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF
1	Alexander May	Secret Exponent Attacks on RSA-type Schemes with Moduli N= prq.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF
1	Alexander May	Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.	CRYPTO	2004	DBLP DOI BibTeX RDF	Coppersmiths method, RSA
1	Alexander May	New RSA vulnerabilities using lattice reduction methods.		2003	RDF
1	Johannes Blömer, Alexander May	New Partial Key Exposure Attacks on RSA.	CRYPTO	2003	DBLP DOI BibTeX RDF
1	Alexander May	Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.	CRYPTO	2002	DBLP DOI BibTeX RDF	Coppersmith's method, small secret exponent, RSA, lattice reduction
1	Johannes Blömer, Alexander May	Low Secret Exponent RSA Revisited.	CaLC	2001	DBLP DOI BibTeX RDF	Low secret exponent RSA, Coppersmith's method, cryptanalysis, lattice reduction
1	Alexander May, Joseph H. Silverman	Dimension Reduction Methods for Convolution Modular Lattices.	CaLC	2001	DBLP BibTeX RDF
1	Johannes Blömer, Alexander May	Key Revocation with Interval Cover Families.	Selected Areas in Cryptography	2001	DBLP DOI BibTeX RDF

Publications of "Alexander May" ( http://dblp.L3S.de/Authors/Alexander_May )