The Comparative Development and Evaluation of Generalized Fibonacci-Based Sequences for Custom Shift Cypher Algorithms

Abstract

Three dynamic Caesar shift techniques are evaluated in this research; each is based on a
different Generalized Fibonacci number at a certain j-value. The recursive relation
established from an=an−1+Fn , where Fn is the generalized Fibonacci number is used to
derive variable shifts in these systems, in contrast to typical Caesar ciphers that operate in
fixed shifts. The intricacy and randomness of every sequence produces varying degrees of
security as the j-value rises. The program is assessed based on shift variability, possible
resistance to classical cryptanalysis, and three-sequence growth {D2k,D3k,D4k}
.