A Public Key Cryptosystem Using a Group of Permutation Polynomials
2020 ◽
Vol 77
(1)
◽
pp. 139-162
Keyword(s):
AbstractIn this paper we propose an efficient multivariate encryption scheme based on permutation polynomials over finite fields. We single out a commutative group ℒ(q, m) of permutation polynomials over the finite field Fqm. We construct a trapdoor function for the cryptosystem using polynomials in ℒ(2, m), where m =2k for some k ≥ 0. The complexity of encryption in our public key cryptosystem is O(m3) multiplications which is equivalent to other multivariate public key cryptosystems. For decryption only left cyclic shifts, permutation of bits and xor operations are used. It uses at most 5m2+3m – 4 left cyclic shifts, 5m2 +3m + 4 xor operations and 7 permutations on bits for decryption.
2013 ◽
Vol 303-306
◽
pp. 1944-1947
Keyword(s):
2017 ◽
Vol E100.A
(1)
◽
pp. 18-25
◽
Keyword(s):
2021 ◽
Vol 10
(11)
◽
pp. 3439-3447
Keyword(s):
Keyword(s):