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.

In  IEEE Symposium on Computer Arithmetic – ARITH-20

Publisher  IEEE Computer Society

Details

TypeInproceedings
URLhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5992129&tag=1
Pages213–221
> Publications > Efficient SIMD Arithmetic modulo a Mersenne Number