JSIAMLettersVol.pp.1–.PDFVIP

c JSIAM Letters Vol.** (****) pp.1– **** Japan Society for Industrial and Applied Mathematics One-stroke polynomials over a ring of modulo 2w 1 1 Atsushi Iwasaki and Ken Umeno 1 Graduate school of Informatics, Kyoto University, Yoshida-honmachi, Kyoto city, Japan E-mail iwasaki.atsushi.47e@st.kyoto-u.ac.jp Received Abstract Permutation polynomials over a ring of modulo 2w are well adopted to digital computers and 6 digital signal processors, and so they are in particular expected to be useful for cryptography 1 and pseudo random number generators. Since a longer period of the polynomial is demanded 0 in general, we derive a necessary and sufficient condition that polynomials are permutating 2 and their periods are the longest over the ring. We call polynomials which satisfy the condition l “one-stroke polynomials over the ring”. u J Keywords permutation polynomial, modulo 2w , cryptography, pseudo random number gen- 7 erator 2 Research Activity Group Applied Chaos ] T 1. Introduction about permutation polynomials over a ring of modulo I s. A polynomial is called a permutation polynomial over 2w , we should know which polynomials are permuta- c a finite ring R if the polynomial is bijection over R. Al- tion polynomials. The necessary and sufficient condi- [ though R is a fin