Results 31 to 40 of about 330 (178)
Calculation of Fourier-Galois transforms in reduced binary number systems [PDF]
Компьютерная оптика, 2018 The paper proposes a new method for calculating Fourier-Galois transforms (number-theoretical transforms), which are a modular analog of the discrete Fourier transform.
Vladimir Chernov
doaj +1 more source
Suitability of Generalized GAROs on FPGAs as PUFs or TRNGs Considering Spatial Correlations
IEEE Open Journal of the Industrial Electronics Society, 2023 In the last years, guaranteeing the security in Internet of things communications has become an essential task. In this article, the bias of a wide set of oscillators has been studied to determine their suitability as both true random number generators ...
Miguel Garcia-Bosque +4 more
doaj +1 more source
Galois ring isomorphism problem
CoRR, 2020 Recently, Doröz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem. In this paper, we generalize the problem to the case of Galois rings, resulting in the Galois ring isomorphism problem.
openaire +2 more sources
The Galois endomorphism ring of a Galois Azumaya extension
International Journal of Algebra, 2013 Let B be a Galois Azumaya extension of B G with Galois group G; that is, B is a Galois extension of B G with Galois group G which is an Azumaya C G -algebra where C is the center of B. Denote B G by D and the endomorphism ring Hom(DB, DB) of the left D-module endomorphisms of B by Ω.
Xiaolong Jiang, George Szeto
openaire +1 more source
On Azumaya algebras with a finite automorphism group
International Journal of Mathematics and Mathematical Sciences, 2001 Let B be a ring with 1, C the center of B, and G a finite automorphism group of B. It is shown that if B is an Azumaya algebra such that B=⊕∑g∈GJg where Jg={b∈B|bx=g(x)b for all x∈B}, then there exist orthogonal central idempotents {fi∈C|i=1,2,…,m ...
George Szeto, Lianyong Xue
doaj +1 more source
Interactive Proofs for Rounding Arithmetic
IEEE Access, 2022 Interactive proofs are a type of verifiable computing that secures the integrity of computations. The need is increasing as more computations are outsourced to untrusted parties, e.g., cloud computing platforms.
Shuo Chen +3 more
doaj +1 more source
Self-Dual Normal Basis of a Galois Ring
Journal of Mathematics, 2014 Let R′=GR(ps,psml) and R=GR(ps,psm) be two Galois rings. In this paper, we show how to construct normal basis in the extension of Galois rings, and we also define weakly self-dual normal basis and self-dual normal basis for R′ over R, where R′ is ...
Irwansyah +3 more
doaj +1 more source
ON THE IRREDUCIBLE COMPONENTS OF SOME CRYSTALLINE DEFORMATION RINGS
Forum of Mathematics, Sigma, 2020 We adapt a technique of Kisin to construct and study crystalline deformation rings of $G_{K}$ for a finite extension $K/\mathbb{Q}_{p}$. This is done by considering a moduli space of Breuil–Kisin modules, satisfying an additional Galois condition, over ...
ROBIN BARTLETT
doaj +1 more source
Polynomial composites and certain types of fields extensions
Karpatsʹkì Matematičnì Publìkacìï, 2023 In this paper, we consider polynomial composites with the coefficients from $K\subset L$. We already know many properties, but we do not know the answer to the question of whether there is a relationship between composites and field extensions.
Ł. Matysiak
doaj +1 more source
An Innovative Approach to Multi‐Valued Logic
IEEJ Transactions on Electrical and Electronic Engineering, EarlyView.The current generation of computer systems operates on the principles of binary logic, which encompasses both logical and arithmetic operations. However, silicon technology has reached its peak performance, prompting researchers to explore alternative methods for enhancing computational efficiency. One such method is the adoption of Multi‐Valued Logic (
Ali Mokhtari, Peyman Kabiri
wiley +1 more source