Representation of integers by k-generalized Fibonacci sequences and applications in cryptography
DOI10.1142/S1793557121501576zbMATH Open1482.11020OpenAlexW3127878612MaRDI QIDQ5013446FDOQ5013446
Authors: Salim Badidja, Ahmed Ait Mokhtar, Özen Özer
Publication date: 30 November 2021
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557121501576
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
cryptographyencryptiondecryptionrepresentation of integerslinear recurrent sequences\(k\)-generalized Fibonacci sequencesTribonacci sequencegeneralized Tribonacci sequences
Cryptography (94A60) Special sequences and polynomials (11B83) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
Cited In (6)
- Title not available (Why is that?)
- New encryption scheme using \(k\)-Fibonacci-like sequence
- Properties and applications of some special integer number sequences
- Uses of second order variant Fibonacci universal code in cryptography
- 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)