Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences
DOI10.1142/s179383092250094xarXiv2206.11411OpenAlexW4224236813WikidataQ114846526 ScholiaQ114846526MaRDI QIDQ6132241
No author found.
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11411
companion matrixlinear recurrenceerror correctiondominant eigenvaluestrong Perron-Frobenius propertymatrix encryptionchecking relationsgolden cryptographyPisot polynomial
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Recurrences (11B37) Positive matrices and their generalizations; cones of matrices (15B48) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Combinatorial codes (94B25) Matrices of integers (15B36)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit of ratio of consecutive terms for general order-\(k\) linear homogeneous recurrences with constant coefficients
- The generalized relations among the code elements for Fibonacci coding theory
- Wielandt's proof of the exponent inequality for primitive nonnegative matrices
- Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
- Constructions of Pisot and Salem numbers with flat palindromes
- On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
- From golden to unimodular cryptography
- Exponents of primitive companion matrices
- The ``golden matrices and a new kind of cryptography
- On Perron-Frobenius property of matrices having some negative entries
- Counting and Testing Dominant Polynomials
- On beta expansions for Pisot numbers
- Conjugates of Pisot numbers
- Recurrent Sequences
- TRIBONACCI MATRICES AND A NEW CODING THEORY
