See this document in CiteSeerX!

Normal Bases over Finite Fields (1993)  (Make Corrections)  (2 citations)
Shuhong Gao



  Home/Search   Context   Related

 
View or download:
clemson.edu/faculty/Gao/...thesis.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  clemson.edu/faculty/Gao/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Interest in normal bases over finite fields stems both from mathematical theory and practical applications. There has been a lot of literature dealing with various properties of normal bases (for finite fields and for Galois extension of arbitrary fields). The advantage of using normal bases to represent finite fields was noted by Hensel in 1888. With the introduction of optimal normal bases, large finite fields, that can be used in secure and e#cient implementation of several cryptosystems,... (Update)

Cited by:   More
Hardware and Software Normal Basis Arithmetic for Pairing.. - Granger, Page, Stam (2004)   (Correct)
On Small Characteristic Algebraic Tori in Pairing-Based.. - Granger, Page, Stam (2004)   (Correct)

Similar documents (at the sentence level):
5.3%:   Normal and Self-dual Normal Bases from Factorization of cx - Ian Blake Department (1992)   (Correct)

Active bibliography (related documents):   More   All
4.6:   Specific Irreducible Polynomials with Linearly Independent.. - Blake, Gao   (Correct)
2.3:   Open Problems And Conjectures In Finite Fields - Mullen, Shparlinski (1996)   (Correct)
2.3:   Finite Fields in AXIOM - Grabmeier, Scheerhorn   (Correct)

Similar documents based on text:   More   All
1.2:   Optimal Normal Bases - Gao, Lenstra, Jr. (1992)   (Correct)
0.7:   On Orders of Optimal Normal Basis Generators - Gao, Vanstone (1995)   (Correct)
0.4:   Algorithms for Exponentiation in Finite Fields - Gao, Gathen, Panario, al. (2000)   (Correct)

Related documents from co-citation:   More   All
2:   The Arithmetic of Elliptic Curves (context) - Silverman - 1986
2:   Cryptosystems based on pairings (context) - Sakai, Ohgishi et al. - 2001
2:   High-Speed software multiplication in F 2 m - Lopez, Dahab - 2000

BibTeX entry:   (Update)

S. Gao. Normal Bases over Finite Fields. PhD Thesis, Waterloo University, 1993. http://citeseer.ist.psu.edu/gao93normal.html   More

@misc{ gao93normal,
  author = "S. Gao",
  title = "Normal Bases over Finite Fields",
  text = "S. Gao. Normal Bases over Finite Fields. PhD Thesis, Waterloo University,
    1993.",
  year = "1993",
  url = "citeseer.ist.psu.edu/gao93normal.html" }
