ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES

DOI10.17223/20710410/38/7OpenAlexW2780134552MaRDI QIDQ5151084

Alexander N. Rybalov

Publication date: 16 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm603

zbMATH Keywords

probabilistic algorithmgeneric complexityproblem of finding roots in groups of residues

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Average-case complexity and decision problems in group theory.
• Generic-case complexity, decision problems in group theory, and random walks.
• The halting problem is decidable on a set of asymptotic probability one
• Generic complexity of undecidable problems
• 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

This page was built for publication: ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES