Paper 2022/1095
Toffoli gate count Optimized Space-Efficient Quantum Circuit for Binary Field Multiplication
Abstract
Shor's algorithm solves Elliptic Curve Discrete Logarithm Problem(ECDLP) in polynomial time. To optimize Shor's algorithm for binary elliptic curve, reducing the cost for binary field multiplication is essential because it is most cost-critical basic arithmetic. In this paper, we propose Toffoli gate count optimized space-efficient quantum circuits for binary field
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Quantum Multiplication Karatsuba Multiplication CRT Binary Field Toffoli gate
- Contact author(s)
- kin3548 @ gmail com
- History
- 2022-08-29: approved
- 2022-08-24: received
- See all versions
- Short URL
- https://ia.cr/2022/1095
- License
-
CC0
BibTeX
@misc{cryptoeprint:2022/1095, author = {KIM, SUNYEOP and KIM, INSUNG and Seonggyeom Kim and Seokhie Hong}, title = {Toffoli gate count Optimized Space-Efficient Quantum Circuit for Binary Field Multiplication}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1095}, year = {2022}, url = {https://eprint.iacr.org/2022/1095} }