[Resource Topic] 2021/980: Binary Field Montgomery Multiplication on Quantum Computers

Welcome to the resource topic for 2021/980

Binary Field Montgomery Multiplication on Quantum Computers

Authors: Kyoungbae Jang, Gyeong Ju Song, Hyunji Kim, Hyeokdong Kwon, Wai-Kong Lee, Zhi Hu, Hwajeong Seo


Optimizing arithmetic operations into quantum circuits to utilize quantum algorithms, such as the Shor algorithm and Grover search algorithm for cryptanalysis, is an active research field in cryptography implementation. In particular, reducing quantum resources is important for efficient implementation. In this paper, binary field (GF(2^n)) Montgomery multiplication in quantum circuits is presented. We utilize the bit-level Montgomery algorithm to efficiently compute the Montgomery product C = A \cdot B \cdot r^{-1} in the binary field GF(2^n). Additionally, we also present an efficient Montgomery multiplication quantum circuit in the case where the modulus of GF(2^n) is specified.

ePrint: https://eprint.iacr.org/2021/980

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .