On the generic complexity of the problem of computing the Euler function

DOI10.17223/20710410/65/6MaRDI QIDQ6646053zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 29 November 2024

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

Full work available at URL https://doi.org/10.17223/20710410/65/6

zbMATH Keywords

Euler functiongeneric complexity

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Generic-case complexity, decision problems in group theory, and random walks.
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• scientific article; zbMATH DE number 799791 (Why is no real title available?)
• On generic complexity of the discrete logarithm problem
• ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES
• ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM
• PRIMES is in P

This page was built for publication: On the generic complexity of the problem of computing the Euler function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646053)