scientific article; zbMATH DE number 3801619
From MaRDI portal
Publication:4745878
zbMath0508.10004MaRDI QIDQ4745878
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the distribution in short intervals of integers having no large prime factor ⋮ Discrete logarithms in \(\mathrm{GF}(p)\) ⋮ The sharp threshold for making squares ⋮ Is the data encryption standard a group? (Results of cycling experiments on DES) ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Implications of the arithmetic ratio of prime numbers for RSA security ⋮ A quantum version of Pollard's Rho of which Shor's algorithm is a particular case ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Some uses of microcomputers in number theory research ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ A Practical Analysis of the Elliptic Curve Factoring Algorithm ⋮ The Factorization of the Ninth Fermat Number ⋮ Rigorous analysis of a randomised number field sieve ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Factoring with hints ⋮ Factoring with Two Large Primes ⋮ Quadratic sieving ⋮ Approximating rings of integers in number fields ⋮ Smooth Values of Quadratic Polynomials ⋮ Factoring with the quadratic sieve on large vector computers ⋮ Factoring on a computer ⋮ New Ideas for Factoring Large Integers ⋮ Factorization Using the Quadratic Sieve Algorithm
