A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases 论文
1988Information and Computation引用 636
Cryptography and Residue ArithmeticCoding theory and cryptography
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases · 相关技术
暂无数据