![]() | ![]() |
| 2011 | ||
|---|---|---|
| 7 | Mathias Herrmann: Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption. AFRICACRYPT 2011: 92-99 | |
| 2010 | ||
| 6 | Mathias Herrmann, Alexander May: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. Public Key Cryptography 2010: 53-69 | |
| 2009 | ||
| 5 | Mathias Herrmann, Alexander May: Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? ASIACRYPT 2009: 487-504 | |
| 4 | Mathias Herrmann, Gregor Leander: A Practical Key Recovery Attack on Basic TCHo. Public Key Cryptography 2009: 411-424 | |
| 2008 | ||
| 3 | Mathias Herrmann, Alexander May: Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. ASIACRYPT 2008: 406-424 | |
| 2007 | ||
| 2 | Mathias Herrmann, Alexander May: On Factoring Arbitrary Integers with Known Bits. GI Jahrestagung (2) 2007: 195-199 | |
| 1 | Mathias Herrmann, Alexander May: On Factoring Arbitrary Integers with Known Bits. IACR Cryptology ePrint Archive 2007: 374 (2007) | |
| 1 | Gregor Leander | [4] |
| 2 | Alexander May | [1] [2] [3] [5] [6] |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page