Some computational aspects of root finding in GF(qm)
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 259-270
- https://doi.org/10.1007/3-540-51084-2_24
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1989
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970