Representation of integers by k-generalized Fibonacci sequences and applications in cryptography
From MaRDI portal
Publication:5013446
Recommendations
- scientific article; zbMATH DE number 4183486
- Uses of second order variant Fibonacci universal code in cryptography
- Properties and applications of some special integer number sequences
- New encryption scheme using \(k\)-Fibonacci-like sequence
- On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3
Cites work
- scientific article; zbMATH DE number 4068967 (Why is no real title available?)
- scientific article; zbMATH DE number 3203892 (Why is no real title available?)
- On the Fibonacci and Lucas \(p\)-numbers, their sums, families of bipartite graphs and permanents of certain matrices
- \(k\)-generalized Fibonacci numbers of the form \(1+2^{n_1}+4^{n_2}+\cdots +(2^{k})^{n_k}\)
Cited in
(6)- scientific article; zbMATH DE number 4183486 (Why is no real title available?)
- New encryption scheme using \(k\)-Fibonacci-like sequence
- Uses of second order variant Fibonacci universal code in cryptography
- Properties and applications of some special integer number sequences
- Multivariable extension of \(m\) sequences for Fibonacci numbers in cryptography
- The power-generalized \(k\)-Horadam sequences in different modules and a new cryptographic method with these sequences
This page was built for publication: Representation of integers by \(k\)-generalized Fibonacci sequences and applications in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013446)
