Results 11 to 20 of about 8,727,877 (287)
Finite fields and cryptology [PDF]
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
This work studies consensus networks over finite fields, where agents process and communicate values from the set of integers f0; : : : ; p 1g, for some prime number p, and operations are performed modulo p.
Pasqualetti, F. +4 more
core +4 more sources
Finite Element Analysis of Metal Weapons in a Time-domain Transient Magnetic Field [PDF]
A method of secondary magnetic field analysis of metal objects in time-domain transient magnetic field is established by modification of finite element analysis.
Pati, Prasanta, Mather, Peter
core +4 more sources
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
A theorem about linear rank inequalities that depend on the characteristic of the finite field
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]
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
Time-domain Transient Magnetic Field Analysis of Metallic Weapons [PDF]
Metallic weapons in a time varying magnetic field develop eddy currents. A method of identification of field bahaviour and eddy current in metallic weapons is established by the application of finite element analysis in time-domain transient magnetic ...
Pati, Prasanta, Mather, Peter
core +4 more sources
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[ɛ]
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
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

