T. Beth
- 1.D.W.Ash, I.F.Blake, S.A.Vanstone: Low Complexity Normal Bases; Discrete applied mathematics 25, pp.191-210, 1989. Google Scholar
Digital Library
- 2.E.Bach, j.Shallit: Factoring with cyclotomic polynomials; Mathematics of Computation 52, pp.201-219, 1989.Google ScholarCross Ref
- 3.J.v.z.Gathen, M.Giesbrecht: Constructing normal bases in finite fields; J.Symbolic Computation, Vol 10, S.547-570, 1990. Google ScholarDigital Library
- 4.W.Geiselmann, D.Gollmann: Symmetry and Duality in Normal Basis Multiplication; in Proc. AAECC-6, Springer LNCS 357, S.230- 238, 1989. Google ScholarDigital Library
- 5.J.C.Lagarias, H.L.Montgomery, A.M.Odlyzko: A Bound for the Least Prime Ideal in the Chebotarv Density Theorem; Inventions mathematicae 54, pp.271-296, 1979.Google Scholar
- 6.R.Lidl, H.Niederreiter: Introduction of Finite Fields and their Applications; Cambridge University Press~ 1986. Google ScholarDigital Library
- 7.J.L.Massey, J.K.Omura: Computational method and apparatus for finite field arithmetic; U.S.Patent application, submitted 1981.Google Scholar
- 8.F. Meyer: Normalbasismultiplikation in endlichen KSrpern; Diplomarbeit, University of Karlsruhe, 1990.Google Scholar
- 9.R.C.Mullin, I.M. Onyszchuk, S.A.Vanstone, R.M.Wilson: Optimal Normal Bases in GF(p~); Discrete applied mathematics 22, pp.149-161, 1988/89. Google ScholarDigital Library
Index Terms
- Finding (good) normal bases in finite fields
Recommendations
Representable good EQ-algebras
Recently, a special algebra called EQ-algebra (we call it here commutative EQ-algebra since its multiplication is assumed to be commutative) has been introduced by Novák (Proceedings of the Czech-Japan seminar, ninth meeting, Kitakyushu and Nagasaki,...
Gröbner Bases in Orders of Algebraic Number Fields
We prove that any orderOof any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-orderingO, defining a division algorithm, and demonstrating how to use it in a ...
Criteria for Finite Difference Gröbner Bases of Normal Binomial Difference Ideals
ISSAC '17: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic ComputationIn this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y to have finite difference Gröbner bases and an algorithm to compute the finite difference Gröbner bases if these ...
Comments