Linear recurrent cryptography: golden-like cryptography for higher order linear recurrences. (arXiv:2206.11411v1 [cs.CR])

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 …

cryptography golden higher order