You may never have heard of modular arithmetic, but you use it every day without the slightest difficulty. In this system, numbers wrap around when they reach a certain size called the modulus; it is ...

I'm sure FPGA logic designers have often heard it said: “We just need to take this number mod 3.” Or maybe something like, “Just round to the nearest hundred.” This latter case really means: “Take the ...

Abstract: Modulo multiplication of long integers (/spl ges/ 1024 bits) is the major operation of many public-key cryptosystems like RSA or Diffie-Hellman. The efficient implementation of modulo ...

Integer-like HRR representations that respect modular arithmetic operations: $+$, $-$, $\times$. This repo was largely motivated as a proof of concept demonstrating a particular model of modular ...

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 ...

One of my fellow contributors here recently wrote a post about leap years and why we have them. This reminded me of modular arithmetic and the formula for calculating the day of the week for any date ...