Cryptography utilizing the affine-Hill cipher and extended generalized Fibonacci matrices
DOI10.21608/EJMAA.2023.295792MaRDI QIDQ6575476
Naresh M. Patel, Author name not available (Why is that?)
Publication date: 20 July 2024
Published in: Electronic Journal of Mathematical Analysis and Applications EJMAA (Search for Journal in Brave)
cryptographyaffine Hill cipherextended generalized Fibonacci sequence and matrixFibonacci sequence and matrix
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Recurrences (11B37) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications to coding theory and cryptography of arithmetic geometry (14G50) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Matrices, determinants in number theory (11C20)
Cites Work
- On the order-\(k\) generalized Lucas numbers
- AN EXTENSION OF HILL CIPHER USING GENERALISED INVERSES AND mth RESIDUE MODULO n
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Fibonacci and Lucas Numbers With Applications
- A Public Key Cryptosystem Using Hiil's Cipher
- Cryptanalysis of an Extension of the Hill Cipher
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Cryptography utilizing the affine-Hill cipher and extended generalized Fibonacci matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575476)
