A Cryptosystem Based on DLP γ≡α^aβ^b mod p

10.6633/IJNS.200607.3(1).13

Sunil Kumar Kashyap；Birendra Kumar Sharma；Amitabh Banerjee

Discrete logarithm problem or DLP ； public key cryptosystem or PKC

International Journal of Network Security

3卷1期（2006 / 07 / 01）

95 - 100

英文

This paper introduces mainly the concept of the Public Key Cryptosystem or PKC, whose security is based on the new Discrete Logarithm Problem known as DLP-III and DLP-IV with the two distinct exponentiations, i.e. γ≡α^aβ^b mod p in the multiplicative group of the finite field Zp* of the order p − 1. We show that the proposed Public Key Cryptosystem based on DLP-IV provides more security because of double computation comparing with the well known the Discrete Logarithm Problem II or DLP-II with one exponentiation, i.e. β≡αa mod p in the multiplicative group of the finite field Zp* of the order p − 1 at the same efficiency level.