An encoding-decoding algorithm based on Fermat and Mersenne numbers

MaRDI QIDQ6615334zbMATH OpenFDO

Authors Engin Eser, Bahar Kuloǧlu, Engin Özkan

Publication date 8 October 2024

Published in Applied Mathematics E-Notes (Search for Journal in Brave)

Mathematics Subject Classification ID

Recurrences (11B37) Relations with coding theory (11H71) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35)

Recommendations

• A new coding/decoding algorithm using Fibonacci numbers
• On using Mersenne primes in the public-key encryption
• A new public-key cryptosystem via Mersenne numbers
• High rates of Fibonacci polynomials coding theory
• Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory

Cites work

• Applications of Jacobsthal and Jacobsthal-Lucas numbers in coding theory
• Coding theory on Lucas \(p\) numbers
• Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
• Mersenne and Fermat Numbers
• On generalized Mersenne numbers, their interpretations and matrix generators
• On the Applications of the Linear Recurrence Relationships to Pseudoprimes

Cited in

(1)

• Horadam-Lagrange interpolation polynomials: construction, recurrence relations, and connections to special number sequences

This page was built for publication: An encoding-decoding algorithm based on Fermat and Mersenne numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615334)