scientific article
From MaRDI portal
Publication:3808150
zbMath0659.10003MaRDI QIDQ3808150
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycomputational number theoryfactoring algorithmelliptic curve methodrandom algorithmscoordinate recurrence methoddiscrete logarithms in GF(q)
Analysis of algorithms and problem complexity (68Q25) Finite fields and commutative rings (number-theoretic aspects) (11T99) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)
Related Items (21)
On the distribution in short intervals of integers having no large prime factor ⋮ Sieve algorithms for perfect power testing ⋮ Finding elliptic curves with a subgroup of prescribed size ⋮ Algorithms in Algebraic Number Theory ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Computational complexity of sentences over fields ⋮ A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields ⋮ Comments on search procedures for primitive roots ⋮ A Rigorous Time Bound for Factoring Integers ⋮ One-way permutations on elliptic curves ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ A Rigorous Subexponential Algorithm For Computation of Class Groups ⋮ Quantum algorithms for algebraic problems ⋮ On the discrete logarithm problem in class groups of curves ⋮ Function field sieve method for discrete logarithms over finite fields ⋮ Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic ⋮ Modifications to the number field sieve ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Integers without large prime factors
This page was built for publication:
