scientific article; zbMATH DE number 799791

zbMath0834.11063MaRDI QIDQ4847943

Kevin S. McCurley, Leonard M. Adleman

Publication date: 18 October 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityopen problemsnumber theoretic algorithmsextensive bibliography

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (13)

The Power of Leibniz-Like Functions as Oracles ⋮ A new forward-secure authenticated encryption scheme with message linkages ⋮ A note on quadratic residuosity and UP ⋮ Spectral characterizations of tournaments ⋮ Computing sparse multiples of polynomials ⋮ New Characterization of the Factor Refinement Algorithm with Applications ⋮ Deterministic factoring with oracles ⋮ On reducing factorization to the discrete logarithm problem modulo a composite ⋮ ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme ⋮ Integer factoring and compositeness witnesses ⋮ Practical convertible authenticated encryption schemes using self-certified public keys

This page was built for publication: