Answers are grounded in this paper and cite their sources.
In this paper, we present a modified cryptographic technique based on the use of recursive matrices as the key in ECC and ElGamal. For encryption, we take into account mapping similar to [5] and the ElGamal technique, in which a plaintext matrix is built from points that correspond to the letters on elliptic curves. The extended generalized Fibonacci matrices, which are a sequence of matrices, have been considered in the creation of key space. The consideration of extended generalized Fibonacci matrices is delightful because it just requires four parameters (integers) as opposed to all of the matrix entries. Our suggested system has a vast key space and is more effective because of the use of a recursive matrix. As a result, it minimizes the complexity of both time and space. Additionally, it is secure and robust since it is based on the challenging number theory issue known as the elliptic curve-discrete logarithm issue.
No takes yet. Share an insight, caveat, or question.
Billore et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: