Results 81 to 90 of about 7,538,990 (210)

Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security

Journal of Sensor and Actuator Networks
Wireless Sensor Network (WSN) technology has constrained computing resources that require efficient and low-cost cryptographic hardware to provide security services, particularly when dealing with large modular polynomial multiplication in cryptography ...
Fariha Haroon, Hua Li
doaj   +1 more source

Characterization of image sets: the Galois Lattice approach [PDF]

, 2003
This paper presents a new method for supervised image classification. One or several landmarks are attached to each class, with the intention of characterizing it and discriminating it from the other classes.
Samuelides, Manuel, Zenou, Emmanuel, Manuel Samuelides, Emmanuel Zenou   +3 more
core  

Format-preserving encryption algorithm based on dynamic galois field

Dianxin kexue
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  

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  

A Novel Image Encryption Technique Based on Cyclic Codes over Galois Field. [PDF]

Comput Intell Neurosci, 2022
Asif M, Asamoah JKK, Hazzazi MM, Alharbi AR, Ashraf MU, Alghamdi AM, Alghamdi AM.   +6 more
europepmc   +1 more source

CONSTRUCTION OF SUBSTITUTION BOX (S-BOX) BASED ON IRREDUCIBLE POLYNOMIALS ON GF(2^8)

Barekeng
In the field of modern encryption algorithms, the creation of S-Box is an essential element that plays an important role in maintaining data security in various industries.
Faldy Tita, Adi Setiawan, Bambang Susanto   +2 more
doaj   +1 more source

The unit group of algebra of circulant matrices [PDF]

International Journal of Group Theory, 2014
Let $Cr_{n}(F)$ denote the algebra of $n times n$ circulant matrices over the field $F$. In this paper, we study the unit group of $Cr_{n}(F_{p^m})$, where $F_{p^m}$ denotes the Galois field of order $p^{m}$, $p$ prime.
Neha Makhijani , 2R. K. Sharma, J. B. Srivastava   +2 more
doaj  

Practice of the Incomplete $p$-Ramification Over a Number Field -- History of Abelian $p$-Ramification

Communications in Advanced Mathematical Sciences, 2019
The theory of $p$-ramification, regarding the Galois group of the maximal pro-$p$-extension of a number field $K$, unramified outside $p$ and $\infty$, is well known including numerical experiments with PARI/GP programs.
Georges Gras
doaj   +1 more source

Algorithm for Obtaining Complete Irreducible Polynomials over Given Galois Field for New Method of Digital Monitoring of Information Space

Computers
Irreducible polynomials are widely used in modern cryptography; however, algorithms for finding such polynomials remain quite complex and require significant computational resources.
Dina Shaltykova, Aliya Massalimova, Yelizaveta Vitulyova, Ibragim Suleimenov   +3 more
doaj   +1 more source

Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q).

, 2017
Searching for Monic Irreducible Polynomials (IPs) over extended Galois Field GF(p^q) for large value of prime moduli p and extension to Galois Field q is a well needed solution in the field of Cryptography.
Sankhanil Dey, Ranjan Ghosh
core   +1 more source