Citations (may not include all citations):
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
860   The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1977
635   New directions in cryptography - Diffie, Hellman - 1976  ACM
601   A public key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985  ACM   DBLP
182   Algebraic Coding Theory (context) - Berlekamp - 1968  ACM
145   Introduction to Finite Fields and their Applications (context) - Lidl, Niederreiter - 1986  ACM
86   Finite Fields (context) - Lidl, Niederreiter - 1983  ACM
64   A Classical Introduction to Modern Number Theory (context) - Ireland, Rosen - 1990
63   Basic Algebra (context) - Jacobson - 1985
58   Introduction to Cyclotomic Fields (context) - Washington - 1982
47   An implementation of elliptic curve cryptosystems over F 2 1.. (context) - Agnew, Mullin et al.
45   Algorithmic Algebraic Number Theory (context) - Pohst, Zassenhaus - 1989
43   Elements of Mathematics (context) - Bourbaki - 1990
39   Finite Fields for Computer Scientists and Engineers (context) - McEliece - 1987
35   New algorithms for finding irreducible polynomials over fini.. - Shoup - 1990  DBLP
34   Kluwer Academic Publishers (context) - Menezes, Blake et al. - 1993
34   Springer-Verlag (context) - Hungerford - 1974
27   Computing Frobenius maps and factoring polynomials - Gathen, Shoup - 1992  ACM   DBLP
24   Elements of Algebra and Algebraic Computing (context) - Lipson - 1981
23   Finding irreducible polynomials over finite fields (context) - Adleman, Lenstra - 1986  ACM   DBLP
23   Searching for primitive roots in finite fields - Shoup - 1992  ACM   DBLP
22   Primality testing and Jacobi sums (context) - Cohen, Lenstra - 1984
20   the deterministic complexity of factoring polynomials over f.. - Shoup - 1990
20   VLSI architectures for computing multiplications and inverse.. (context) - Wang, Truong et al. - 1985
17   Factoring with cyclotomic polynomials (context) - Bach, Shallit - 1989  DBLP
17   Springer-Verlag (context) - van der Waerden, vol - 1966
16   Optimal normal bases - Gao, Lenstra - 1992  ACM   DBLP
15   An implementation for a fast public key cryptosystem (context) - Agnew, Mullin et al. - 1991
15   Finite Fields: Structure and Arithmetics (context) - Jungnickel - 1993
14   Finding isomorphisms between finite fields (context) - Lenstra - 1991
14   Computational method and apparatus for finite field arithmet.. (context) - Massey, Omura - 1986
13   Topics in Number Theory (context) - Leveque - 1956
12   Englewood Cli#s (context) - Hoffman, Kunze et al. - 1971
12   Bit-serial Reed-Solomon encoders (context) - Berlekamp - 1982
11   nd ed (context) - Lang - 1984
10   Low complexity normal bases (context) - Ash, Blake et al. - 1989  ACM
8   On arithmetical algorithms over finite fields (context) - Cantor - 1989  ACM
8   A comparison of VLSI architecture of finite field multiplier.. (context) - Hsu, Truong et al. - 1988  ACM   DBLP
7   A survey of trace forms of algebraic number fields (context) - Conner, Perlis - 1984
6   Contributions to the theory of finite fields (context) - Ore - 1934
6   Constructing normal bases in finite fields - Gathen, Giesbrecht - 1990  ACM   DBLP
6   Pergamon Press (context) - edei - 1967
6   Dickson polynomials and irreducible polynomials over finite .. (context) - Gao, Mullen - 1992
6   Computational method and apparatus for finite field multipli.. (context) - Onyszchuk, Mullin et al. - 1988
5   Lectures on the Complexity of Bilinear Problems (context) - de Groote - 1987  ACM
5   Primitive normal bases for finite fields (context) - Lenstra, Schoof - 1987
5   University of Notre Dame Press (context) - Artin, Theory - 1966
5   Konstruktion von normalbasen (context) - Wassermann - 1990
5   the construction of a primitive normal basis in a finite fie.. (context) - Stepanov, Shparlinskiy - 1990
5   Tables of finite fields (context) - Alanen, Knuth - 1964
4   Zur algebraischen diskreten Fouriertransformation (context) - Beth, Fumy et al. - 1983
4   Improving the time complexity of computation of irreducible .. (context) - Rif, Borrell - 1991
4   A VLSI design for computing exponentiations in GF (2 m ) and.. (context) - Wang, Pei - 1990
4   Fundamental Concepts of Higher Algebra (context) - Albert - 1956
4   Bit-serial multiplication in finite fields (context) - Wang, Blake - 1990
4   Systolic multipliers for finite fields GF (2 m (context) - Yeh, Reed et al. - 1984
4   A general method of synthesizing irreducible polynomials ove.. (context) - Varshamov - 1984
4   VLSI design for exponentiation in GF (2 n (context) - Geiselmann, Gollmann - 1990
4   A VLSI architecture for fast inversion in GF (2 m (context) - Feng - 1989
4   Bases for finite fields and a canonical decomposition for a .. (context) - Pincin - 1989
4   Self-complementary normal bases in finite fields (context) - Lempel, Weinberger - 1988  ACM   DBLP
4   a little but useful algorithm (context) - uneburg - 1985
3   Factorization of symmetric matrices and trace-orthogonal bas.. (context) - Seroussi, Lempel - 1980  DBLP
3   Generalizing the discrete Fourier transform (context) - Beth - 1985
3   A characterization of the extremal distributions of optimal .. (context) - Mullin - 1990  ACM
3   the construction of a normal basis for a finite field (context) - Stepanov, Shparlinskiy - 1987
3   A single-chip VLSI implementation of the discrete exponentia.. (context) - Yiu, Peterson - 1982
3   reine angew (context) - Eisenstein - 1975
3   Normal and self-dual normal bases from factorization of cx q.. - Blake, Gao et al. - 1992
3   Eine Verscharfung des Satzes von der Normalbasis (context) - Blessenohl, Johnsen - 1986
3   Very simple method to find the minimal polynomial of an arbi.. (context) - Gordon - 1976
3   Construction of polynomials irreducible over a finite field .. (context) - Semaev - 1989
2   Search of primitive polynomials over finite fields (context) - Rybowicz - 1990
2   Systolic architectures for multiplication over finite field .. (context) - Diab - 1991
2   Trace- and norm-compatible extensions of finite fields (context) - Scheerhorn - 1992  DBLP
2   Forms in odd degree extensions and self-dual normal bases (context) - Bayer-Fluckiger, Lenstra - 1990
2   Probabilistic construction of normal basis (note (context) - Frandsen - 1991
2   Algorithm to construct normal bases of cyclic number fields (context) - Schlickewei, Stepanov - 1990
2   Normal bases of cyclic fields of prime-power degree (context) - Perlis - 1942
2   Uber die Darstellung der Zahlen eines Gattungsbereiches fur .. (context) - Hensel
2   the construction of irreducible self-reciprocal polynomials .. (context) - Meyn - 1990
2   Supplement zu (context) - Blessenohl - 1990
2   L'invariant de Witt de la forme Tr(x 2 (context) - Serre - 1984
2   Infinite Algebraic Extensions of Finite Fields (context) - Brawley, Schnibben - 1989
2   Note for computing the minimum polynomial of elements in lar.. (context) - Ly - 1989
2   Symmetry and duality in normal basis multiplication (context) - Geiselmann, Gollmann - 1989  ACM   DBLP
2   An algorithm to design finite field multipliers using a self.. (context) - Wang - 1989  ACM   DBLP
2   Irreducible polynomials over finite fields with linearly ind.. (context) - Schwarz - 1988
2   Construction of normal bases in cyclic extensions of a field (context) - Schwarz - 1988
2   Primitive elements and polynomials: existence results (context) - Cohen - 1992
2   Bases for finite fields (context) - Davenport - 1968
1   the complexity of normal bases (context) - Pott - 1992
1   Uber einige von Herrn Dr. Einsentein aufgestellte Lehrsatze (context) - onemann
1   A fast VLSI multiplier for GF (2 m (context) - Scott, Tavares et al. - 1986
1   Low complexity normal bases for F 2 mn (context) - eguin - 1990
1   Self-dual normal bases (context) - Bayer-Fluckiger - 1989
1   A proof of the normal basis theorem (context) - Berger, Reiner - 1975
1   Selbstduale normalbasen uber GF (q (context) - Beth, Geiselmann - 1990
1   Explicit factorization of x 2 k + 1 over F p with prime p # .. (context) - Blake, Gao et al. - 1993
1   Normal bases of finite field GF (2 m (context) - Pei, Wang et al. - 1986
1   On canonical bases for subgroups of an Abelian group (context) - Mann - 1969
1   Explicit formulas for self-complementary normal bases in cer.. (context) - Lempel, Seroussi - 1991
1   Characterization and synthesis of self-complementary normal .. (context) - Lempel - 1988
1   Generation of irreducible polynomials over finite field (context) - Daykin - 1965
1   Matrix factorization over GF (2) and trace-orthogonal bases .. (context) - Lempel - 1975
1   A theorem that GF (2 m ) has no self-complementary normal ba.. (context) - Morii, Imamura - 1984
1   Galoissche Theorie und Darstellungstheorie (context) - Deuring - 1933
1   E#cient bit-serial multiplication and the dicrete-time Wiene.. (context) - Morii, Kasahara et al. - 1989
1   Cours d'Algebre Superieure (context) - Serret
1   The normal basis theorem (context) - Waterhouse - 1979
1   Normal bases for Galois p-extensions of rings (context) - Kreimer - 1977
1   Normalbasis bei Korpen ohne hohere Verzweigung (context) - Noether - 1932
1   Sur la representation exponentielle dans les corps relativem.. (context) - Krasner - 1939
1   Galoiserweiterungen der ordnung p mit normalbasis (context) - Kersten, cek - 1982
1   On normal bases of a finite field (context) - Sidel'nikov - 1988
1   A normal basis theorem for infinite Galois extensions (context) - Lenstra - 1985
1   An iterated quadratic extension of GF (2 (context) - Wiedemann - 1988
1   On bit-serial multiplication and dual bases in GF (2 m (context) - Stinson - 1991
1   Cyclotomy and Di#erence Sets (context) - Storer - 1967
1   Factorization of cx q+1 +dx q -ax- b and normal bases over G.. (context) - Blake, Gao et al. - 1991
1   Orthogonal transform encoding of cyclic codes (context) - Fumy - 1986  ACM   DBLP
1   Also Oeuvres Mathematiques d' Evariste Galois (context) - Galois, Memoires et al. - 1962
1   The determination of optimal normal bases over finite fields (context) - Gao - 1992
1   Groe Primzahlen und Befreundete Zahlen: Uber den Lucas-Test .. (context) - Borho, Buhl et al. - 1983
1   Classes de Stiefel-Whitney de formes quadratques (context) - Kahn - 1984
1   Normal generators of finite fields (context) - Akbik - 1992
1   Generalizations of the normal basis theorem of finite fields (context) - Bshouty, Seroussi - 1990  ACM   DBLP
1   Algebraic algorithms in GF (q (context) - Calmet - 1985
1   La deuxieme classe de Stiefel-Whitney d'une representation r.. (context) - Kahn - 1983
1   Linear mappings and the existence of a normal basis (context) - Artin - 1948
1   A certain linear operator in a Galois field and its applicat.. (context) - Varshamov - 1973
1   Operator substitutions in a Galois field and their applicati.. (context) - Varshamov - 1973
1   Self-dual bases in F q (context) - Geiselmann, Gollmann - 1992
1   the theory of selfdual polynomials over a Galois field (Russ.. (context) - Varshamov, Garakov - 1969
1   the number of self-dual bases of GF (q n ) over GF (q (context) - Jungnickel, Menezes et al. - 1990
1   On primitive and free roots in a finite field (context) - Hachenberger - 1992  DBLP
1   On self-complementary bases of GF (q n ) over GF (q (context) - Imamura - 1983
1   Normal bases and irreducible polynomials in the finite field.. (context) - Wang, Blake et al. - 1990
1   The number of self-complementary bases of a finite field of .. (context) - Imamura - 1988
1   Primitive roots in finite fields (context) - Carlitz - 1952
1   On modular group rings, normal bases, and fixed points (context) - Childs, Orzech - 1981
1   Optimal normal bases over the field of two elements (context) - Lenstra - 1991
1   Trace-orthogonal normal bases (context) - Jungnickel  ACM   DBLP
1   Two classes of finite fields which have no self-complementar.. (context) - Imamura, Morii - 1985
1   A high speed data encryption processor for public key crypto.. (context) - Rosati - 1989

Documents on the same site (http://www.math.clemson.edu/faculty/Gao/):   More
Absolute Irreducibility Of Polynomials Via Newton Polytopes - Gao (1998)   (Correct)
On the Deterministic Complexity of Factoring Polynomials - Gao (1999)   (Correct)
Mathematical Models in Public-Key Cryptology - Brawley, Gao (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC