Results 31 to 40 of about 503 (178)
NONLINEAR NYBERG CONSTRUCTION TRANSFORMS OVER ISOMORPHIC REPRESENTATIONS OF FIELDS GALOIS
Further development of cryptographic algorithms based on the principles of many-valued logic requires more accurate research of non-binary cryptographic primitives – S-boxes.
A. V. Sokolov, O. N. Zhdanov
doaj +1 more source
Abelian number fields with frobenian conditions
Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
Discrete Cartesian Coordinate Transformations: Using Algebraic Extension Methods
It is shown that it is reasonable to use Galois fields, including those obtained by algebraic extensions, to describe the position of a point in a discrete Cartesian coordinate system in many cases. This approach is applicable to any problem in which the
Aruzhan Kadyrzhan +3 more
doaj +1 more source
A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations
This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation.
Bardis Nikolaos G. +2 more
doaj +1 more source
On the Existential Theory of the Completions of a Global Field
ABSTRACT We discuss the common existential theory of all or almost all completions of a global function field.
Philip Dittmann, Arno Fehm
wiley +1 more source
Quadratic subfields on quartic extensions of local fields
We show that any quartic extension of a local field of odd residue characteristic must contain an intermediate field. A consequence of this is that local fields of odd residue characteristic do not have extensions with Galois group A4 or S4 ...
Joe Repka
doaj +1 more source
When using a discrete Fourier transform (DFT) to solve digital signal processing (DSP) problems, errors occur in rounding or truncating the results of operations to the word length used by specialized processors (SP).
M. I. Kalmykov +3 more
doaj +1 more source
Modular analogs of character formulas and minimal lifts of modular forms
Abstract If f$f$ is a mod‐3 eigenform of weight 2 and level Γ0(ℓ2)$\Gamma _0(\ell ^2)$ for a prime ℓ$\ell$ such that ℓ≡−1(mod3)$\ell \equiv -1 \pmod {3}$, and ℓ$\ell$ is a vexing prime for f$f$, we show that there is no obstruction to finding a minimal lift of f$f$, but that there is an obstruction to finding a nonminimal lift.
Patrick B. Allen, Preston Wake
wiley +1 more source
First, we will give all necessary definitions and theorems. Then the definition of a Hilbert sequence by using a Galois group is introduced. Then by using the Hilbert sequence, we will build tower fields for extension K/k, where K=k(d1,d2) and k=Q for ...
M. Haghighi, J. Miller
doaj +1 more source
Quantum Information: A Brief Overview and Some Mathematical Aspects
The aim of the present paper is twofold. First, to give the main ideas behind quantum computing and quantum information, a field based on quantum-mechanical phenomena. Therefore, a short review is devoted to (i) quantum bits or qubits (and more generally
Maurice R. Kibler
doaj +1 more source

