On the security of the Lucas function
From MaRDI portal
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- Cryptanalysis of the Dickson-Scheme
- scientific article; zbMATH DE number 4214161 (Why is no real title available?)
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- scientific article; zbMATH DE number 3748927 (Why is no real title available?)
- New directions in cryptography
Cited in
(12)- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
- A traceable group signature scheme.
- A method for computing Lucas sequences
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- A new digital signature scheme based on chaotic maps
- Polynomial representations of the Lucas logarithm
- A public-key cryptosystem based on Lucas sequences
- Computing Lucas functions using addition chains.
- scientific article; zbMATH DE number 1024494 (Why is no real title available?)
- scientific article; zbMATH DE number 1030971 (Why is no real title available?)
- A note on public key cryptography based on Williams-Guy functions
- On integer sequences in cryptography
This page was built for publication: On the security of the Lucas function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673987)