科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new approach to subquadratic space complexity GF(2(n)) multipliers has been proposed recently. The corresponding algorithm for software implementations is developed. While its recursive implementation is as simple as that of the Karatsuba algorithm, it requires much less memory to store the look-up table. Therefore it is quite suitable for memory-constrained applications, for example smart cards.
- 出版日期2009-6
- 单位清华大学
