DeepAI AI Chat
Log In Sign Up

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

by   Munesh Kumari, et al.

In this paper, we have proposed a modified cryptographic scheme based on the application of recursive matrices as key in ECC and ElGamal. For encryption, we consider mapping analogous to affine Hill cipher in which a plaintext matrix has been constructed by points corresponding to letters on elliptic curves. In the formation of key-space, the generalized Fibonacci matrices have been taken into account, which is the sequence of matrices. The beauty of considering Fibonacci matrices is their construction where we need only two parameters(integers) in place of n^2 elements. The use of a recursive matrix makes a large keyspace for our proposed scheme and increases its efficiency. Thus, it reduces time as well space complexity, and its security & strength is based on EC-DLP which is a hard problem in number theory.


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

Cryptography using generalized Fibonacci matrices with Affine-Hill cipher

In this article, we have proposed a public key cryptography using Affine...

A model of public key cryptography using multinacci matrices

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

Cryptographic analysis of the Modified Matrix Modular Cryptosystem

We show that the Modified Matrix Modular Cryptosystem proposed by S.K. R...

An Encoding-Decoding algorithm based on Padovan numbers

In this paper, we propose a new of coding/decoding algorithm using Padov...

Discrete Logarithmic Fuzzy Vault Scheme

In this paper a three fuzzy vault schemes which integrated with discrete...