CRNTMar 19, 2020

A public key cryptography using multinacci block matrices

arXiv:2003.08634v21 citations
AI Analysis

This is an incremental improvement in cryptography, potentially offering efficiency gains for secure communication systems.

The authors proposed a public key cryptography system using multinacci block matrices over finite fields, which features a large keyspace and relies on the Discrete Logarithm Problem for security.

In this paper, we have proposed a public key cryptography using recursive block matrices involving generalized Fibonacci numbers over a finite field Fp. For this, we define multinacci block matrices, a type of upper triangular matrix involving multinacci matrices at diagonal places and obtained some of its algebraic properties. Moreover, we have set up a method for key element agreement at end users, which makes the cryptography more efficient. The proposed cryptography comes with a large keyspace and its security relies on the Discrete Logarithm Problem(DLP).

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes