The Carlitz rank of permutations of finite fields: a survey
From MaRDI portal
Publication:2437320
DOI10.1016/J.JSC.2013.07.004zbMATH Open1332.11106OpenAlexW2077774130MaRDI QIDQ2437320FDOQ2437320
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.07.004
dispersionpseudorandom number generatorspermutation polynomials over finite fieldsCarlitz rankgeneralized van der Corput sequences
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequences, discrepancies and applications
- Good permutations for extreme discrepancy
- Irregularities of distribution, VII
- Discrépances de suites associées à un système de numération (en dimension un)
- Discrépance et diaphonie en dimension un
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Recent Results on Recursive Nonlinear Pseudorandom Number Generators
- On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- On the cycle structure of repeated exponentiation modulo a prime
- On Almost Perfect Nonlinear Permutations
- Predicting nonlinear pseudorandom number generators
- Cryptography and Coding
- Permutations in a finite field
- Interleavers for turbo codes using permutation polynomials over integer rings
- On the distribution of inversive congruential pseudorandom numbers in parts of the period
- Enumerating permutation polynomials over finite fields by degree. II
- Enumerating permutation polynomials over finite fields by degree
- The period lengths of inversive pseudorandom vector generations
- On the distribution and lattice structure of nonlinear congruential pseudorandom numbers
- Attacking the Pollard Generator
- How to predict congruential generators
- The number of permutation polynomials of a given degree over a finite field
- Discrepancy and diaphony of digital (0,1)-sequences in prime base
- On the Carlitz rank of permutation polynomials
- On the cycle structure of permutation polynomials
- A good permutation for one-dimensional diaphony
- Two New Measures for Permutations: Ambiguity and Deficiency
- On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period
- On the distribution of pseudorandom numbers and vectors generated by inversive methods
- Cycle structure of automorphisms of finite cyclic groups
- A lower bound for the diaphony of generalised van der Corput sequences in arbitrary base \(b\)
Cited In (10)
- Permutation polynomials with Carlitz rank 2
- Connecting two types of representations of a permutation of \(\mathbb{F}_q\)
- Irreducible factors of a class of permutation polynomials
- Permutation polynomials and factorization
- Permutations of finite fields with prescribed properties
- On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
- Carlitz rank and index of permutation polynomials
- On the difference between permutation polynomials
- On the boomerang uniformity of permutations of low Carlitz rank
- Complete mappings and Carlitz rank
Uses Software
This page was built for publication: The Carlitz rank of permutations of finite fields: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437320)