Efficient SIMD Arithmetic Modulo a Mersenne Number

Authors:
Joppe W. Bos;Thorsten Kleinjung;Arjen K. Lenstra;Peter L. Montgomery
Affiliations:
-;-;-;-
Venue:
ARITH '11 Proceedings of the 2011 IEEE 20th Symposium on Computer Arithmetic
Year:
2011

Citing 0
Cited 3

Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

International Journal of Applied Cryptography
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

International Journal of Applied Cryptography
ECM at work

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes carry-less arithmetic operations modulo an integer 2^M-1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implementation on a cluster of PlayStation 3 game consoles a new record was set for the elliptic curve method for integer factorization.