{"title":"Efficient exponentiation in finite field","authors":"J. von zur Gathen","doi":"10.1109/SFCS.1991.185395","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1991.185395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
