scholarly journals Cycle types of complete mappings of finite fields

2021 ◽  
Author(s):  
Alexander Bors ◽  
Qiang Wang
Keyword(s):  
Finite Fields ◽  
Complete Mappings

scholarly journals Complete mappings of finite fields

1982 ◽  
Vol 33 (2) ◽  
pp. 197-212 ◽  
Author(s):  
Harald Niederreiter ◽  
Karl H. Robinson
Keyword(s):  
Finite Fields ◽  
Special Class ◽  
Small Degree ◽  
Permutation Polynomials ◽  
Complete Mapping ◽  
Complete Mappings

AbstractWe discuss complete mapping polynomials of finite fields, which are a special class of permutation polynomials. Complete mapping polynomials of small degree are classified. Results are obtained on a class of complete mapping binomials and on permutation binomials.

scholarly journals Compositional inverses and complete mappings over finite fields

2017 ◽  
Vol 217 ◽  
pp. 318-329 ◽  
Author(s):  
Aleksandr Tuxanidy ◽  
Qiang Wang
Keyword(s):  
Finite Fields ◽  
Complete Mappings

Dickson Polynomials Over Finite Fields and Complete Mappings

1987 ◽  
Vol 30 (1) ◽  
pp. 19-27 ◽  
Author(s):  
Gary L. Mullen ◽  
Harald Niederreiter
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Permutation Polynomials ◽  
Dickson Polynomials ◽  
Complete Mapping ◽  
Dickson Polynomial ◽  
Special Cases ◽  
Polynomials Over Finite Fields ◽  
Complete Mappings ◽  
Special Case

AbstractDickson polynomials over finite fields are familiar examples of permutation polynomials, i.e. of polynomials for which the corresponding polynomial mapping is a permutation of the finite field. We prove that a Dickson polynomial can be a complete mapping polynomial only in some special cases. Complete mapping polynomials are of interest in combinatorics and are defined as polynomials f(x) over a finite field for which both f(x) and f(x) + x are permutation polynomials. Our result also verifies a special case of a conjecture of Chowla and Zassenhaus on permutation polynomials.

Finite Fields

1996 ◽  
Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  
Finite Fields

Maximum Distance Separable Hankel Rhotrices over Finite Fields

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

Notes on three-pass protocol

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl
Keyword(s):  
Finite Fields ◽  
Matrix Algebras ◽  
Associative Structures

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.

Sign in / Sign up

Export Citation Format

Share Document