On generic complexity of the integer factorization problem

DOI10.17223/20710410/61/7MaRDI QIDQ6495967

Alexander N. Rybalov

Publication date: 2 May 2024

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

integer factorizationgeneric complexity

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Generic-case complexity, decision problems in group theory, and random walks.
• A method for obtaining digital signatures and public-key cryptosystems
• ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM
• ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM
• ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES

This page was built for publication: On generic complexity of the integer factorization problem