Cryptography using generalized Fibonacci matrices with Affine-Hill cipher
March 25, 2020 Β· Declared Dead Β· π Journal of Discrete Mathematical Sciences and Cryptography
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Kalika Prasad, Hrishikesh Mahato
arXiv ID
2003.11936
Category
cs.CR: Cryptography & Security
Cross-listed
math.CO,
math.NT
Citations
45
Venue
Journal of Discrete Mathematical Sciences and Cryptography
Last Checked
3 months ago
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=Q_Ξ»^{k}$ of order $Ξ»\timesΞ»$ 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 $(Ξ», k)$, which reduces the time complexity as well as space complexity and comes with a large key-space.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Cryptography & Security
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Membership Inference Attacks against Machine Learning Models
R.I.P.
π»
Ghosted
The Limitations of Deep Learning in Adversarial Settings
R.I.P.
π»
Ghosted
Practical Black-Box Attacks against Machine Learning
R.I.P.
π»
Ghosted
Distillation as a Defense to Adversarial Perturbations against Deep Neural Networks
R.I.P.
π»
Ghosted
Extracting Training Data from Large Language Models
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted