Results 61 to 70 of about 2,863 (231)

Smarandache-Galois Fields

open access: yes, 2010
In this paper we study the notion of Smarandache-Galois fields and homomorphism and the Smarandache quotient ring. Galois fields are nothing but fields having only a finite number of elements. We also propose some interesting problems.
openaire   +1 more source

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

open access: yesCommunications 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

A Novel Cipher-Based Data Encryption with Galois Field Theory. [PDF]

open access: yesSensors (Basel), 2023
Hazzazi MM   +3 more
europepmc   +1 more source

Format-preserving encryption algorithm based on dynamic galois field

open access: yesDianxin 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  

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

open access: yesComputers
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

The unit group of algebra of circulant matrices [PDF]

open access: yesInternational 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   +2 more
doaj  

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

open access: yesComput Intell Neurosci, 2022
Asif M   +6 more
europepmc   +1 more source

Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security

open access: yesJournal 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

Galois Field Instructions in the Sandblaster 2.0 Architectrue

open access: yesInternational Journal of Digital Multimedia Broadcasting, 2009
This paper presents a novel approach to implementing multiplication of Galois Fields with 2N. Elements of GF(2N) can be represented as polynomials of degree less than N over GF(2).
Mayan Moudgill   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy