I welcomed the New Year by playing mahjong with my family. The version we play starts with one person rolling three dice and then counting around the table of four players to whatever the total is.

Pure-Python library for working with modular arithmetic, congruence classes, and finite fields. A library for number theory and modular arithmetic algorithms in Python e.g. Pollard Rho, Miller–Rabin ...

Abstract: The Montgomery multiplication is an efficient method for modular arithmetic. Typically, it is used for modular arithmetic over integer rings to prevent the expensive inversion for the modulo ...

Abstract: The Montgomery multiplication is an efficient method for modular arithmetic. Typically, it is used for modular arithmetic over integer rings to prevent the expensive inversion for the modulo ...

Code for arithmetic with polynomials mod p and within finite fields. The code deals with various objects, such as integers modulo a number, elements in a finite field, and with arithmetic in finite ...

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

This paper introduces a new paradigm for the construction of reversible transforms that map integers to integers. Transform matrices with integer entries are first considered, and the modulo ...

The modular arithmetic coprocessor must have at least 6 registers (4 if only encryption is implemented), each of length greater or equal than 16 bytes each. On the other hand, the coprocessor shall be ...