DeepAI AI Chat
Log In Sign Up

A novel public key cryptography based on generalized Lucas matrices

by   Kalika Prasad, et al.
Central University of Jharkhand

In this article, we have proposed a generalized Lucas matrix (recursive matrix of higher order) having relation with generalized Fibonacci sequences and established many special properties in addition to that usual matrix algebra. Further, we have proposed a modified public key cryptography using these matrices as keys in Affine cipher and key agreement for encryption-decryption with the combination of terms of generalized Lucas sequences under residue operations. In this scheme, instead of exchanging the whole key matrix, only a pair of numbers(parameters) need to be exchanged, which reduces the time complexity as well as space complexity of the key transmission and has a large key-space.


page 1

page 2

page 3

page 4


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

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

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

A Public-Key Cryptosystem Using Cyclotomic Matrices

Confidentiality and Integrity are two paramount objectives of asymmetric...

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

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

Smaller Keys for Code-Based Cryptography: McEliece Cryptosystems with Convolutional Encoders

In this paper we present a novel class of convolutional codes and invest...

An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm

One of the most significant challenges on cryptography today is the prob...