On the Security of the Generalized Golden Cryptography

Date Added: Jan 2012
Format: PDF

This paper is devoted to the investigation of the security of the generalized golden cryptography, and it shows that this cryptography is not secure against chosen-plaintext attack. The simplicity and beauty of Fibonacci numbers have motivated to develop matrix cryptosystems, which are useful in digital communications, i.e., digital TV, digital telephony, digital measurement, etc. One of such cryptosystems, called the golden cryptography based on the golden matrices, which are a generalization of Fibonacci Q-matrices for continuous domain, was introduced by Stakhov.