Results 31 to 40 of about 8,727,877 (287)
Arithmetic in a finite field [PDF]
An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over Zp is exploited to reduce the storage and computation requirements of the algorithm.
openaire +1 more source
The Hartley transform in a finite field [PDF]
7 pages, IEEE/SBT International Telecommunication Symposium, ITS, 1998, Sao Paulo ...
Ricardo M. Campello de Souza +2 more
openaire +4 more sources
Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
In 2006, Hubert, Mauduit and Sárközy extended the notion of binary sequences to n-dimensional binary lattices and introduced the measures of pseudorandomness of binary lattices.
Chen Xiaolin
doaj +1 more source
Mayfly optimistic hyperelliptic curve cryptosystem
Various applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage.
Ramireddy Nava Teja Reddy +7 more
doaj +1 more source
Computing character degrees via a Galois connection [PDF]
In a previous paper, the second author established that, given finite fields ...
Mark L. Lewis , John K. McVey
doaj
On the Orders of the Elements of a Square Extension of a Finite Field of Characteristic 2
Let F(2m) will be an arbitrary finite field of characteristic 2. It’s square extension will be considered as an algebra with basiс elements 1 and e over the field F(2m).
Valery Maximov, Victoria Remezova
doaj +1 more source
FINITE UNDECIDABILITY IN NIP FIELDS
AbstractA field K in a ring language $\mathcal {L}$ is finitely undecidable if $\mbox {Cons}(T)$ is undecidable for every nonempty finite $T \subseteq {\mathtt{Th}}(K; \mathcal {L})$ . We extend a construction of Ziegler and (among other results) use a first-order classification of Anscombe and Jahnke to prove every NIP henselian nontrivially ...
openaire +1 more source
New Constructions of Complete Permutation Polynomials over Finite Fields of Even Characteristic
Complete permutation polynomials have many applications in mathematics and cryptography. In this paper, we study the complete permutation property of polynomial xh(xq−1)q+1 over Fq2, where h(x)=h1(x+xq)+h2(x+xq)xk.
Jian Li, Zhengbang Zha, Ziran Tu
doaj +1 more source
Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure +3 more
wiley +1 more source
Practical analysis of 3-D dynamic nonlinear magnetic field using time-periodic finite element method [PDF]
A practical 3-D finite element method using edge elements for analyzing stationary nonlinear magnetic fields with eddy currents in electric apparatus, in which the flux interlinking the voltage winding is given, has been proposed.
Nakata, Takayoshi +5 more
core +1 more source

