Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Alexander May
Search web for home page
Program Committees
1
2013
PKC
pc
2
2012
Crypto
pc
3
2011
Eurocrypt
pc
4
2011
PKC
pc
5
2010
Eurocrypt
pc
6
2009
Eurocrypt
general chair
7
2008
PKC
pc
8
2007
Eurocrypt
pc
9
2007
Asiacrypt
pc
10
2006
Eurocrypt
pc
11
2006
PKC
pc
Publications
year
title
booktitle
pages
1
2012
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
eurocrypt
520-536
2
2011
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
asiacrypt
107-124
3
2010
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
pkc
53-69
4
2010
Correcting Errors in RSA Private Keys
crypto
351-369
5
2009
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
pkc
1-14
6
2009
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
asiacrypt
487-504
7
2008
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
pkc
37-46
8
2008
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
asiacrypt
406-424
9
2007
On Factoring Arbitrary Integers with Known Bits
eprint
online
10
2007
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than
N
0.073
crypto
395-411
11
2007
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
jofc
39-50
12
2006
New Attacks on RSA with Small Secret CRT-Exponents
pkc
online
13
2006
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
asiacrypt
online
14
2005
Partial Key Exposure Attacks on RSA up to Full Size Exponents
eurocrypt
online
15
2005
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
eurocrypt
online
16
2004
Secret Exponent Attacks on RSA-type Schemes with Moduli N= p
r
q
pkc
online
17
2004
A Generalized Wiener Attack on RSA
pkc
online
18
2004
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
crypto
online
19
2004
Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring
eprint
online
20
2003
New Partial Key Exposure Attacks on RSA
crypto
online
21
2002
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
crypto
online
Coauthors of Alexander May
Anja Becker
Daniel Bleichenbacher
Johannes Blömer
Jean-Sébastien Coron
Matthias Ernst
Wilko Henecka
Mathias Herrmann
Ellen Jochemsz
Antoine Joux
Alexander Meurer
Maike Ritzenhofen
Enrico Thomae
Benne de Weger