IEICE TRANSACTIONS on Fundamentals
Permutation Polynomials over Zpn and Their Randomness
Summary :
Permutation polynomials over Zpn are useful in the design of cryptographic algorithms. In this paper, we obtain an equivalent condition for polynomial functions over Zpn to be permutations, and this equivalent condition can help us to analysis the randomness of such functions. Our results provide a method to distinguish permutation polynomials from random functions. We also introduce how to improve the randomness of permutation polynomials over Zpn.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.3 pp.913-915
- Publication Date
- 2017/03/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.913
- Type of Manuscript
- LETTER
- Category
- Information Theory
Authors
Yuyin YU
Guangzhou University
Lishan KE
Guangzhou University
Zhiqiang LIN
Guangzhou University
Qiuyan WANG
Tianjin Polytechnic University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yuyin YU, Lishan KE, Zhiqiang LIN, Qiuyan WANG, "Permutation Polynomials over Zpn and Their Randomness" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 3, pp. 913-915, March 2017, doi: 10.1587/transfun.E100.A.913.
Abstract: Permutation polynomials over Zpn are useful in the design of cryptographic algorithms. In this paper, we obtain an equivalent condition for polynomial functions over Zpn to be permutations, and this equivalent condition can help us to analysis the randomness of such functions. Our results provide a method to distinguish permutation polynomials from random functions. We also introduce how to improve the randomness of permutation polynomials over Zpn.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.913/_p
Copy
@ARTICLE{e100-a_3_913,
author={Yuyin YU, Lishan KE, Zhiqiang LIN, Qiuyan WANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Permutation Polynomials over Zpn and Their Randomness},
year={2017},
volume={E100-A},
number={3},
pages={913-915},
abstract={Permutation polynomials over Zpn are useful in the design of cryptographic algorithms. In this paper, we obtain an equivalent condition for polynomial functions over Zpn to be permutations, and this equivalent condition can help us to analysis the randomness of such functions. Our results provide a method to distinguish permutation polynomials from random functions. We also introduce how to improve the randomness of permutation polynomials over Zpn.},
keywords={},
doi={10.1587/transfun.E100.A.913},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Permutation Polynomials over Zpn and Their Randomness
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 913
EP - 915
AU - Yuyin YU
AU - Lishan KE
AU - Zhiqiang LIN
AU - Qiuyan WANG
PY - 2017
DO - 10.1587/transfun.E100.A.913
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2017
AB - Permutation polynomials over Zpn are useful in the design of cryptographic algorithms. In this paper, we obtain an equivalent condition for polynomial functions over Zpn to be permutations, and this equivalent condition can help us to analysis the randomness of such functions. Our results provide a method to distinguish permutation polynomials from random functions. We also introduce how to improve the randomness of permutation polynomials over Zpn.
ER -
English
