Peter L. Montgomery

32 papers A* 4A 2B 2C 2Journal 19Unranked 3
YearRankTypeTitle / Venue / Authors
2017 J jnl
Montgomery Arithmetic from a Software Perspective.
IACR Cryptol. ePrint Arch.
Joppe W. Bos, Peter L. Montgomery
2013 B conf
Montgomery Multiplication Using Vector Instructions.
Selected Areas in Cryptography
Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha
2013 J jnl
Montgomery Multiplication Using Vector Instructions.
IACR Cryptol. ePrint Arch.
Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha
2012 J jnl
A heterogeneous computing environment to solve the 768-bit RSA challenge.
Clust. Comput.
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
2012 J jnl
Finding ECM-Friendly Curves through a Study of Galois Properties
CoRR
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
2012 J jnl
Finding ECM-Friendly Curves through a Study of Galois Properties.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
2012 J jnl
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction.
Int. J. Appl. Cryptogr.
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2011 C conf
Efficient SIMD Arithmetic Modulo a Mersenne Number.
IEEE Symposium on Computer Arithmetic
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2010 C conf
An Analysis of Affine Coordinates for Pairing Computation.
Pairing
Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig
2010 J jnl
An Analysis of Affine Coordinates for Pairing Computation.
IACR Cryptol. ePrint Arch.
Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig
2010 J jnl
Efficient SIMD arithmetic modulo a Mersenne number.
IACR Cryptol. ePrint Arch.
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2010 A* conf
Factorization of a 768-Bit RSA Modulus.
CRYPTO
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
2010 J jnl
Factorization of a 768-bit RSA modulus.
IACR Cryptol. ePrint Arch.
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
2010 J jnl
Factorizations of Cunningham numbers with bases 13 to 99
CoRR
Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele
2010 J jnl
The period of the Bell numbers modulo a prime.
Math. Comput.
Peter L. Montgomery, Sangil Nahm, Samuel S. Wagstaff Jr.
2009 J jnl
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography.
IACR Cryptol. ePrint Arch.
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
2008 — conf
Improved Stage 2 to P±1 Factoring Algorithms.
ANTS
Peter L. Montgomery, Alexander Kruppa
2008 J jnl
On The Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch.
Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
2007 — conf
Vulnerabilities in Anonymous Credential Systems.
STM@ESORICS
Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
2006 J jnl
Trading Inversions for Multiplications in Elliptic Curve Cryptography.
Des. Codes Cryptogr.
Mathieu Ciet, Marc Joye, Kristin E. Lauter, Peter L. Montgomery
2005 J jnl
Five, Six, and Seven-Term Karatsuba-Like Formulae.
IEEE Trans. Computers
Peter L. Montgomery
2004 — conf
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves.
ANTS
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
2003 B conf
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.
CT-RSA
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
2003 J jnl
Improved Weil and Tate pairings for elliptic and hyperelliptic curves.
IACR Cryptol. ePrint Arch.
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
2003 J jnl
Trading Inversions for Multiplications in Elliptic Curve Cryptography.
IACR Cryptol. ePrint Arch.
Mathieu Ciet, Marc Joye, Kristin E. Lauter, Peter L. Montgomery
2002 J jnl
An Efficient Procedure to Double and Add Points on an Elliptic Curve.
IACR Cryptol. ePrint Arch.
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
2000 A* conf
Factorization of a 512-Bit RSA Modulus.
EUROCRYPT
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen I. Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
1999 A conf
Factorization of RSA-140 Using the Number Field Sieve.
ASIACRYPT
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
1996 A conf
A World Wide Number Field Sieve Factoring Record: On to 512 Bits.
ASIACRYPT
James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jörg Zayer
1995 A* conf
A Block Lanczos Algorithm for Finding Dependencies Over GF(2).
EUROCRYPT
Peter L. Montgomery
1994 A* conf
Division by Invariant Integers using Multiplication.
PLDI
Torbjörn Granlund, Peter L. Montgomery
1978 J jnl
Evaluation of boolean expressions on one's complement machines.
ACM SIGPLAN Notices
Peter L. Montgomery