Bos, J. W.Kleinjung, T.Lenstra, Arjen K.Montgomery, P. L.2011-03-292011-03-292011-03-29201110.1109/ARITH.2011.37https://infoscience.epfl.ch/handle/20.500.14299/65772WOS:000296333300027This 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.Mersenne numberSingle Instruction Multiple dataCell processorElliptic curve methodinteger factorizationtext::conference output::conference proceedings::conference paper