Results 11 to 20 of about 176,431 (264)
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 +3 more sources
Information, 2021 Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength.
Jiang Ma +3 more
doaj +1 more source
Classification of Elements in Elliptic Curve Over the Ring 𝔽q[ɛ]
Discussiones Mathematicae - General Algebra and Applications, 2021 Let 𝔽q[ɛ] := 𝔽q [X]/(X4 − X3) be a finite quotient ring where ɛ4 = ɛ3, with 𝔽q is a finite field of order q such that q is a power of a prime number p greater than or equal to 5.
Selikh Bilel +2 more
doaj +1 more source
IACR Transactions on Symmetric Cryptology, 2022 There are many recent results on reverse-engineering (potentially hidden) structure in cryptographic S-boxes. The problem of recovering structure in the other main building block of symmetric cryptographic primitives, namely, the linear layer, has not ...
Christof Beierle +3 more
doaj +1 more source
Elements of high order in finite fields specified by binomials
Karpatsʹkì Matematičnì Publìkacìï, 2022 Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to explicitly construct ...
V. Bovdi, A. Diene, R. Popovych
doaj +1 more source
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
Barekeng, 2021 Kode blok adalah skema penyandian yang menggunakan sistem kode-kode pada suatu lapangan hingga dengan panjang yang sama dan tetap. Kode blok linear atau lebih sering disebut kode linear atas suatu lapangan hingga merupakan himpunan kode-kode blok dengan ...
Juli Loisiana Butar-Butar +1 more
doaj +1 more source
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
A theorem about linear rank inequalities that depend on the characteristic of the finite field
Selecciones Matemáticas, 2022 A linear rank inequality is a linear inequality that holds by dimensions of vector spaces over any finite field. A characteristic-dependent linear rank inequality is also a linear inequality that involves dimensions of vector spaces but this holds over ...
Victor Peña-Macias
doaj +1 more source
Counting Quiver Representations over Finite Fields Via Graph Enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let $\Gamma$ be a quiver on $n$ vertices $v_1, v_2, \ldots , v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\boldsymbol{\alpha} \in \mathbb{N}^n$.
Geir Helleloid +1 more
doaj +1 more source