The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander May:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ellen Jochemsz, Alexander May
**A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2006, pp:267-282 [Conf] - Johannes Blömer, Alexander May
**Low Secret Exponent RSA Revisited.**[Citation Graph (0, 0)][DBLP] CaLC, 2001, pp:4-19 [Conf] - Alexander May, Joseph H. Silverman
**Dimension Reduction Methods for Convolution Modular Lattices.**[Citation Graph (0, 0)][DBLP] CaLC, 2001, pp:110-125 [Conf] - Johannes Blömer, Alexander May
**New Partial Key Exposure Attacks on RSA.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2003, pp:27-43 [Conf] - Alexander May
**Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2002, pp:242-256 [Conf] - Alexander May
**Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2004, pp:213-219 [Conf] - Johannes Blömer, Alexander May
**A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2005, pp:251-267 [Conf] - Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger
**Partial Key Exposure Attacks on RSA up to Full Size Exponents.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2005, pp:371-386 [Conf] - Alexander May
**Secret Exponent Attacks on RSA-type Schemes with Moduli N= p**[Citation Graph (0, 0)][DBLP]^{r}q. Public Key Cryptography, 2004, pp:218-230 [Conf] - Daniel Bleichenbacher, Alexander May
**New Attacks on RSA with Small Secret CRT-Exponents.**[Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2006, pp:1-13 [Conf] - Johannes Blömer, Alexander May
**A Generalized Wiener Attack on RSA.**[Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2004, pp:1-13 [Conf] - Johannes Blömer, Alexander May
**Key Revocation with Interval Cover Families.**[Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2001, pp:325-341 [Conf] - Johannes Buchmann, Alexander May, Ulrich Vollmer
**Perspectives for cryptographic long-term security.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 2006, v:49, n:9, pp:50-55 [Journal] - Ellen Jochemsz, Alexander May
**A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than**[Citation Graph (0, 0)][DBLP]*N*^{0.073}. CRYPTO, 2007, pp:395-411 [Conf] - Jean-Sébastien Coron, Alexander May
**Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2007, v:20, n:1, pp:39-50 [Journal] **Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits.**[Citation Graph (, )][DBLP]**Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?**[Citation Graph (, )][DBLP]**Correcting Errors in RSA Private Keys.**[Citation Graph (, )][DBLP]**On Factoring Arbitrary Integers with Known Bits.**[Citation Graph (, )][DBLP]**Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?**[Citation Graph (, )][DBLP]**Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint.**[Citation Graph (, )][DBLP]**Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |