Permutation polynomials over finite fields from low-degree rational functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912547812147200 |
|---|---|
| author | Garg, Kirpa Hasan, Sartaj Ul Li, Chunlei Kumar, Hridesh Pal, Mohit |
| author_facet | Garg, Kirpa Hasan, Sartaj Ul Li, Chunlei Kumar, Hridesh Pal, Mohit |
| contents | This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six classes of permutation pentanomials over $F_{q^2}$. Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20982 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Permutation polynomials over finite fields from low-degree rational functions Garg, Kirpa Hasan, Sartaj Ul Li, Chunlei Kumar, Hridesh Pal, Mohit Cryptography and Security Number Theory 11T06, 12E20 This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six classes of permutation pentanomials over $F_{q^2}$. Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature. |
| title | Permutation polynomials over finite fields from low-degree rational functions |
| topic | Cryptography and Security Number Theory 11T06, 12E20 |
| url | https://arxiv.org/abs/2503.20982 |