Convolved numbers of k-section of the Fibonacci sequence: properties, consequences
Herald of Advanced Information Technology · 01.04.2026 · 9 (2) · 129-139
DOI: 10.15276/hait.09.2026.09 ↗Kurz gefasst
Fachartikel in der Zeitschrift Herald of Advanced Information Technology, online erschienen am 01.04.2026. Verfasst von Vitaly M. Khamitov und 3 weiteren Autor:innen.
Abstract (Originalsprache)
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms are additionally used. Such shifts are generated by linear recurrent sequences. Among them, the most popular are the Fibonacci sequence { F n } ∞ n =1 and its generalizations, for example, convolved Fibonacci numbers { F ( s ) n } ∞ n =1 and k-sections of the Fibonacci sequence { Φ n,k } ∞ n =1 (Φ n,k = F nk /F k ) . This article considers a further generalization of Fibonacci numbers, namely convolutions of k-sections of the Fibonacci sequence { Φ ( s ) n,k } ∞ n =1 . These numbers are defined by the relations:
Zitieren
APA
Khamitov, V. M., Dmitrishin, D. V., Stokolos, A. M., & Gray, D. A. (2026). Convolved numbers of k-section of the Fibonacci sequence: properties, consequences. Herald of Advanced Information Technology, 9(2), 129-139. https://doi.org/10.15276/hait.09.2026.09
Vancouver
Khamitov VM, Dmitrishin DV, Stokolos AM, Gray DA. Convolved numbers of k-section of the Fibonacci sequence: properties, consequences. Herald of Advanced Information Technology. 2026;9(2):129-139. doi:10.15276/hait.09.2026.09
BibTeX
@article{Khamitov2026,
author = {Khamitov, Vitaly M. and Dmitrishin, Dmitro V. and Stokolos, Alexander M. and Gray, Daniel A.},
title = {Convolved numbers of k-section of the Fibonacci sequence: properties, consequences},
journal = {Herald of Advanced Information Technology},
year = {2026},
volume = {9},
number = {2},
pages = {129--139},
doi = {10.15276/hait.09.2026.09}
}
EUVIMED