DeepAI AI Chat
Log In Sign Up

Cryptography using generalized Fibonacci matrices with Affine-Hill cipher

by   Kalika Prasad, et al.

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 λ×λ 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.


page 1

page 2

page 3

page 4


A novel public key cryptography based on generalized Lucas matrices

In this article, we have proposed a generalized Lucas matrix (recursive ...

A model of public key cryptography using multinacci matrices

In this paper, we have proposed a Public Key Cryptography (P KC) using b...

On the role of the Fibonacci matrix as key in modified ECC

In this paper, we have proposed a modified cryptographic scheme based on...

On the reliability of computational chaos-based cryptography for information exchange

This paper investigates the use of dynamical chaotic systems to encrypt ...

Linear recurrent cryptography: golden-like cryptography for higher order linear recurrences

We develop matrix cryptography based on linear recurrent sequences of an...

Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

A family of quaternary sequences over Z4 is defined based on the Ding-He...

An algorithm for hiding and recovering data using matrices

We present an algorithm for the recovery of a matrix M (non-singular ∈ ...