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 arithmetic calculations, such as modular addition and multiplication, are fundamental building blocks to Post-Quantum Cryptography (PQC) and Homomorphic Encryption (HE) systems.

Let $N > 1$. We present a method for multiplying two integers (called $N$-residues) modulo $N$ while avoiding division by $N. N$-residues are represented in a ...

Concept, notation, order, equality, types of matrices, zero and identity matrix, transpose of a matrix, symmetric and skew symmetric matrices. Operation on matrices: Addition and multiplication and ...