Efficient SIMD arithmetic modulo a Mersenne number

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.


Published in:
2011 20th IEEE Symposium on Computer Arithmetic (ARITH)
Presented at:
2011 20th IEEE Symposium on Computer Arithmetic (ARITH), Tubingen, Germany, 25-27 July 2011
Year:
2011
Publisher:
Los Alamitos, CA, IEEE Computer Soc Press
ISBN:
978-1-4244-9457-6
Keywords:
Laboratories:




 Record created 2011-03-29, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)