Modular Multiplication without Carry Propagation (Algorithm Description)
Oleg Mazonka
TL;DR
This paper presents a simple modular multiplication algorithm that avoids carry propagation by using carry-save addition and Boolean logic, simplifying the process.
Contribution
It introduces a novel modular multiplication method that eliminates the need for number comparison and carry propagation, enhancing efficiency.
Findings
Reduces computational complexity of modular multiplication
Eliminates carry propagation in the algorithm
Potentially improves performance in hardware implementations
Abstract
This paper describes a sufficiently simple modular multiplication algorithm, which uses only carry-save addition with bit inspection Boolean logic and without number comparison or carry propagation.
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 · Numerical Methods and Algorithms · Cellular Automata and Applications