JOURNAL OF NUMBER THEORY, vol.149, pp.15-32, 2015 (SCI-Expanded)
Text. In this paper, we have studied the third order variations on the Fibonacci universal code and we have displayed tables GH(a)((3)) (n) we have defined for -20 <= a <= -2 and 1 <= n <= 100. Also, we have compared with the third order variations on the Fibonacci universal code and the second order variations on the Fibonacci universal code [2] in terms of cryptography and we have found that the third order variations on the Fibonacci universal code are more advantageous than the second order variations on the Fibonacci universal code. (C) 2014 Elsevier Inc. All rights reserved.