Peter L. Montgomery

Affiliations:
  • Microsoft Research, Redmond, USA


According to our database1, Peter L. Montgomery authored at least 25 papers between 1978 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Montgomery Arithmetic from a Software Perspective.
IACR Cryptol. ePrint Arch., 2017

2013
Montgomery Multiplication Using Vector Instructions.
IACR Cryptol. ePrint Arch., 2013

2012
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction.
Int. J. Appl. Cryptogr., 2012

Finding ECM-Friendly Curves through a Study of Galois Properties.
IACR Cryptol. ePrint Arch., 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.
Clust. Comput., 2012

2010
The period of the Bell numbers modulo a prime.
Math. Comput., 2010

An Analysis of Affine Coordinates for Pairing Computation.
IACR Cryptol. ePrint Arch., 2010

Factorization of a 768-bit RSA modulus.
IACR Cryptol. ePrint Arch., 2010

Efficient SIMD arithmetic modulo a Mersenne number.
IACR Cryptol. ePrint Arch., 2010

Factorizations of Cunningham numbers with bases 13 to 99
CoRR, 2010

2009
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography.
IACR Cryptol. ePrint Arch., 2009

2008
On The Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2008

Improved Stage 2 to P±1 Factoring Algorithms.
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007
Vulnerabilities in Anonymous Credential Systems.
Proceedings of the 3rd International Workshop on Security and Trust Management, 2007

2006
Trading Inversions for Multiplications in Elliptic Curve Cryptography.
Des. Codes Cryptogr., 2006

2005
Five, Six, and Seven-Term Karatsuba-Like Formulae.
IEEE Trans. Computers, 2005

2003
Improved Weil and Tate pairings for elliptic and hyperelliptic curves.
IACR Cryptol. ePrint Arch., 2003

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.
Proceedings of the Topics in Cryptology, 2003

2002
An Efficient Procedure to Double and Add Points on an Elliptic Curve.
IACR Cryptol. ePrint Arch., 2002

2000

1999
Factorization of RSA-140 Using the Number Field Sieve.
Proceedings of the Advances in Cryptology, 1999

1996
A World Wide Number Field Sieve Factoring Record: On to 512 Bits.
Proceedings of the Advances in Cryptology, 1996

1995
A Block Lanczos Algorithm for Finding Dependencies Over GF(2).
Proceedings of the Advances in Cryptology, 1995

1994
Division by Invariant Integers using Multiplication.
Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994

1978
Evaluation of boolean expressions on one's complement machines.
ACM SIGPLAN Notices, 1978


  Loading...