[PDF] Top 20 On permutation polynomials over finite fields
Has 10000 "On permutation polynomials over finite fields" found on our website. Below are the top 20 most common "On permutation polynomials over finite fields".
On permutation polynomials over finite fields
... SCHMIDT, W.M., Equations Over Finite Fields, An Elementary Approach, Springer Lecture Notes, 536 1976..[r] ... See full document
9
Several Classes of Permutation Polynomials over Finite Fields
... of finite prime fields and by Dickson [4] for arbitrary finite ...fields. Permutation polynomials have been studied extensively and have important applications in coding theory, ... See full document
7
On some permutation polynomials over finite fields
... Permutation binomials and the sequence {an } The main tool in the proof of Theorem 1.1 is the following well-known theorem of Hermite [3, Theorem 7.4].. Theorem 3.1 Hermite’s criterion.[r] ... See full document
10
A Preliminary Investigation into the Mediating Role of Positive Affect in the Development of Posttraumatic Stress Disorder among African American Female Sexual Assault Survivors
... functions over finite fields are a major tool in computer science and electrical engineering and have a long ...and permutation polynomials are described in this ...compatible ... See full document
51
Galois Groups of Polynomials and the Construction of Finite Fields
... of polynomials of small degree was explored in [1], their general solutions were found which allow for the application of Galois ideas to analyse their splitting ...these polynomials (of degree less than or ... See full document
7
Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-channel Countermeasures
... S-boxes. Their method requires 7 non-linear multiplications. The method in [RV13] is based on the Divide-and-Conquer strategy, which is an adaptation of a polynomial evaluation technique by Paterson and Stockmeyer ... See full document
20
A new public key system based on Polynomials over finite fields GF(2)
... Public-key cryptography started in 1976 with publication of pioneering work of Diffie and Hell- man [1] called DH key exchange and in 1978 with another fundamental work by Rivest, Shamir and Adleman [2], called RSA ... See full document
5
Extension fields and Galois Theory
... Finite fields are used in application of coding theory, many codes are Constructed as subspaces of vector spaces over finite fields ...Equations over finite fields ... See full document
7
On Polynomials of the Form xrf(x(q−1)/l)
... The main result of this paper was presented by Qiang Wang in BIRS Workshop on Poly- nomials over Finite Fields and Applications in November 2006. The second author wants to thank BIRS for the ... See full document
7
Cubic surfaces over finite fields
... defined over a field K are isomorphic over K involves testing for equivalence of cubic polynomials in four variables defined over K under an action of K ∗ × GL(4, K); K ∗ acts by scaling and ... See full document
104
P R O FI L E S OFLARGE COM BINATORIAL STRUCTURES
... of polynomials in finite fields, connected components of certain forests, prime factor- izations of integers, and a variety of other combinatorial objects have a number of components which is ... See full document
262
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
... We remark that it is not known today 2 how to deterministically produce (without the aid of advice or randomness) even a single irreducible polynomial of degree n in time poly(n log q) for all choices of n and q. Our ... See full document
27
Some Problems Concerning Polynomials over Finite Fields, or Algebraic Divertissements
... functions over finite ...their finite difference in every nonzero direction is a permutation polynomial of the ...of polynomials satisfying these properties: in [RS89], [Joh87], [Hir89] ... See full document
106
A theory of permutation polynomials using compositional attractors
... Unlike other permutation polynomial groups, enumeration of the permutation polynomials of a finite F-algebra comprising a direct product of finite field is best done by computing t h e i[r] ... See full document
97
A new approach in building parallel finite field multipliers
... polynomial arithmetic and irreducible polynomials, extension fields exist for finite fields.. as well.[r] ... See full document
102
Properties of sparse random matrices over finite fields
... The key point, which is the calculation of the quenched entropy, was carried out in a set up that allows for further generalisations of the constraints enforced in defining the classes of matrices over which the ... See full document
19
A Versatile Multi-Input Multiplier over Finite Fields
... multiplication over GF (2 n ) show that multipli- cation with table look-up is faster than multiplication with polynomial basis when field size is small and multiplication with polynomial basis is faster than ... See full document
8
Permutation polynomials in one and several variables
... Chapter 2 gives the fundamental concepts of a permutation polynomial and an orthogonal system.The cyclic and Dickson polynomials are defined and permutation properties of Chebyshev polyn[r] ... See full document
129
A Study on Construction of the Advanced Sequential Circuit over Finite Fields
... Unlike the combinational logic circuit implementation, the conventional sequential logic circuit must be considered current and next state. To this end, the next state function had to be derived. To implement this in a ... See full document
6
On the matrix equation Xn=B over finite fields
... In this paper, we consider the problem of determining the number N Nn,m,B of the n-th roots in M of a given matrix.. Our present work generalizes a recent paper of the authors [1] in whi[r] ... See full document
6
Related subjects