Answers are grounded in this paper and cite their sources.
This paper discusses various ways to use permutation polynomials, defined on a finite field and more generally rational permutation functions, to construct cryptographic systems of a general mathematical nature. (Author)
No takes yet. Share an insight, caveat, or question.
Levine et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: