Name
Abstract | ||
|---|---|---|
Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all PPs of degree ≤ 6 over finite fields Fq for all q and the inverses of all PPs of degree 7 over F2(n). The explicit inverse of a class of fifth degree PPs is the... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TIT.2019.2939113 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Ciphers,Computer science,Information theory,Licenses,Silicon,Galois fields | Discrete mathematics,Inverse,Finite field,Polynomial,Permutation,Coding theory,Combinatorial design,Binomial coefficient,Congruence relation,Mathematics | Journal |
Volume | Issue | ISSN |
66 | 2 | 0018-9448 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanbin Zheng | 1 | 3 | 2.80 |
| Qiang Wang | 2 | 237 | 37.93 |
| Wenhong Wei | 3 | 93 | 14.13 |