| 2008 |
|---|
| 10 | EE | Peter L. Montgomery,
Alexander Kruppa:
Improved Stage 2 to P±1 Factoring Algorithms.
ANTS 2008: 180-195 |
| 2006 |
|---|
| 9 | EE | 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 |
|---|
| 8 | EE | Peter L. Montgomery:
Five, Six, and Seven-Term Karatsuba-Like Formulae.
IEEE Trans. Computers 54(3): 362-369 (2005) |
| 2004 |
|---|
| 7 | EE | Kirsten Eisenträger,
Kristin Lauter,
Peter L. Montgomery:
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves.
ANTS 2004: 169-183 |
| 2003 |
|---|
| 6 | EE | Kirsten Eisenträger,
Kristin Lauter,
Peter L. Montgomery:
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.
CT-RSA 2003: 343-354 |
| 2000 |
|---|
| 5 | EE | Stefania Cavallar,
Bruce Dodson,
Arjen K. Lenstra,
Walter M. Lioen,
Peter L. Montgomery,
Brian Murphy,
Herman 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 |
|---|
| 4 | | Stefania Cavallar,
Bruce Dodson,
Arjen K. Lenstra,
Paul C. Leyland,
Walter M. Lioen,
Peter L. Montgomery,
Brian Murphy,
Herman te Riele,
Paul Zimmermann:
Factorization of RSA-140 Using the Number Field Sieve.
ASIACRYPT 1999: 195-207 |
| 1996 |
|---|
| 3 | | 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 |
|---|
| 2 | EE | Peter L. Montgomery:
A Block Lanczos Algorithm for Finding Dependencies Over GF(2).
EUROCRYPT 1995: 106-120 |
| 1994 |
|---|
| 1 | | Torbjörn Granlund,
Peter L. Montgomery:
Division by Invariant Integers using Multiplication.
PLDI 1994: 61-72 |
