A novel grey data generating technique on Elliptic Curve Cryptosystems
Journal
International Journal of Innovative Computing, Information and Control
Journal Volume
7
Journal Issue
1
Pages
379-394
Date Issued
2011
Author(s)
Abstract
In a cryptosystemn when the key is lost the system will not be able to decrypt information or open encrypted documents; as a result the entire system ceases to function normally. Therefore this paper aims to propose a solution to the said problem so that the system can revert back to its normal state. Generally a good cryptosystemn fulfills two basic requirements; they are security and confidentiality. If it is easy to use, it will then become popular. Thus, we would like to propose an easy-handlinq cryptosystemn in this paper which corresponds to these two requirements in addition to being able to easily retrieve lost keys and restore the system to its normal state. Mainly we combine the concepts of Elliptic Curve Cryptosystemn (ECC) and mathematical Grey Model into an algorithm to illustrate how we can use the Grey Model's mathematical formula to reconstruct and recover the secret key when the system's secret key is lost so that the disabled system can resume its normal operations. Public key cryptosystemns are quite familiar to most; the more popular ones are either RSA -based or ECC-based. Here we suggest EGG because its security is based on the difficulty of solving Elliptic Curve Discrete Logarithm Problem (ECDLP,). It has been proven that ECC provides much greater efficiency with order of magnitude roughly 10 times than RSA-based systems according to the key length of 313 bits in EGG giving the samne security level as a key length of 096 bits in RSA. The basic attack on the Internet involves finding or cracking the secret key. But in ECC an attacker has to derive the secret key from the corresponding public key and therefore he or she inevitably has to face the ECDLP which is an e.rtremnely difficult task. Hence, it is extremely difficult for an attacker to obtain the secret key in our proposed method. On the other handy the Grey Model can give us a hand on guarding against confidentiality-related security problem. Basically, we make use of a mathematical arniy hierarchy to calculate and further to reconstruct the hierarihy's original key regarded as a secret key here. When the secret key is lost we can retrieve the original secret key by using its original mnathemnatical army through the derivation of a mnathemnatical formula of th Greg Model. Hauing th Greg Model, w can auoid th confidntialitg security problem due to the different settings for the levels and rounding off of decimals. Therefore, even if the array in the bottom level gets hacked, it is still very difficult to derive the original array from the bottom. In fact, it is very difficult to crack anything mathematically, and the characteristics of the confidentiality can be improved. At the same time, this increases the method's confidentiality, making the system more secure. ICIC International © 2011 ISSN.
Subjects
Data generation; ECDLP; Elliptic curve cryptosystem; Grey model; Public key cryptosystem
SDGs
Other Subjects
Data generation; ECDLP; Elliptic Curve Cryptosystem; Grey Model; Public key cryptosystems; Ad hoc networks; Algebra; Electronic crime countermeasures; Geometry; Public key cryptography; Mathematical models
Type
conference paper