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

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

Guanjin HUANG1,*... Huaxu ZHOU1, Chuangbo CHEN1, Peng GAO1 and Jie LING2 |Show fewer author(s)
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less

    Fast and efficient privacy amplification plays an important role in high throughput quantum key distribution (QKD) system. In general, implementation of privacy amplification relies on large integer multiplication, binary matrix multiplication or polynomial multiplication over finite field. Especially, privacy amplification based on polynomial multiplication has the advantage of low requirement on random number, while has relatively high implementation complexity. In this work, Toom-3 algorithm over finite field with four elements is developed and the corresponding explicit formula is derived, then a new privacy amplification method based on Toom-3 algorithm is presented. The time complexity of the method is O(n1.465), which indicates that the method is suitable for parallel computing and hardware implementaiton.

    Tools

    Get Citation

    Copy Citation Text

    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

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Jun. 22, 2020

    Accepted: --

    Published Online: Sep. 1, 2021

    The Author Email: Guanjin HUANG (huanggj@em.pgc.csg)

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

    Topics