|
| |
Peter L. Montgomery
|
|
6 papers in
database with 450
citations 
H-number: 6 |
|
Journal Papers
|
[Sort papers chronologically] [Sort papers by citations count]
|
| |
1. Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. Montgomery, Trading Inversions for Multiplications in Elliptic Curve Cryptography, Designs, Codes and Cryptography,
Volume 39(2), pp. 189 - 206,
Springer, 2006.
[ Electronic
Edition][ Cited
49 times
]
|
Conference Papers
|
[Sort papers chronologically] [Sort papers by citations count]
|
|
1. Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery, Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation, pp. 343 - 354, CT-RSA 2003.
[Electronic
Edition][Cited
62 times
 ]
|
2. 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, pp. 1 - 18, EUROCRYPT 2000.
[Electronic
Edition][ IACR Online
Archive ][Cited
94 times
]
|
3. 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, pp. 195 - 207, ASIACRYPT 1999.
[Electronic
Edition][Cited
31 times
]
|
4. 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, pp. 382 - 394, ASIACRYPT 1996.
[Electronic
Edition][Cited
95 times
]
|
5. Peter L. Montgomery, A Block Lanczos Algorithm for Finding Dependencies Over GF(2), pp. 106 - 120, EUROCRYPT 1995.
[Electronic
Edition][Cited
119 times
]
|
