Results 21 to 30 of about 176,423 (294)
Some Multisecret-Sharing Schemes over Finite Fields
Mathematics, 2020 A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot.
Selda Çalkavur, Patrick Solé
doaj +1 more source
Computing character degrees via a Galois connection [PDF]
International Journal of Group Theory, 2015 In a previous paper, the second author established that, given finite fields ...
Mark L. Lewis , John K. McVey
doaj
Unit groups of finite group algebras of Abelian groups of order 17 to 20
AIMS Mathematics, 2021 Let $ F $ be a finite field of characteristic $ p $ having $ q = p^n $ elements and $ G $ be an abelian group. In this paper, we determine the structure of the group of units of the group algebra $ FG $, where $ G $ is an abelian group of order $ 17\leq |
Yunpeng Bai , Yuanlin Li, Jiangtao Peng
doaj +1 more source
The recurrence formula for the number of solutions of a equation in finite field
AIMS Mathematics, 2021 The main purpose of this paper is using analytic methods to give a recurrence formula of the number of solutions of an equation over finite field. We use analytic methods to give a recurrence formula for the number of solutions of the above equation. And
Yanbo Song
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. A primitive normal polynomial is used to simplify the calculation of multiplicative inverses.
openaire +2 more sources
Finite fields and cryptology [PDF]
Computer Science Journal of Moldova, 2003 The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj
The complexity of pseudo-Kronecker and free-Kronecker forms of functions over finite fields
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 An approach enabling partial generalization of the Green–Sasao hierarchy for polynomial forms of Boolean functions to the case of an arbitrary finite field was introduced.
A.S. Baliuk
doaj +1 more source
The Finite Field Kakeya Problem [PDF]
, 2008 A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds for n greater than 4.
BLOKHUIS A., MAZZOCCA, Francesco
openaire +5 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 ...
R.M. Campello de Souza +2 more
openaire +4 more sources
Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields
Special Matrices, 2021 The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix B ∈ 𝔽n×n is defined as ℓ1ℓ2· · · ℓn, where ℓj ∈ {A, S, N} according to whether all, some but not all, or none of the principal minors of order j of B are nonzero ...
Dukes Peter J., Martínez-Rivera Xavier
doaj +1 more source