Folgen
Alexander May
Alexander May
Ruhr-Universität Bochum
Bestätigte E-Mail-Adresse bei rub.de
Titel
Zitiert von
Zitiert von
Jahr
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
5602012
Decoding Random Linear Codes in
A May, A Meurer, E Thomae
International Conference on the Theory and Application of Cryptology and …, 2011
4082011
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
2902015
New RSA vulnerabilities using lattice reduction methods.
A May
University of Paderborn, 2003
2352003
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
2182006
Grover meets Simon–quantumly attacking the FX-construction
G Leander, A May
Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017
2052017
New partial key exposure attacks on RSA
J Blömer, A May
Annual International Cryptology Conference, 27-43, 2003
1882003
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
1792005
Using LLL-reduction for solving RSA and factorization problems
A May
The LLL algorithm: survey and applications, 315-348, 2009
1772009
A generalized Wiener attack on RSA
J Blömer, A May
International Workshop on Public Key Cryptography, 1-13, 2004
1312004
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
1292008
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
JS Coron, A May
Journal of Cryptology 20, 39-50, 2007
1202007
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
1182018
Low secret exponent RSA revisited
J Blömer, A May
Cryptography and Lattices: International Conference, CaLC 2001 Providence …, 2001
1182001
Dimension reduction methods for convolution modular lattices
A May, JH Silverman
International Cryptography and Lattices Conference, 110-125, 2001
1162001
New attacks on RSA with small secret CRT-exponents
D Bleichenbacher, A May
International Workshop on Public Key Cryptography, 1-13, 2006
1092006
On CCA-secure somewhat homomorphic encryption
J Loftus, A May, NP Smart, F Vercauteren
International Workshop on Selected Areas in Cryptography, 55-72, 2011
1062011
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
1002007
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
952010
Computing the RSA secret key is deterministic polynomial time equivalent to factoring
A May
Annual International Cryptology Conference, 213-219, 2004
942004
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20