On the circuit complexity of the standard and the Karatsuba methods of multiplying integers
Igor S. Sergeev
TL;DR
This paper analyzes the Boolean circuit complexity of the standard and Karatsuba algorithms for integer multiplication, providing precise upper bounds to understand their computational efficiency.
Contribution
It offers the first accurate upper bounds on the Boolean circuit complexity for both the standard and Karatsuba multiplication methods.
Findings
Upper bounds established for the circuit complexity of standard multiplication
Upper bounds established for the circuit complexity of Karatsuba multiplication
Enhanced understanding of the efficiency of these multiplication algorithms in circuit models
Abstract
We provide accurate upper bounds on the Boolean circuit complexity of the standard and the Karatsuba methods of integer multiplication
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Cryptography and Data Security