Alexander May

Citado por

	Todos	Desde 2019
Citações	4974	2523
Índice h	35	25
Índice i10	52	46

580

290

145

435

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202417 29 52 87 80 94 187 119 126 182 180 212 218 244 221 325 305 315 402 455 580 464

Acesso público

Ver tudo

36 artigos

2 artigos

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Alexander MeurerCITS, Ruhr-Universität BochumEmail confirmado em rub.de
Johannes BloemerProfessor for Computer Science, Paderborn UniversityEmail confirmado em mail.upb.de
Elena KirshanovaLecturer of Mathematics, Immanuel Kant Baltic Federal universityEmail confirmado em kantiana.ru
Antoine JouxCISPAEmail confirmado em cispa.saarland
Anja BeckerEPFL, Lausanne, SwitzerlandEmail confirmado em epfl.ch
Frederik VercauterenProfessor at Katholieke Universiteit LeuvenEmail confirmado em esat.kuleuven.be
Nigel SmartKU LeuvenEmail confirmado em kuleuven.be
Gregor LeanderRuhr University BochumEmail confirmado em rub.de
Saqib A. KakviRoyal Holloway, University of LondonEmail confirmado em rhul.ac.uk
Jean-Sebastien CoronProfessor of Computer Science, University of LuxembourgEmail confirmado em uni.lu
Joseph H. SilvermanProfessor of Mathematics, Brown UniversityEmail confirmado em math.brown.edu
Jake LoftusFormer Phd Student, University of BristolEmail confirmado em cs.bris.ac.uk
Wilko HeneckaCSIRO's DATA61Email confirmado em data61.csiro.au
Santanu SarkarProfessor, IIT MadrasEmail confirmado em iitm.ac.in
Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumEmail confirmado em rub.de
Tibor JagerUniversity of WuppertalEmail confirmado em uni-wuppertal.de
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneEmail confirmado em uni-koeln.de
Friedrich WiemercryptosolutionsEmail confirmado em mailbox.org
Weiqiang WenTelecom Paris, Institut Polytechnique de ParisEmail confirmado em telecom-paris.fr
Marc FischlinProfessor of Computer Science, Technische Universität Darmstadt, GermanyEmail confirmado em tu-darmstadt.de

Seguir

Alexander May

Ruhr-Universität Bochum

Email confirmado em rub.de

Cryptography Cryptanalysis


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
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	533	2012
Decoding Random Linear Codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011	395	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	280	2015
New RSA vulnerabilities using lattice reduction methods. A May University of Paderborn, 2003	229	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	212	2006
Grover meets Simon–quantumly attacking the FX-construction G Leander, A May Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017	191	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	170	2005
Using LLL-reduction for solving RSA and factorization problems A May The LLL Algorithm: Survey and Applications, 315-348, 2009	168	2009
New partial key exposure attacks on RSA J Blömer, A May Annual International Cryptology Conference, 27-43, 2003	163	2003
A generalized Wiener attack on RSA J Blömer, A May International Workshop on Public Key Cryptography, 1-13, 2004	123	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	122	2008
Low secret exponent RSA revisited J Blömer, A May Cryptography and Lattices: International Conference, CaLC 2001 Providence …, 2001	117	2001
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring JS Coron, A May Journal of Cryptology 20, 39-50, 2007	116	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	114	2006
Dimension reduction methods for convolution modular lattices A May, JH Silverman International Cryptography and Lattices Conference, 110-125, 2001	110	2001
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	105	2018
New attacks on RSA with small secret CRT-exponents D Bleichenbacher, A May International Workshop on Public Key Cryptography, 1-13, 2006	105	2006
On CCA-secure somewhat homomorphic encryption J Loftus, A May, NP Smart, F Vercauteren Selected Areas in Cryptography: 18th International Workshop, SAC 2011 …, 2012	100	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	97	2007
Maximizing small root bounds by linearization and applications to small secret exponent RSA M Herrmann, A May Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010	95	2010

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores