International Association for Cryptologic Research
Peter L. Montgomery Search web for home page
Publications
| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2010 | Factorization of a 768-Bit RSA Modulus | crypto | 333-350 |
| 2 | 2010 | Factorization of a 768-bit RSA modulus | eprint | online |
| 3 | 2010 | Pushing the Limits of ECM | eprint | online |
| 4 | 2010 | An Analysis of Affine Coordinates for Pairing Computation | eprint | online |
| 5 | 2003 | Improved Weil and Tate pairings for elliptic and hyperelliptic curves | eprint | online |
| 6 | 2003 | Trading Inversions for Multiplications in Elliptic Curve Cryptography | eprint | online |
| 7 | 2002 | An Efficient Procedure to Double and Add Points on an Elliptic Curve | eprint | online |
| 8 | 2000 | Factorization of a 512-Bit RSA Modulus | eurocrypt | 1-18 |
| 9 | 1999 | Factorization of RSA-140 Using the Number Field Sieve | asiacrypt | 195-207 |
| 10 | 1996 | A World Wide Number Field Sieve Factoring Record: On to 512 Bits | asiacrypt | 382-394 |
| 11 | 1995 | A Block Lanczos Algorithm for Finding Dependencies Over GF(2) | eurocrypt | 106-120 |