An Elliptic Curve Cryptography based Algebraic Structures for Security Provisioning using Algebraic Cryptography

Abstract

In this day and age of pervasive computing, it is more important than ever to take measures to secure sensitive information. This is an especially important topic given that data is kept and sent in diverse places all over the world. The protection of information that has been stored relies heavily on the use of a number of different encryption methods, many of which may be traced back to algebraic cryptography. Using elliptic curve cryptography, we presented in this paper a way for producing algebraic codes over F q that are more resistant to cryptanalysis. The system's information rate as well as its level of security are both of the highest possible quality. It is easy to utilize this plan to construct a new scheme based on the existing one without recovering the secret. By doing so, it is possible to increase or decrease the number of shareholders, as well as widen the set of shares that may be used to retrieve the secrets.