scientific article; zbMATH DE number 475434
From MaRDI portal
Publication:4273681
zbMath0806.11067MaRDI QIDQ4273681
Hendrik W. jun. Lenstra, Joe P. Buhler, Carl B. Pomerance
Publication date: 13 February 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (46)
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes ⋮ Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ On the coefficients of the polynomial in the number field sieve ⋮ Optimal strong primes ⋮ Attacking RSA Using an Arbitrary Parameter ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Algorithms in Algebraic Number Theory ⋮ Bounds for fixed point free elements in a transitive group and applications to curves over finite fields ⋮ An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) ⋮ RSA and Elliptic Curve Least Significant Bit Security ⋮ Mathematical etudes on quantum computation ⋮ Computing the endomorphism ring of an ordinary abelian surface over a finite field ⋮ Running Time Predictions for Factoring Algorithms ⋮ Automating algorithm selection: checking for matrix properties that can simplify computations ⋮ Splitting quaternion algebras over quadratic number fields ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Fast multiquadratic S-unit computation and application to the calculation of class groups ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ An \(L(1/3)\) discrete logarithm algorithm for low degree curves ⋮ Computing the endomorphism ring of an ordinary elliptic curve over a finite field ⋮ On sharp transitions in making squares ⋮ When e-th Roots Become Easier Than Factoring ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ The Factorization of the Ninth Fermat Number ⋮ Rigorous analysis of a randomised number field sieve ⋮ Short Generators Without Quantum Computers: The Case of Multiquadratics ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ The number field sieve for integers of low weight ⋮ Updating key size estimations for pairings ⋮ An Implementation of the Number Field Sieve ⋮ Short principal ideal problem in multicubic fields ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Better polynomials for GNFS ⋮ Post-Quantum Cryptography: State of the Art ⋮ Quantum algorithms for algebraic problems ⋮ Approximating rings of integers in number fields ⋮ On fixed points of permutations. ⋮ Computing algebraic numbers of bounded height ⋮ On polynomial selection for the general number field sieve ⋮ Resource bounded symmetry of information revisited ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment ⋮ Function field sieve method for discrete logarithms over finite fields ⋮ Modifications to the number field sieve ⋮ Root optimization of polynomials in the number field sieve ⋮ Solution of polynomial equations in the field of algebraic numbers
This page was built for publication:
