Author:
Méloni Nicolas,Négre Christophe,Hasan M. Anwar
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bajard, J.-C., Imbert, L., Jullien, G.A.: Parallel Montgomery multiplication in GF(2
k
) using trinomial residue arithmetic. In: Proc. 17th IEEE Symposium on Computer Arithmetic (ARITH), pp. 164–171 (2005)
2. Lecture Notes in Computer Science;P. Bulens,2008
3. Fan, H., Hasan, M.A.: A new approach to subquadratic space complexity parallel multipliers for extended binary fields. IEEE Transactions on Computers 56(2), 224–233 (2007)
4. Lecture Notes in Computer Science;T. Good,2005
5. Gordon, J.A.: Very simple method to find the minimum polynomial of an arbitrary nonzero element of a finite field. Electronics Letters 12(25), 663–664 (1976)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献