DocumentCode :
2892260
Title :
Efficient exponentiation in finite field
Author :
von zur Gathen, Joachim
Author_Institution :
Dept. of Comput. Sci., Toronto Univ., Ont., Canada
fYear :
1991
fDate :
1-4 Oct 1991
Firstpage :
384
Lastpage :
391
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
Keywords :
parallel algorithms; exponentiation; finite field; finite field extension; ground field; normal basis; optimal sequential algorithms; parallel algorithms; Arithmetic; Circuits; Computer science; Concurrent computing; Councils; Cryptography; Galois fields; Natural languages; Parallel algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
Type :
conf
DOI :
10.1109/SFCS.1991.185395
Filename :
185395
Link To Document :
بازگشت