An Efficient Golden Ratio Method for Secure Cryptographic Applications

Mathematical and Computational Applications

Venkatraman, Sitalakshmi¹  Overmars, Anthony³ 

[1] Design, Melbourne Polytechnic, Preston, VIC 3072, Australia;Author to whom correspondence should be addressed.;School of Engineering, Construction &

关键词: golden ratio;    Fibonacci sequence;    Diophantine equation;    cryptography;    secret key;    information security;    efficient computation;   

DOI  :  10.3390/mca23040058

学科分类：计算数学

来源: mdpi

【 摘 要 】

With the increase in the use of electronic transactions in everyday life, secure communications and data storage to withstand any kind of attack is warranted. The golden ratio, being the most irrational among irrational numbers, can be used in elliptic curve cryptosystems, power analysis security, and other applications. However, in such applications, cryptographic operations should take place very quickly before the keys are extracted or decoded by the attackers. This paper proposes an efficient method of golden ratio computation in cryptography to resist information security breaches. We compare our new golden ratio method with the well-known Fibonacci sequence method. The experimental results show that our proposed method is more efficient than the Fibonacci sequence method. Our golden ratio method with infinite precision provides reliable counter measure strategy to address the escalating security attacks.

【 授权许可】

CC BY