Reversible Karatsuba's Algorithm

@article{Kowada2006ReversibleKA,
  title={Reversible Karatsuba's Algorithm},
  author={L. Kowada and R. Portugal and C. D. Figueiredo},
  journal={J. Univers. Comput. Sci.},
  year={2006},
  volume={12},
  pages={499-511}
}
Karatsuba discovered the first algorithm that accomplishes multiprecision integer multiplication with complexity below that of the grade-school method. [...] Key Method These circuits can be used in reversible com- puters which have the advantage of being very efficient in terms of energy consumption. The algorithm can also be used in quantum computers and is an improvement of pre- vious circuits for the same purpose described in the literature.Expand
Efficient hardware architecture of recursive Karatsuba-Ofman multiplier
The Compilation of Reversible Circuits and a New Optimization Game
Self-Inverse Functions and Palindromic Circuits
High Performance Quantum Modular Multipliers
Synthesizing multiplier in reversible logic
...
1
2
...

References

SHOWING 1-10 OF 27 REFERENCES
Generalizations of the Karatsuba Algorithm for Efficient Implementations
Using the Parallel Karatsuba Algorithm for Long Integer Multiplication and Division
A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Reversible simulation of irreversible computation
  • Ming Li, P. Vitányi
  • Computer Science
  • Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
  • 1996
Schnelle Multiplikation großer Zahlen
Efficient networks for quantum factoring.
Logical reversibility of computation
Fast versions of Shor's quantum factoring algorithm
...
1
2
3
...