Alexander May

Citée par

	Toutes	Depuis 2018
Citations	4371	2227
indice h	33	24
indice i10	49	45

500

250

125

375

20032004200520062007200820092010201120122013201420152016201720182019202020212022202318 30 51 90 80 92 188 121 126 179 176 216 235 248 225 328 307 297 403 497 394

Accès public

Tout afficher

33 articles

2 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Alexander MeurerCITS, Ruhr-Universität BochumAdresse e-mail validée de rub.de
Johannes BloemerProfessor for Computer Science, Paderborn UniversityAdresse e-mail validée de mail.upb.de
Elena KirshanovaLecturer of Mathematics, Immanuel Kant Baltic Federal universityAdresse e-mail validée de kantiana.ru
Antoine JouxCISPAAdresse e-mail validée de cispa.saarland
Anja BeckerEPFL, Lausanne, SwitzerlandAdresse e-mail validée de epfl.ch
Frederik VercauterenProfessor at Katholieke Universiteit LeuvenAdresse e-mail validée de esat.kuleuven.be
Nigel SmartKU LeuvenAdresse e-mail validée de kuleuven.be
Gregor LeanderRuhr University BochumAdresse e-mail validée de rub.de
Saqib A. KakviRoyal Holloway, University of LondonAdresse e-mail validée de rhul.ac.uk
Jean-Sebastien CoronProfessor of Computer Science, University of LuxembourgAdresse e-mail validée de uni.lu
Joseph H. SilvermanProfessor of Mathematics, Brown UniversityAdresse e-mail validée de math.brown.edu
Jake LoftusFormer Phd Student, University of BristolAdresse e-mail validée de cs.bris.ac.uk
Wilko HeneckaCSIRO's DATA61Adresse e-mail validée de data61.csiro.au
Santanu SarkarProfessor, IIT MadrasAdresse e-mail validée de iitm.ac.in
Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumAdresse e-mail validée de rub.de
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneAdresse e-mail validée de uni-koeln.de
Tibor JagerUniversity of WuppertalAdresse e-mail validée de uni-wuppertal.de
Friedrich WiemercryptosolutionsAdresse e-mail validée de mailbox.org
Weiqiang WenTelecom Paris, Institut Polytechnique de ParisAdresse e-mail validée de telecom-paris.fr
Marc FischlinProfessor of Computer Science, Technische Universität Darmstadt, GermanyAdresse e-mail validée de tu-darmstadt.de

Suivre

Alexander May

Ruhr-Universität Bochum

Adresse e-mail validée de rub.de

Cryptography Cryptanalysis


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	461	2012
Decoding Random Linear Codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011	346	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	241	2015
New RSA vulnerabilities using lattice reduction methods. A May University of Paderborn, 2003	200	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	188	2006
New partial key exposure attacks on RSA J Blömer, A May Annual International Cryptology Conference, 27-43, 2003	170	2003
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	156	2005
Using LLL-reduction for solving RSA and factorization problems A May The LLL Algorithm: Survey and Applications, 315-348, 2009	150	2009
Grover meets Simon–quantumly attacking the FX-construction G Leander, A May Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017	144	2017
A generalized Wiener attack on RSA J Blömer, A May International Workshop on Public Key Cryptography, 1-13, 2004	114	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	111	2008
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring JS Coron, A May Journal of Cryptology 20, 39-50, 2007	110	2007
Low secret exponent RSA revisited J Blömer, A May Cryptography and Lattices: International Conference, CaLC 2001 Providence …, 2001	110	2001
Dimension reduction methods for convolution modular lattices A May, JH Silverman International Cryptography and Lattices Conference, 110-125, 2001	107	2001
New attacks on RSA with small secret CRT-exponents D Bleichenbacher, A May International Workshop on Public Key Cryptography, 1-13, 2006	103	2006
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	94	2006
Computing the RSA secret key is deterministic polynomial time equivalent to factoring A May Advances in Cryptology–CRYPTO 2004: 24th Annual International Cryptology …, 2004	93	2004
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	91	2007
On CCA-secure somewhat homomorphic encryption J Loftus, A May, NP Smart, F Vercauteren Selected Areas in Cryptography: 18th International Workshop, SAC 2011 …, 2012	89	2012
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	85	2018

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs