The power-generalized \(k\)-Horadam sequences in different modules and a new cryptographic method with these sequences
From MaRDI portal
Publication:6637058
DOI10.1142/s1793830923500556MaRDI QIDQ6637058
Publication date: 13 November 2024
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Fibonacci sequencesymmetric cryptographyElGamal cryptosysteminteger-valued polynomial modulethe power-generalized \(k\)-Horadam sequence
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on generalized \(k\)-Horadam sequence
- A note on generalized Fibonacci sequences
- A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients
- On the order-\(k\) generalized Lucas numbers
- Fast image encryption algorithm based on parallel computing system
- On the Fibonacci \(k\)-numbers
- On the representation of \(k\)-generalized Fibonacci and Lucas numbers
- Fibonacci and Lucas numbers with applications. Volume I
- Cryptography. Theory and practice
- A New Generalization of Fibonacci Sequence & Extended Binet's Formula
- An ElGamal-like cryptosystem for enciphering large messages
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- The generalized k-sequence
This page was built for publication: The power-generalized \(k\)-Horadam sequences in different modules and a new cryptographic method with these sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637058)
