Reducing the Depth of Quantum FLT-Based Inversion Circuit

Harashta Tatimma Larasati; Dedy Septono Catur Putranto; Rini Wisnu Wardhani; Howon Kim

Paper 2022/463

Reducing the Depth of Quantum FLT-Based Inversion Circuit

Harashta Tatimma Larasati, Dedy Septono Catur Putranto, Rini Wisnu Wardhani, and Howon Kim

Abstract

In this study, we propose to reduce the depth of the existing quantum Fermat's Little Theorem (FLT)-based inversion circuit for binary finite field. In particular, we propose follow a complete waterfall approach to translate the Itoh-Tsujii's variant of FLT to the corresponding quantum circuit and remove the inverse squaring operations employed in the previous work by Banegas et al., lowering the number of CNOT gates (CNOT count), which contributes to reduced overall depth and gate count. Furthermore, compare the cost by firstly constructing our method and previous work's in Qiskit quantum computer simulator and perform the resource analysis. Our approach can serve as an alternative for a time-efficient implementation.

Note: v0.2 (revise Table & Algorithm captions)

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint. MINOR revision.
Keywords: quantum cryptanalysis inversion binary field simulation
Contact author(s): tatimmaharashta @ gmail com
harashta @ pusan ac kr
History: 2022-04-22: received
Short URL: https://ia.cr/2022/463
License: CC BY

BibTeX

@misc{cryptoeprint:2022/463,
      author = {Harashta Tatimma Larasati and Dedy Septono Catur Putranto and Rini Wisnu Wardhani and Howon Kim},
      title = {Reducing the Depth of Quantum FLT-Based Inversion Circuit},
      howpublished = {Cryptology ePrint Archive, Paper 2022/463},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/463}},
      url = {https://eprint.iacr.org/2022/463}
}