- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j5 |      | Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger: A heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Computing 15(1): 53-68 (2012) |
| j4 | | Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. IJACT 2(3): 212-228 (2012) |
| i10 | | Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery: Finding ECM-Friendly Curves through a Study of Galois Properties. CoRR abs/1202.4285 (2012) |
| i9 | | Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery: Finding ECM-Friendly Curves through a Study of Galois Properties. IACR Cryptology ePrint Archive 2012: 70 (2012) |
| 2011 | ||
| c11 | | Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic 2011: 213-221 |
| 2010 | ||
| j3 | | Peter L. Montgomery, Sangil Nahm, Samuel S. Wagstaff Jr.: The period of the Bell numbers modulo a prime. Math. Comput. 79(271): 1793-1800 (2010) |
| c10 | | Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-Bit RSA Modulus. CRYPTO 2010: 333-350 |
| c9 | | Kristin Lauter, Peter L. Montgomery, Michael Naehrig: An Analysis of Affine Coordinates for Pairing Computation. Pairing 2010: 1-20 |
| i8 | | Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele: Factorizations of Cunningham numbers with bases 13 to 99. CoRR abs/1004.3169 (2010) |
| i7 | | Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-bit RSA modulus. IACR Cryptology ePrint Archive 2010: 6 (2010) |
| i6 | | Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptology ePrint Archive 2010: 338 (2010) |
| i5 | | Kristin Lauter, Peter L. Montgomery, Michael Naehrig: An Analysis of Affine Coordinates for Pairing Computation. IACR Cryptology ePrint Archive 2010: 363 (2010) |
| 2009 | ||
| i4 | | Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. IACR Cryptology ePrint Archive 2009: 389 (2009) |
| 2008 | ||
| c8 | | Peter L. Montgomery, Alexander Kruppa: Improved Stage 2 to P±1 Factoring Algorithms. ANTS 2008: 180-195 |
| 2006 | ||
| j2 | | Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. Montgomery: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Des. Codes Cryptography 39(2): 189-206 (2006) |
| 2005 | ||
| j1 | | Peter L. Montgomery: Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Trans. Computers 54(3): 362-369 (2005) |
| 2004 | ||
| c7 | | Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves. ANTS 2004: 169-183 |
| 2003 | ||
| c6 | | Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. CT-RSA 2003: 343-354 |
| i3 | | Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: Improved Weil and Tate pairings for elliptic and hyperelliptic curves. IACR Cryptology ePrint Archive 2003: 242 (2003) |
| i2 | | Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. Montgomery: Trading Inversions for Multiplications in Elliptic Curve Cryptography. IACR Cryptology ePrint Archive 2003: 257 (2003) |
| 2002 | ||
| i1 | | Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: An Efficient Procedure to Double and Add Points on an Elliptic Curve. IACR Cryptology ePrint Archive 2002: 112 (2002) |
| 2000 | ||
| c5 | | Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann: Factorization of a 512-Bit RSA Modulus. EUROCRYPT 2000: 1-18 |
| 1999 | ||
| c4 | | Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann: Factorization of RSA-140 Using the Number Field Sieve. ASIACRYPT 1999: 195-207 |
| 1996 | ||
| c3 | | James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jörg Zayer: A World Wide Number Field Sieve Factoring Record: On to 512 Bits. ASIACRYPT 1996: 382-394 |
| 1995 | ||
| c2 | | Peter L. Montgomery: A Block Lanczos Algorithm for Finding Dependencies Over GF(2). EUROCRYPT 1995: 106-120 |
| 1994 | ||
| c1 | | Torbjörn Granlund, Peter L. Montgomery: Division by Invariant Integers using Multiplication. PLDI 1994: 61-72 |
Data released under the ODC-BY 1.0 license — See also our legal information page