Montgomery algorithms represent a transformative advancement in the computation of modular arithmetic, specifically designed to bypass the costly division steps inherent in traditional methods. By ...

Abstract: Modular multiplication finds application in various fields that rely on cryptographic and finite-field arithmetic. Basically, modular multiplication are consist of two main parts namely ...

Abstract: Measurement-based uncomputation (MBU) is a technique used to perform probabilistic uncomputation of quantum circuits. We formalize this technique for the case of single-qubit registers, and ...