Permutation polynomials and a new public-key encryption
نویسندگان
چکیده
منابع مشابه
On a public key encryption algorithm based on Permutation Polynomials and performance analyses
In this paper a modification of public key encryption system presented in [Khachatryan, Kyureghyan, 2015] and performance analysis are presented. As described in [Khachatryan, Kyureghyan, 2015], the permutation polynomial P (x) is declared to be a public polynomial for encryption. A public key encryption of given m(x) is the evaluation of polynomial P (x) at point m(x) where the result of evalu...
متن کاملPublic Key Cryptography Using Permutation P-polynomials over Finite Fields
In this paper we propose an efficient multivariate public key cryptosystem based on permutation p-polynomials over finite fields. We first characterize a class of permutation ppolynomials over finite fields Fqm and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is O(m) multiplication which is equivale...
متن کاملAn Improved Public Key Encryption Algorithm Based on Chebyshev Polynomials
This paper proposes an improved public key encryption algorithm based on Chebyshev polynomials. On the base of the semi-group property of Chebyshev polynomials, we import the alternative multiply coefficient i K to forge the ciphertext tactfully which can make the cipher text-only aattack out of work. The chosen of i K is decided by the value of ( ( )) mod r s T T x N , and the number of i K ca...
متن کاملPublic-key Encryption with Masking Public-key Encryption with Masking
Timed-release encryption, first mentioned by May [12] and discussed by Rivest, Shamir, and Wanger [15], is a cryptographic primitive which enables us to “send a message into the future.” We take a simple approach, called public-key encryption with masking, in order to realize this requirement. In our model, the sender first encrypts a plaintext and “masks” the ciphertext, then send it the recei...
متن کاملa cca2-secure incomparable public key encryption scheme
in 2003, waters, felten and sahai introduced a novel cryptographic primitive called incomparable public key cryptosystem to protect anonymity of message receivers in an untrusted network. in this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. recently, lee and lim improved the soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.09.001