English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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

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