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

06/22/2022
by   Sergiy Koshkin, et al.
0

We develop matrix cryptography based on linear recurrent sequences of any order that allows securing encryption against brute force and chosen plaintext attacks. In particular, we solve the problem of generalizing error detection and correction algorithms of golden cryptography previously known only for recurrences of a special form. They are based on proving the checking relations (inequalities satisfied by the ciphertext) under the condition that the analog of the golden Q-matrix has the strong Perron-Frobenius property. These algorithms are proved to be especially efficient when the characteristic polynomial of the recurrence is a Pisot polynomial. Finally, we outline algorithms for generating recurrences that satisfy our conditions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2020

On Higher-Order Cryptography (Long Version)

Type-two constructions abound in cryptography: adversaries for encryptio...
research
02/16/2022

A novel public key cryptography based on generalized Lucas matrices

In this article, we have proposed a generalized Lucas matrix (recursive ...
research
03/25/2020

Cryptography using generalized Fibonacci matrices with Affine-Hill cipher

In this article, we have proposed a public key cryptography using Affine...
research
03/26/2023

Review of the NIST Light-weight Cryptography Finalists

Since 2016, NIST has been assessing lightweight encryption methods, and,...
research
03/30/2023

Applying of The new Integral KAJ Transform in Cryptography

In this study, a new sort of transform known as (Kuffi- Abbas- Jawad tra...
research
03/15/2019

Review on DNA Cryptography

Cryptography is the science that secures data and communication over the...
research
04/04/2017

Using Echo State Networks for Cryptography

Echo state networks are simple recurrent neural networks that are easy t...

Please sign up or login with your details

Forgot password? Click here to reset