Results 11 to 20 of about 89,096 (260)
On Some Computational and Applications of Finite Fields
Ratio Mathematica, 2020 Finite field is a wide topic in mathematics. Consequently, none can talk about the whole contents of finite fields. That is why this research focuses on small content of finite fields such as polynomials computational, ring of integers modulo p where p ...
Jean Pierre Muhirwa
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
Discrete logarithm problem in matrix
Lietuvos Matematikos Rinkinys, 2023 In this paper the discrete logarithm problem in matrix in finite fields is formulated, possible ways of solution are given.
Povilas Tvarijonas +2 more
doaj +3 more sources
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 +3 more sources
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
IEEE Access, 2020 Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on
Hong-Li Wang, Gang Wang, You Gao
doaj +1 more source
Matrix powers over finite fields
International Journal of Mathematics and Mathematical Sciences, 1992 Let GF(q) denote the finite field of order q=pe with p odd. Let M denote the ring of 2×2 matrices with entries in GF(q). Let n denote a divisor of q−1 and assume 2≤n and 4 does not divide n.
Maria T. Acosta-De-Orozco +1 more
doaj +1 more source
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
Computation with finite fields
Information and Control, 1963 A technique for systematically generating representations of finite fields is presented. Relations which must be physically realized in order to implement a parallel arithmetic unit to add, multiply, and divide elements of finite fields of 2n elements are obtained.
Thomas C. Bartee, David I. Schneider
openaire +1 more source