Co-author(s) :

Kyureghyan Melsik

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.

Place of publishing:

2014 IEEE International Conference on Cloud Engineering

Publisher:

IEEE

Identifier:

oai:noad.sci.am:136119

DOI:

10.1109/IC2E.2014.52

ISBN:

978-1-4799-3766-0

ISSN:

2373-3845

Language:

English

Volume:

1

URL:

Affiliation:

American University of Armenia ; Institute for Informatics and Automation Problems

Country:

USA

Year:

2014

Time period:

11-14 March

Conference title:

IEEE Xplore Digital Library (Proceedings of IEEE workshop on Cloud Engineering )

Place:

Boston