scientific article
From MaRDI portal
Publication:3822227
zbMath0669.10012MaRDI QIDQ3822227
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generalized Riemann hypothesisprobabilistic algorithmcomputational number theoryfactoring algorithmelliptic curve smoothness test
Number-theoretic algorithms; complexity (11Y16) Approximation algorithms (68W25) Factorization (11Y05)
Related Items (4)
Mathematical problems in cryptology ⋮ Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Explicit Bounds for Primality Testing and Related Problems
This page was built for publication:
