Algorithms for Exponentiation in Finite Fields
- 1 June 2000
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 29 (6), 879-889
- https://doi.org/10.1006/jsco.1999.0309
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An implementation of elliptic curve cryptosystems over F/sub 2/155IEEE Journal on Selected Areas in Communications, 1993
- On fast multiplication of polynomials over arbitrary algebrasActa Informatica, 1991
- An implementation for a fast public-key cryptosystemJournal of Cryptology, 1991
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Low complexity normal basesDiscrete Applied Mathematics, 1989
- On arithmetical algorithms over finite fieldsJournal of Combinatorial Theory, Series A, 1989
- Factoring with cyclotomic polynomialsMathematics of Computation, 1989
- Fast Exponentiation in GF(2n)Lecture Notes in Computer Science, 1988
- Bit-serial Reed - Solomon encodersIEEE Transactions on Information Theory, 1982
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978