On the security of the Lucas function
From MaRDI portal
Publication:673987
DOI10.1016/0020-0190(94)00209-HzbMATH Open0875.94113OpenAlexW169754172MaRDI QIDQ673987FDOQ673987
Authors: Chi-Sung Laih, Fu-Kuan Tu, Wen-Chung Tai
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00209-h
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
- New directions in cryptography
- Cryptanalysis of the Dickson-Scheme
- Title not available (Why is that?)
- Title not available (Why is that?)
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- Title not available (Why is that?)
Cited In (9)
- A public-key cryptosystem based on Lucas sequences
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
- Polynomial representations of the Lucas logarithm
- Computing Lucas functions using addition chains.
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- A traceable group signature scheme.
- A note on public key cryptography based on Williams-Guy functions
- A method for computing Lucas sequences
- A new digital signature scheme based on chaotic maps
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)