Paper 2019/1414

A New Encryption Scheme Based On Subset Identifying Problem

Muhammad Rezal Kamel Ariffin


In this article we put forward an encryption mechanism that dwells on the problem of identifying the correct subset of primes from a known set. By utilizing our specially constructed public key when computing the ciphertext equation, the decryption mechanism can correctly output the shared secret parameter. The scheme has short key length, no decryption failure issues, plaintext-to-ciphertext expansion of one-to-two as well as uses \simple" mathematics in order to achieve maximum simplicity in design, such that even practitioners with limited mathematical background will be able to understand the arithmetic. Due to in-existence of efficient algorithms running upon a quantum computer to obtain the roots of our ciphertext equation and also to retrieve the private key from the public key, our encryption mechanism can be a probable candidate for seamless post quantum drop-in replacement for current traditional asymmetric schemes.

Available format(s)
-- withdrawn --
Public-key cryptography
Publication info
Preprint. MINOR revision.
post quantum cryptosystemsubset identifying problemcombination problem
Contact author(s)
rezal @ upm edu my
2019-12-12: withdrawn
2019-12-06: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.