Modified ID-based cryptosystem using discrete logarithm problem
Chi‐Sung Laih, J.Y. Lee
Abstract
Chi‐Sung Laih, J.Y. Lee
Abstract
A modified ID-based cryptosystem using the logarithm problem is presented. It eliminates the constraints of the algorithm proposed by Tsujii et al. which limits the entity number to be less than the bit number. In our system, however, the entities can be extended to arbitrary number without reducing the system security. It is more suitable for practical implementation.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A modified ID-based cryptosystem using the logarithm problem is presented. It eliminates the constraints of the algorithm proposed by Tsujii et al. which limits the entity number to be less than the bit number. In our system, however, the entities can be extended to arbitrary number without reducing the system security. It is more suitable for practical implementation.
Key concepts: Discrete logarithm, Cryptosystem, Logarithm, Cryptography, Computer science, Hybrid cryptosystem, Algorithm, Arithmetic