Cryptographic Coding of Some Fibonacci Type Numbers to Determine Repeated Steps of Their Residues

This paper focused on to study cryptographic coding of linear recurrence relations of some Fibonacci type numbers to determine repeated steps of their residues for integer modulo from 2 to 10. It particularly focused to study repeated steps of residues of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobistal, Jacobistal-Lucas, and Narayana numbers. In cryptographic coding, repeated steps of residues are useful for public sector, and nonresidues are useful for private sector. So, we are focused to generate the Fibonacci type number repeated steps of residues under integer modulo from 2 to 10.