Algorithms for Exponentiation in Finite Fields

Algorithms for Exponentiation in Finite Fields (2000)

Cached

Download Links

[www.math.clemson.edu]
[www.shoup.net]

Other Repositories/Bibliography

DBLP

by Shuhong Gao , Joachim von zur Gathen , Daniel Panario , Victor Shoup

Venue:	J. SYMB. COMP
Citations:	12 - 2 self

BibTeX

@MISC{Gao00algorithmsfor,
    author = {Shuhong Gao and Joachim von zur Gathen and Daniel Panario and Victor Shoup},
    title = {Algorithms for Exponentiation in Finite Fields},
    year = {2000}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
693	Matrix multiplication via arithmetic progressions - Coppersmith, Winograd - 1990
303	Gaussian elimination is not optimal - STRASSEN - 1969
127	On fast multiplication of polynomials over arbitrary algebras - Cantor, Kaltofen - 1991
116	Modern Computer Algebra - Gathen, Gerhard, et al. - 1999
90	Vanstone,“An implementation of elliptic curve cryptosystems over F2 - Agnew, Mullin, et al.
90	Algorithmic algebraic number theory - Pohst, Zassenhaus - 1989
89	Fast algorithms for manipulating formal power series - Brent, Kung - 1978
64	Schnelle Multiplikation großer Zahlen - Schönhage, Strassen - 1971
61	Fast exponentiation with precomputation - Brickell, Gordon, et al. - 1992
56	Subquadratic-time factoring of polynomials over finite fields - Kaltofen, Shoup - 1998
48	F.: Disquisitiones arithmeticae - Gauss - 1986
42	Computational method and apparatus for finite field arithmetic - Massey, Omura - 1986
40	An implementation for a fast public-key cryptosystem - Agnew, Mullin, et al. - 1991
27	Finding irreducible polynomials over finite fields - Lenstra - 1986
25	R.: Bit-Serial Reed-Solomon Encoders - Berlekamp - 1982
25	Cyclotomy and Difference Sets - Storer - 1967
24	On arithmetical algorithms over finite fields - Cantor - 1989
23	Low complexity normal bases - Ash, Blake, et al. - 1989
21	Optimal normal bases - Gao, Lenstra - 1992
20	Finite Fields: Structure and Arithmetics - Jungnickel - 1993
19	Factoring with cyclotomic polynomials - Bach, Shallit - 1989
12	On orders of optimal normal basis generators - Gao, Vanstone - 1995
9	Some Observations on Parallel Algorithms for Fast Exponentiation - Stinson - 1990
7	Konstruktion von Normalbasen - Wassermann - 1990
6	Self-complementary normal bases in finite fields - Lempel, Weinberger - 1988
6	A high speed data encryption processor for public key cryptography - Rosati - 1989
5	Gauss periods: orders and cryptographical applications - Gao, Gathen, et al. - 1998
5	Irreducible polynomials of given forms - Gao, Howell, et al. - 1999
5	Computational method and apparatus for finite field multiplication - Onyszchuk, Mullin, et al. - 1988
5	Zur Arithmetik in endlichen Körpern - Wassermann - 1993
4	Factoring polynomials over finite fields: asymptotic complexity vs. reality - Shoup - 1993
3	Arithmetic and factorization of polynomials over F2 - Gathen, J, et al. - 1996
3	An algorithm to design finite field multipliers using a self-dual normal basis - Wang - 1989
2	Exponentiation in finite fields: theory and practice - Gathen, Nöcker, et al. - 1997
2	Symmetry and duality in normal basis multiplication - Geiselmann, Gollmann - 1989
2	Factorization of X216091 +X +1 mod2—A problem of Herb Doughty, manuscript - Montgomery - 1991
1	Fast exponentiation in F2 n - Agnew, Mullin, et al. - 1988
1	Ca34c168 data encryption processor, Document 01-34168-500 - Calmos - 1988
1	Efficient and optimal exponentiation in finite fields - Gathen, J - 1991
1	Density estimates related to Gauss periods - Gathen, Pappalardi, et al. - 1999
1	Order of Gauss periods in finite fields - Shparlinski - 1998
1	Umnoжenie mnogoznaqnyh qisel na abto matah - Karatsuba, Ofman - 1962
1	Optimal normal bases in Fpn - Mullin, Onyszchuk, et al. - 1989