Alexander May

Cited by

	All	Since 2019
Citations	4868	2419
h-index	34	25
i10-index	50	44

580

290

145

435

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202417 29 52 87 80 94 187 119 126 182 180 212 218 244 221 325 304 312 400 446 577 379

Public access

View all

37 articles

1 article

available

not available

Based on funding mandates

Co-authors

Alexander MeurerCITS, Ruhr-Universität BochumVerified email at rub.de
Johannes BloemerProfessor for Computer Science, Paderborn UniversityVerified email at mail.upb.de
Elena KirshanovaLecturer of Mathematics, Immanuel Kant Baltic Federal universityVerified email at kantiana.ru
Antoine JouxCISPAVerified email at cispa.saarland
Anja BeckerEPFL, Lausanne, SwitzerlandVerified email at epfl.ch
Frederik VercauterenProfessor at Katholieke Universiteit LeuvenVerified email at esat.kuleuven.be
Nigel SmartKU LeuvenVerified email at kuleuven.be
Gregor LeanderRuhr University BochumVerified email at rub.de
Saqib A. KakviRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Jean-Sebastien CoronProfessor of Computer Science, University of LuxembourgVerified email at uni.lu
Joseph H. SilvermanProfessor of Mathematics, Brown UniversityVerified email at math.brown.edu
Jake LoftusFormer Phd Student, University of BristolVerified email at cs.bris.ac.uk
Wilko HeneckaCSIRO's DATA61Verified email at data61.csiro.au
Santanu SarkarProfessor, IIT MadrasVerified email at iitm.ac.in
Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumVerified email at rub.de
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneVerified email at uni-koeln.de
Tibor JagerUniversity of WuppertalVerified email at uni-wuppertal.de
Friedrich WiemercryptosolutionsVerified email at mailbox.org
Weiqiang WenTelecom Paris, Institut Polytechnique de ParisVerified email at telecom-paris.fr
Marc FischlinProfessor of Computer Science, Technische Universität Darmstadt, GermanyVerified email at tu-darmstadt.de

Alexander May

Ruhr-Universität Bochum

Verified email at rub.de

Cryptography Cryptanalysis


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Decoding Random Binary Linear Codes in 2^n/20: How 1 + 1 = 0 Improves Information Set Decoding A Becker, A Joux, A May, A Meurer Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012	522	2012
Decoding Random Linear Codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011	389	2011
On computing nearest neighbors with applications to decoding of binary linear codes A May, I Ozerov Annual International Conference on the Theory and Applications of …, 2015	277	2015
New RSA vulnerabilities using lattice reduction methods. A May University of Paderborn, 2003	223	2003
A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants E Jochemsz, A May Advances in Cryptology–ASIACRYPT 2006: 12th International Conference on the …, 2006	208	2006
Grover meets Simon–quantumly attacking the FX-construction G Leander, A May Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017	182	2017
Partial key exposure attacks on RSA up to full size exponents M Ernst, E Jochemsz, A May, B De Weger Advances in Cryptology–EUROCRYPT 2005: 24th Annual International Conference …, 2005	167	2005
Using LLL-reduction for solving RSA and factorization problems A May The LLL Algorithm: Survey and Applications, 315-348, 2009	166	2009
New partial key exposure attacks on RSA J Blömer, A May Annual International Cryptology Conference, 27-43, 2003	161	2003
A generalized Wiener attack on RSA J Blömer, A May International Workshop on Public Key Cryptography, 1-13, 2004	122	2004
Solving linear equations modulo divisors: On factoring given any bits M Herrmann, A May International Conference on the Theory and Application of Cryptology and …, 2008	121	2008
Low secret exponent RSA revisited J Blömer, A May Cryptography and Lattices: International Conference, CaLC 2001 Providence …, 2001	116	2001
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring JS Coron, A May Journal of Cryptology 20, 39-50, 2007	113	2007
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006	112	2006
Dimension reduction methods for convolution modular lattices A May, JH Silverman International Cryptography and Lattices Conference, 110-125, 2001	110	2001
New attacks on RSA with small secret CRT-exponents D Bleichenbacher, A May International Workshop on Public Key Cryptography, 1-13, 2006	104	2006
Decoding linear codes with high error rate and its impact for LPN security L Both, A May International Conference on Post-Quantum Cryptography, 25-46, 2018	102	2018
On CCA-secure somewhat homomorphic encryption J Loftus, A May, NP Smart, F Vercauteren Selected Areas in Cryptography: 18th International Workshop, SAC 2011 …, 2012	98	2012
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N ^0.073 E Jochemsz, A May Advances in Cryptology-CRYPTO 2007: 27th Annual International Cryptology …, 2007	96	2007
Computing the RSA secret key is deterministic polynomial time equivalent to factoring A May Advances in Cryptology–CRYPTO 2004: 24th Annual International Cryptology …, 2004	94	2004

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors