Factorization of a 768-Bit RSA Modulus
From MaRDI portal
Publication:3582763
DOI10.1007/978-3-642-14623-7_18zbMath1196.11167OpenAlexW2166957790WikidataQ56453909 ScholiaQ56453909MaRDI QIDQ3582763
Thorsten Kleinjung, Dag Arne Osvik, Arjen K. Lenstra, Pierrick Gaudry, Joppe W. Bos, Kazumaro Aoki, Andrey V. Timofeev, Paul Zimmermann, Alexander Kruppa, Jens Franke, Emmanuel Thomé, Herman J. J. te Riele, Peter L. Montgomery
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_18
Related Items
The space complexity analysis in the general number field sieve integer factorization, The sharp threshold for making squares, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic, A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, Quantum algorithm for solving hyperelliptic curve discrete logarithm problem, Analysis of hidden number problem with hidden multiplier, On the asymptotic complexity of solving LWE, Non-linear polynomial selection for the number field sieve, Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, Proof the Skewes' number is not an integer using lattice points and tangent line, Preimage selective trapdoor function: how to repair an easy problem, Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms, Computational hardness of IFP and ECDLP, Cryptanalysis of Dual RSA, Computation of a 768-Bit Prime Field Discrete Logarithm, A Kilobit Hidden SNFS Discrete Logarithm Computation, Better polynomials for GNFS, Strategy of Relations Collection in Factoring RSA Modulus, Computation of a 30750-bit binary field discrete logarithm, Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments, Montgomery's method of polynomial selection for the number field sieve, Оценки количества чисел со специальным разложением на простые множители. II, The set of solutions of random XORSAT formulae, GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\), Faster cofactorization with ECM using mixed representations, Some mathematical remarks on the polynomial selection in NFS, Sparse Gaussian Elimination Modulo p: An Update, A new ranking function for polynomial selection in the number field sieve, Unnamed Item, Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment, Unnamed Item, Root optimization of polynomials in the number field sieve, Computing canonical heights on the projective line with no factorization, Forty years of attacks on the RSA cryptosystem: A brief survey
