| Title | New Efficient QERPKC based on Partial Discrete Logarithm Problem |
| Publication Type | Conference Paper |
| Year of Publication | 2020 |
| Authors | Meshram, C., Obaidat, M. S., Meshram, A. |
| Conference Name | 2020 International Conference on Computer, Information and Telecommunication Systems (CITS) |
| Date Published | oct |
| Keywords | computational complexity, cryptography, Elliptic curve cryptography, Encryption, exponentiation, partial discrete logarithm problem, PDLP, PDLP hardness, PKC, Protocols, pubcrawl, public key cryptography, public key encryption, QER, QERPKC, quadratic exponentiation randomized public key cryptosystem, Resiliency, Safety, Scalability, security, security analysis, Transmitters |
| Abstract | In this study, our aim is to extend the scope for public key cryptography. We offered a new efficient public key encryption scheme using partial discrete logarithm problem (PDLP). It is known as the Quadratic Exponentiation Randomized Public Key Cryptosystem (QERPKC). Security of the presented scheme is based on the hardness of PDLP. We reflect the safety in contrast to trick of certain elements in the offered structure and demonstrated the prospect of creating an extra safety structure. The presented new efficient QERPKC structure is appropriate for low-bandwidth communication, low-storage and low-computation environments. |
| DOI | 10.1109/CITS49457.2020.9232533 |
| Citation Key | meshram_new_2020 |
New Efficient QERPKC based on Partial Discrete Logarithm Problem