On the oracle complexity of factoring integers

DOI10.1007/BF01206320zbMath0851.68044MaRDI QIDQ1918949

Ueli M. Maurer

Publication date: 17 November 1996

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

elliptic curvescryptographyfactoringoracle complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Data encryption (aspects in computer science) (68P25)

Related Items

Smooth factors of integers and elliptic curve based factoring with an oracle, On oracle factoring of integers, Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits

Cites Work

• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• On the power of two-point based sampling
• Probabilistic algorithm for testing primality
• A Monte Carlo Factoring Algorithm With Linear Storage
• Factoring with Cyclotomic Polynomials
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item