Loading...
conference paper
Efficient SIMD arithmetic modulo a Mersenne number
2011
2011 20th IEEE Symposium on Computer Arithmetic (ARITH)
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.
Loading...
Name
ARITH20_Bos.pdf
Type
Publisher's version
Access type
openaccess
Size
408.36 KB
Format
Adobe PDF
Checksum (MD5)
9b755246a79b8c6e0ae71d0085d04583
Loading...
Name
164554.pdf
Access type
openaccess
Size
212.62 KB
Format
Adobe PDF
Checksum (MD5)
8413857de40d6771cc72d37be529c994