Toom-3 algorithm for polynomial multiplication over finite field F4 and its application on quantum key distribution

Guanjin HUANG; Huaxu ZHOU; Chuangbo CHEN; Peng GAO; Jie LING

doi:10.3969/j.issn.1007-5461. 2021.04.010

Journals >Chinese Journal of Quantum Electronics >Volume 38 >Issue 4 >Page 477 > Article

Chinese Journal of Quantum Electronics
Vol. 38, Issue 4, 477 (2021)

Toom-3 algorithm for polynomial multiplication over finite field F4 and its application on quantum key distribution

Guanjin HUANG^1、*, Huaxu ZHOU¹, Chuangbo CHEN¹, Peng GAO¹, and Jie LING²

Author Affiliations

¹[in Chinese]

²[in Chinese]

show less

DOI: 10.3969/j.issn.1007-5461. 2021.04.010 Cite this Article

HUANG Guanjin, ZHOU Huaxu, CHEN Chuangbo, GAO Peng, LING Jie. Toom-3 algorithm for polynomial multiplication over finite field F4 and its application on quantum key distribution[J]. Chinese Journal of Quantum Electronics, 2021, 38(4): 477 Copy Citation Text

show less

References

[1] The GNU multi-precision library (GMP)[OL]. http://gmplib.org.

[2] The GP-Pari computer algebra system[OL]. http://pari.math.u-bordeaux.fr/.

[3] NTL: A library for doing number theory[OL]. http://www.shoup.net/ntl.

[4] Bodrato M. Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0[M].Mrabet N E, et al. Arithmetic of Finite Fields, Madrid: Springer, 2007: 116-133.

[5] van Assche G. Quantum Cryptography and Secret-Key Distillation[M]. Cambridge: Cambridge University Press, 2006.

[6] Jebelean T. An algorithm for exact division[J]. Journal of Symbolic Computation, 1993, 15(2): 169-180.

Download Citation

Save the article for my favorites

Paper Information