Cited in
(41)- The sharp threshold for making squares
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Analysis of hidden number problem with hidden multiplier
- On the asymptotic complexity of solving LWE
- Preimage selective trapdoor function: how to repair an easy problem
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- On RSA moduli with half of the bits prescribed
- Faster cofactorization with ECM using mixed representations
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\)
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Proof the Skewes' number is not an integer using lattice points and tangent line
- The space complexity analysis in the general number field sieve integer factorization
- Better polynomials for GNFS
- Strategy of relations collection in factoring RSA modulus
- Some mathematical remarks on the polynomial selection in NFS
- Sparse Gaussian Elimination Modulo p: An Update
- Estimates of the number of integers with the special prime factorization. II
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
- Non-linear polynomial selection for the number field sieve
- Computation of a 30750-bit binary field discrete logarithm
- Quantum factoring algorithm: resource estimation and survey of experiments
- A new ranking function for polynomial selection in the number field sieve
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Computational hardness of IFP and ECDLP
- scientific article; zbMATH DE number 7310230 (Why is no real title available?)
- Cryptanalysis of Dual RSA
- Root optimization of polynomials in the number field sieve
- Computing canonical heights on the projective line with no factorization
- Computation of a 768-bit prime field discrete logarithm
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- The set of solutions of random XORSAT formulae
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- Quantum computation: algorithms and applications
- We are on the same side. Alternative sieving strategies for the number field sieve
- RSA quantum cryptanalysis: a thorough exploration of n-bit attacks and emerging factoring techniques
- First-degree prime ideals of composite extensions
- Montgomery's method of polynomial selection for the number field sieve
- The set of solutions of random XORSAT formulae
This page was built for publication: Factorization of a 768-Bit RSA Modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582763)
