Visible to the public New Efficient QERPKC based on Partial Discrete Logarithm Problem

TitleNew Efficient QERPKC based on Partial Discrete Logarithm Problem
Publication TypeConference Paper
Year of Publication2020
AuthorsMeshram, C., Obaidat, M. S., Meshram, A.
Conference Name2020 International Conference on Computer, Information and Telecommunication Systems (CITS)
Date Publishedoct
Keywordscomputational 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
AbstractIn 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.
DOI10.1109/CITS49457.2020.9232533
Citation Keymeshram_new_2020