Cryptography using generalized Fibonacci matrices with Affine-Hill cipher

From MaRDI portal
Publication:5059569

DOI10.1080/09720529.2020.1838744zbMATH Open1506.94060arXiv2003.11936OpenAlexW3136673343WikidataQ121853122 ScholiaQ121853122MaRDI QIDQ5059569FDOQ5059569


Authors: Kalika Prasad, Hrishikesh Mahato Edit this on Wikidata


Publication date: 23 December 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Abstract: In this article, we have proposed a public key cryptography using Affine-Hill cipher with a generalized Fibonacci matrix(called multinacci matrix). Also proposed a key establishment(exchange of key matrix K=Qlambdak of order lambdaimeslambda for encryption-decryption) scheme with the help of multinacci sequences under prime modulo. In this scheme, instead of exchanging key matrix, we need to exchange the only pair of numbers (lambda,k), which reduces the time complexity as well as space complexity and comes with a large key-space.


Full work available at URL: https://arxiv.org/abs/2003.11936




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Cryptography using generalized Fibonacci matrices with Affine-Hill cipher

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