Skip to search formSkip to main contentSkip to account menu

Permutation polynomial

Known as: Permutation polynomials, Schur's conjecture 
In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, i.e. the map is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Chebyshev polynomialsDickson polynomialError detection and correctionForward error correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the Tu-Zeng permutation trinomial of type (1∕4, 3∕4)
2015
2015
Grid Intersection Graphs and Order Dimension
We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height… 
2015
2015
On Secrecy Capacity of Minimum Storage Regenerating Codes
In this paper, we revisit the problem of characterizing the secrecy capacity of minimum storage regenerating (MSR) codes under… 
2014
2014
A note on complete polynomials over finite fields and their applications in cryptography
Highly Cited
2014
Highly Cited
2014
Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
In this paper we pick up an old challenge to design public key or white-box constructions from symmetric cipher components. We… 
Highly Cited
2013
Highly Cited
2013
Determination of a type of permutation binomials over finite fields
Highly Cited
2011
Highly Cited
2011
Efficient hardware implementation of a highly-parallel 3GPP LTE/LTE-advance turbo decoder
2009
2009
Permutation Polynomials Modulo n, n 6= 2w and Latin Squares
Our work is motivated by a recent paper of Rivest [6], concerning permutation polynomials over the rings Zn with n = 2w… 
2005
2005
Permutation Polynomials modulo m
This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients… 
Highly Cited
1987
Highly Cited
1987
On permutation polynomials over finite fields
A polynomial f over a finite field F is called a permutat,on poIFnomial if the mapping F F defined by f is one-to-one. In this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)