Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

CRYPTO
2010
Springer

favoriteEmaildiscussreport

141views Cryptology» more CRYPTO 2010»

Factorization of a 768-Bit RSA Modulus

13 years 12 months ago

Factorization of a 768-Bit RSA Modulus

Download eprint.iacr.org

Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Ar

Real-time Traffic

CRYPTO 2010 | Cryptology |

claim paper

Related Content

» A New Public Key Cryptosystem Based on Higher Residues

» Factoring Estimates for a 1024Bit RSA Modulus

» Estimating the PrimeFactors of an RSA Modulus and an Extension of the Wiener Attack

» Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits

» Factorization of a 512Bit RSA Modulus

» Eliminating Quadratic Slowdown in TwoPrime RSA Function Sharing

» The Insecurity of Esign in Practical Implementations

» Breaking RSA Generically Is Equivalent to Factoring

» Modulus Fault Attacks against RSACRT Signatures

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	CRYPTO
Authors	Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann

Comments (0)