Abstract

In this paper a new public key encryption and digital signature system based on permutation polynomials is developed. The permutation polynomial P(x) is replaced by P(xi) mod g(x) where g(x) is a secret primitive polynomial, i is the secret number such that (i, 2n-1) =1 and P(xi) = Pi(x) is declared to be a public polynomial for encryption. A public key encryption of given m(x) is the evaluation of polynomial Pi(x) at point m(x) where the result of evaluation is calculated via so called White box reduction, which does not reveal the underlying secret polynomial g(x). It is shown that for the new system to achieve a comparable security with conventional public key systems based on either Discrete logarithm or Integer factorization problems, substantially less processing length n is required resulting in a significant acceleration of public key operations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.