One-stroke polynomials over a ring of modulo $2^w$
暂无分享,去创建一个
Permutation polynomials over a ring of modulo $2^w$ are compatible with digital computers and digital signal processors, and so they are in particular expected to be useful for cryptography and pseudo random number generator. In general, the period of the polynomial should be long in such fields. In this paper, we derive the necessary and sufficient condition which specify one-stroke polynomials which are permutation polynomials whose periods are maximized.
[1] R. Rivest. Permutation Polynomials Modulo 2w , 2001 .
[2] Ken Umeno,et al. Three theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module $$2^w$$2w , 2016, 1602.08238.
[3] Ken Umeno,et al. Improving security of Vector Stream Cipher , 2016 .
[4] David Thomas,et al. The Art in Computer Programming , 2001 .