2010-08-01
Factorization of a 768-bit RSA modulus
Publication
Publication
Presented at the
IACR Crypto, Santa Barbara, CA, USA
This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
| Additional Metadata | |
|---|---|
| , | |
| , | |
| Springer | |
| T. Rabin | |
| Pushing the factoring boundary to 768 bits | |
| IACR Crypto | |
| Organisation | Cryptology |
|
Kleinjung, T., Aoki, K., Franke, J., Lenstra, A., Thomee, E., Bos, J., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., te Riele, H., Timofeev, A.& Zimmermann, P. (2010). Factorization of a 768-bit RSA modulus. In T. Rabin (Ed.), Proceedings of Advances in Cryptology - CRYPTO 2010 2010 (pp. 333–350). Springer. |
|
