Results 61 to 70 of about 464 (180)
A new DNA-based model for finite field arithmetic
A Galois field GF(pn) with p≥2 a prime number and n≥1 is a mathematical structure widely used in Cryptography and Error Correcting Codes Theory. In this paper, we propose a novel DNA-based model for arithmetic over GF(pn).
Iván Jirón +4 more
doaj +1 more source
TORSION GALOIS REPRESENTATIONS OVER CM FIELDS AND HECKE ALGEBRAS IN THE DERIVED CATEGORY
We construct algebras of endomorphisms in the derived category of the cohomology of arithmetic manifolds, which are generated by Hecke operators. We construct Galois representations with coefficients in these Hecke algebras and apply this technique to ...
JAMES NEWTON, JACK A. THORNE
doaj +1 more source
Format-preserving encryption algorithm based on dynamic galois field
Format-preserving encryption (FPE) is characterized by its ability to maintain data format and length post-encryption while adhering to format constraints, rendering it highly applicable for data anonymization purposes. Current FPE schemes are faced with
YUAN Heqing, SHEN Jinshang, WANG Qiang
doaj
On local Galois deformation rings: generalised tori
We study deformation theory of mod p Galois representations of p-adic fields with values in generalised tori, such as L-groups of (possibly non-split) tori.
Vytautas Paškūnas, Julian Quast
doaj +1 more source
CONVEYOR ANALOG OF MATRIX DIFFIE-HELLMAN PROOTOKOL
A variant of the construction of the matrix analog of Diffie-Hellman based on pipelined binary update secret element used to generate the secret key encryption legalized subscribers open network.
A.J. Beletsky, А.А. Beletsky
doaj
LOCAL EXTENSIONS WITH IMPERFECT RESIDUE FIELD
The paper deals with some aspects of general local fields and tries to elucidate some obscure facts. Indeed, several questions remain open, in this domain of research, and literature is getting scarce.
Akram Lbekkouri
doaj +1 more source
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS) with a maximum length with acceptable statistical characteristics.
A. Beletsky, E. Beletsky
doaj
Irreducible polynomials are widely used in modern cryptography; however, algorithms for finding such polynomials remain quite complex and require significant computational resources.
Dina Shaltykova +3 more
doaj +1 more source
Quasifinite fields of prescribed characteristic and Diophantine dimension
Let ℙ be the set of prime numbers, ℙ the union ℙ ∪ {0}, and for any field E, let char(E) be its characteristic, ddim(E) the Diophantine dimension of E, 𝒢E the absolute Galois group of E, and cd(𝒢E) the Galois cohomological dimension 𝒢E.
Chipchakov Ivan D., Paunov Boyan B.
doaj +1 more source
Ricerche di matematica con Giuseppina Varone
In memory of the researcher Pina Varone, I present the research carried out together for over 20 years. Some relevant issues and applicants were: the connection between teaching and research, and as an in-depth teaching emerge new research topics; the ...
Antonio Maturo
doaj

