A New Method of Golden Ratio Computation for Faster Cryptosystems

Abstract

The Golden Ratio is the most irrational among irrational numbers. Its successive continued fraction converges with the Fibonacci sequence F(n+1)/F(n) are the slowest to approximate to its actual value.This paper proposes a new method to determine the Golden Ratio with infinite precision and compares the new method with the well-known Fibonacci sequence method. The results show that our proposed method outperforms Fibonacci sequence method. Hence, cryptosystems that use Fibonacci numbers would be much faster using our new method of Golden Ratio computation. This paves way in improving counter measures from security attacks since higher precisions of the Golden Ratio method can take place in cryptographic operations very quickly when used in elliptic curve cryptosystems, power analysis security, and other applications.