Factoring Estimates for a 1024-Bit RSA Modulus

Abstract

Abstract. We estimate the yield of the number field sieve factoring al-gorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17] of the TWIRL hard-ware factoring device [18]. We present the details behind the resulting improved parameter choices from [18]

Similar works

Full text

thumbnail-image
oai:CiteSeerX.psu:10.1.1.925.1292Last time updated on 11/1/2017

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.