On the generic complexity of the discrete logarithm problem in Lucas sequences

DOI10.17223/20710410/66/10MaRDI QIDQ7005926zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 31 March 2025

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

Full work available at URL https://doi.org/10.17223/20710410/66/10

zbMATH Keywords

discrete logarithmgeneric complexityLucas sequences

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences and polynomials (11B83) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cites work

• Approximate formulas for some functions of prime numbers
• Generic-case complexity, decision problems in group theory, and random walks.
• scientific article; zbMATH DE number 1024494 (Why is no real title available?)
• scientific article; zbMATH DE number 1030971 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (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

This page was built for publication: On the generic complexity of the discrete logarithm problem in Lucas sequences

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