Cryptography using generalized Fibonacci matrices with Affine-Hill cipher
This work addresses efficiency in cryptography for secure communication, but it appears incremental as it builds on existing Affine-Hill cipher methods with a new matrix type.
The authors tackled the problem of key exchange complexity in public key cryptography by proposing a scheme using Affine-Hill cipher with generalized Fibonacci matrices, which reduces time and space complexity by exchanging only a pair of numbers instead of a full key matrix and offers a large key-space.
In this article, we have proposed a public key cryptography using Affine-Hill cipher with a generalized Fibonacci matrix(called multinacci matrix). Also proposed a key establishment(exchange of key matrix $K=Q_λ^{k}$ of order $λ\timesλ$ for encryption-decryption) scheme with the help of multinacci sequences under prime modulo. In this scheme, instead of exchanging key matrix, we need to exchange the only pair of numbers $(λ, k)$, which reduces the time complexity as well as space complexity and comes with a large key-space.