Results 21 to 30 of about 3,043,955 (244)
Proceedings of the American Mathematical Society, 1962 Let \(F^*\) be the multiplicative group of non-zero elements of \(\mathrm{GF}(p^n)\) where \(p\) is a prime; set \(p^n-1 = rs\) where \((r, s) = 1\), \(r < s\) and \(r\not\equiv 1 \bmod p\). \(F^*\) has subgroups \(Y, Z\) of orders \(r, s\) respectively and every element \(\xi\) of \(F^*\) can be expressed uniquely in the form \(\xi = \eta\zeta\) with \
openaire +2 more sources
The radical factors of f(x)−f(y) over finite fields
International Journal of Mathematics and Mathematical Sciences, 1997 Let F denote the finite field of order q For f(x) in F[x], let f*(x,y) denote the substitution polynomial f(x)−f(y). The polynomial f*(x,y) has frequently been used in questions on the values set of f(x) In this paper we consider the irreducible factors ...
Javier Gomez-Calderon
doaj +1 more source
Arithmetic in a finite field [PDF]
Mathematics of Computation, 1980 An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over Zp is exploited to reduce the storage and computation requirements of the algorithm.
openaire +1 more source
Strict avalanche criterion over finite fields
Journal of Mathematical Cryptology, 2007 Boolean functions which satisfy the Strict Avalanche Criterion (SAC) play an important role in the art of information security. In this paper, we extend the concept of SAC to finite fields GF(p).
Li Yuan, Cusick T. W.
doaj +1 more source
The Applications of Algebraic Polynomial Rings in Satellite Coding and Cryptography [PDF]
Mathematics Interdisciplinary Research, 2022 This survey illustrates and investigates the application of polynomial rings over finite fields to generate PRN codes for Global Navigation Satellite System (GNSS) satellites.
Amir Bagheri, Hassan Emami
doaj +1 more source
The Hartley transform in a finite field [PDF]
ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202), 1999 7 pages, IEEE/SBT International Telecommunication Symposium, ITS, 1998, Sao Paulo ...
Ricardo M. Campello de Souza +2 more
openaire +4 more sources
Finite H_v-Fields with Strong-Inverses
Ratio Mathematica, 2017 The largest class of hyperstructures is the class of H v -structures. This is the class of hyperstructures where the equality is replaced by the non-empty intersection.
Theodora Kaplani, Thomas Vougiouklis
doaj +1 more source
On permutation polynomials over finite fields
International Journal of Mathematics and Mathematical Sciences, 1987 A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
THEORETICAL ASSUMPTIONS FOR AN INTRODUCTION TO ELLIPTIC CURVE CRYPTOGRAPHY
STED Journal, 2023 Understanding elliptic curves contributed to solving mathematical problems in number theory that had been unsolved for centuries. Elliptic curves were also used in solving one of the millennial problems, which is Fermat's last theorem.
Ognjen Milivojević, Boris Damjanović
doaj +1 more source
Explicit maximal and minimal curves over finite fields of odd characteristics [PDF]
, 2015 In this work we present explicit classes of maximal and minimal Artin-Schreier type curves over finite fields having odd characteristics. Our results include the proof of Conjecture 5.9 given in [1] as a very special subcase.
Özbudak, Ferruh +2 more
core +1 more source