论文信息 - Efficient Exponentiation in Finite Fields (Extended Abstract) - 字舞流文

Efficient Exponentiation in Finite Fields (Extended Abstract)

Optimal sequential and parallel algorithms for exponentiation in a finite field extension are presented, assuming that a normal basis over the ground field is given. >

Joachim von zur Gathen

[1] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.

[2] Dieter Gollmann,et al. Architectures for Exponentiation in GF(2n) , 1986, CRYPTO.

[3] Douglas R. Stinson. Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n) , 1990, SIAM J. Comput..

[4] Joachim von zur Gathen,et al. Boolean Circuits Versus Arithmetic Circuits , 1991, Inf. Comput..

[5] Joachim von zur Gathen,et al. Inversion in Finite Fields Using Logarithmic Depth , 1990, J. Symb. Comput..

[6] Joachim von zur Gathen. Computing Powers in Parallel , 1987, SIAM J. Comput..

[7] Srecko Brlek,et al. On the Length of Word Chains , 1987, Inf. Process. Lett..

[8] V. I. Solodovnikov,et al. Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field , 1987 .

[9] Joachim von zur Gathen,et al. Constructing Normal Bases in Finite Fields , 1990, J. Symb. Comput..

[10] Gordon B. Agnew,et al. Fast Exponentiation in GF(2n) , 1988, EUROCRYPT.