A method for generating permutation polynomials modulo p^n

MaRDI QIDQ5148801zbMATH OpenFDO

Authors Rajesh P. Singh

Publication date 5 February 2021

Full work available at URL http://math.colgate.edu/~integers/v3/v3.pdf

zbMATH Keywords

permutation polynomialstriangular mapping

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Recommendations

• scientific article; zbMATH DE number 5846101
• scientific article; zbMATH DE number 822121
• Polynomial functions and permutation polynomials over some finite commutative rings
• scientific article; zbMATH DE number 2092290
• On permutation polynomials in several indeterminates over Z/p^k Z

Cites work

• scientific article; zbMATH DE number 1979303 (Why is no real title available?)
• scientific article; zbMATH DE number 3085205 (Why is no real title available?)
• Interleavers for turbo codes using permutation polynomials over integer rings
• On maximum contention-free interleavers and permutation polynomials over integer rings
• On permutation polynomials over finite fields
• Permutation polynomials and a new public-key encryption
• Permutation polynomials modulo 2w
• Permutation polynomials over finite rings
• Poly-dragon: an efficient multivariate public key cryptosystem
• Polynomial functions (mod m)
• Two congruence identities on ordered partitions

Cited in

(3)

• Further results on complete permutation monomials over finite fields
• scientific article; zbMATH DE number 2092290 (Why is no real title available?)
• A congruence identity on ordered partitions using permutation polynomials

This page was built for publication: A method for generating permutation polynomials modulo \(p^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148801)