Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,758 papers from all fields of science
Search
Sign In
Create Free Account
Normal basis
Known as:
Normal
, Normal basis theorem
, Primitive normal basis
Expand
In mathematics, a normal basis in field theory is a special kind of basis for Galois extensions of finite degree, characterised as forming a single…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Basis (linear algebra)
Cryptography
Cyclotomic fast Fourier transform
ECC patents
Expand
Broader (1)
Linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Smartphone-Based Measurement of Acceleration: Development of a Smart- phone Application for Use in an Engineering Dynamics Course
S. Bevill
,
K. Bevill
2015
Corpus ID: 113469518
There is an increasing trend towards use of smartphones as mobile computing devices, and engineering education should stay…
Expand
2014
2014
GF(2n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
Xi Xiong
,
H. Fan
IACR Cryptology ePrint Archive
2014
Corpus ID: 15537760
Explicit formulae and complexities of bit-parallel GF(2 n ) squarers for a new class of irreducible pentanomials x n + x n-1…
Expand
2012
2012
Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
Chiou-Yng Lee
,
C. Chiou
Journal of Signal Processing Systems
2012
Corpus ID: 29299979
This work presents a novel scalable multiplication algorithm for a type-t Gaussian normal basis (GNB) of GF(2m). Utilizing the…
Expand
2007
2007
Finite field arithmetic using quasi-normal bases
C. Nègre
Finite Fields Their Appl.
2007
Corpus ID: 30227402
2007
2007
Low-Latency Factorization Architecture for Algebraic Soft-Decision Decoding of Reed–Solomon Codes
Jun Ma
,
A. Vardy
,
Zhongfeng Wang
IEEE Transactions on Very Large Scale Integration…
2007
Corpus ID: 8136382
Bivariate polynomial factorization is an important stage of algebraic soft-decision decoding of Reed-Solomon (RS) codes and…
Expand
2004
2004
Efficient digit-serial normal basis multipliers over binary extension fields
A. Reyhani-Masoleh
,
M. A. Hasan
TECS
2004
Corpus ID: 12430325
In this article, two digit-serial architectures for normal basis multipliers over (GF(2m)) are presented. These two structures…
Expand
2003
2003
A low complexity and a low latency bit parallel systolic multiplier over GF(2/sup m/) using an optimal normal basis of type II
Soonhak Kwon
Proceedings 16th IEEE Symposium on Computer…
2003
Corpus ID: 16237603
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF(2/sup m…
Expand
1997
1997
Fast software exponentiation in GF(2/sup k/)
Ç. Koç
,
T. Acar
Proceedings 13th IEEE Sympsoium on Computer…
1997
Corpus ID: 5754683
The authors present a new algorithm for computing a/sup e/ where a/spl isin/GF(2/sup k/) and e is a positive integer. The…
Expand
Highly Cited
1992
Highly Cited
1992
Optimal normal bases
Shuhong Gao
,
H. Lenstra
Des. Codes Cryptogr.
1992
Corpus ID: 13088841
Let K ⊂ L be a finite Galois extension of fields, of degree n. Let G be the Galois group, and let (<α)<∈G be a normal basis for L…
Expand
1990
1990
Low complexity normal bases for F2mn
G. Séguin
Discrete Applied Mathematics
1990
Corpus ID: 20843788
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE