A Heterogeneous computing environment to solve the 768-bit RSA challenge

Thorsten Kleinjung; Joppe W. Bos; Paul Leyland; Peter L. Montgomery; Andrey Timofeev; Heinz Stockinger; Arjen K. Lenstra; Dag Arne Osvik; Kazumaro Aoki; Scott Contini; Jens Franke; Emmanuel Thomé; Pascal Jermini; Michela Thiémard

doi:10.1007/s10586-010-0149-0

A Heterogeneous computing environment to solve the 768-bit RSA challenge

Thorsten Kleinjung, Joppe W. Bos, Paul Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard

School of Computing

Research output: Contribution to journal › Article › peer-review

13 Citations (Scopus)

Abstract

Published online 24 December 2010. In 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.

Original language	English
Number of pages	16
Journal	Cluster Computing
Volume	15
Issue number	1
DOIs	https://doi.org/10.1007/s10586-010-0149-0
Publication status	Published - 2012

Keywords

RSA
HPC
integer factorization

Access to Document

10.1007/s10586-010-0149-0

Cite this

@article{654a6611e508469397c24c897a602f5c,

title = "A Heterogeneous computing environment to solve the 768-bit RSA challenge",

abstract = "Published online 24 December 2010. In 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.",

keywords = "RSA, HPC, integer factorization",

author = "Thorsten Kleinjung and Bos, {Joppe W.} and Paul Leyland and Montgomery, {Peter L.} and Andrey Timofeev and Heinz Stockinger and Lenstra, {Arjen K.} and Osvik, {Dag Arne} and Kazumaro Aoki and Scott Contini and Jens Franke and Emmanuel Thom{\'e} and Pascal Jermini and Michela Thi{\'e}mard",

year = "2012",

doi = "10.1007/s10586-010-0149-0",

language = "English",

volume = "15",

journal = "Cluster Computing",

issn = "1386-7857",

publisher = "Springer, Springer Nature",

number = "1",

}

TY - JOUR

T1 - A Heterogeneous computing environment to solve the 768-bit RSA challenge

AU - Kleinjung, Thorsten

AU - Bos, Joppe W.

AU - Leyland, Paul

AU - Montgomery, Peter L.

AU - Timofeev, Andrey

AU - Stockinger, Heinz

AU - Lenstra, Arjen K.

AU - Osvik, Dag Arne

AU - Aoki, Kazumaro

AU - Contini, Scott

AU - Franke, Jens

AU - Thomé, Emmanuel

AU - Jermini, Pascal

AU - Thiémard, Michela

PY - 2012

Y1 - 2012

N2 - Published online 24 December 2010. In 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.

AB - Published online 24 December 2010. In 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.

KW - RSA

KW - HPC

KW - integer factorization

U2 - 10.1007/s10586-010-0149-0

DO - 10.1007/s10586-010-0149-0

M3 - Article

SN - 1386-7857

VL - 15

JO - Cluster Computing

JF - Cluster Computing

IS - 1

ER -

A Heterogeneous computing environment to solve the 768-bit RSA challenge

Abstract

Keywords

Access to Document

Fingerprint

Cite this