Kleinjung, ThorstenBos, Joppe WillemLenstra, Arjen K.Osvik, Dag ArneAoki, KazumaroContini, ScottFranke, JensThomé, EmmanuelJermini, PascalThiémard, MichelaLeyland, PaulMontgomery, Peter L.Timofeev, AndreyStockinger, Heinz2011-12-212011-12-212011-12-21201210.1007/s10586-010-0149-0https://infoscience.epfl.ch/handle/20.500.14299/75907WOS:000300666700006In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 years on a single, standard core. In the article we present the heterogeneous computing approach, involving different compute clusters and Grid computing environments, used to solve this problem.RSAHPCInteger factorizationNumber-Field SieveLinear-EquationsAlgorithmGf(2)text::journal::journal article::research article