A method for computing Lucas sequences
From MaRDI portal
Recommendations
- The Lucas Sequences
- A combinatorial method for developing Lucas sequence identities.
- scientific article; zbMATH DE number 6533419
- scientific article; zbMATH DE number 3893273
- On generalized Lucas sequences
- scientific article; zbMATH DE number 4214106
- A generalization of Lucas polynomial sequence
- A graph-theoretic encoding of Lucas sequences
- On arithmetic progressions in Lucas sequences
- scientific article; zbMATH DE number 1807669
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Computing Sequences with Addition Chains
- scientific article; zbMATH DE number 177037 (Why is no real title available?)
- scientific article; zbMATH DE number 1024029 (Why is no real title available?)
- 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 3303655 (Why is no real title available?)
- New directions in cryptography
- On the security of the Lucas function
- Parallel computation of the multi-exponentiation for cryptosystems
Cited in
(8)- Lucas sequence and cryptography
- scientific article; zbMATH DE number 1807669 (Why is no real title available?)
- Computing Lucas functions using addition chains.
- Parallel computation for LUC cryptosystems on distributed memory multiprocessor machine
- Lower Bounds for Lucas Chains
- Practical numbers in Lucas sequences
- AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM
- A fast and SPA secure scalar multiplication for elliptic curve cryptography
This page was built for publication: A method for computing Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975706)
