On the generic complexity of the discrete logarithm problem in Lucas sequences
From MaRDI portal
Cites work
- A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms
- Approximate formulas for some functions of prime numbers
- Generic-case complexity, decision problems in group theory, and random walks.
- 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
- Some remarks on Lucas-based cryptosystems
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)