Publication:4847943
From MaRDI portal
zbMath0834.11063MaRDI QIDQ4847943
Kevin S. McCurley, Leonard M. Adleman
Publication date: 18 October 1995
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11Y40: Algebraic number theory computations
Related Items
The Power of Leibniz-Like Functions as Oracles, ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES, New Characterization of the Factor Refinement Algorithm with Applications, Deterministic factoring with oracles, On reducing factorization to the discrete logarithm problem modulo a composite, A note on quadratic residuosity and UP, An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme, Computing sparse multiples of polynomials, Integer factoring and compositeness witnesses, Spectral characterizations of tournaments, Practical convertible authenticated encryption schemes using self-certified public keys, A new forward-secure authenticated encryption scheme with message linkages, A deterministic version of Pollard’s $p-1$ algorithm