Abstract: We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The so-called polynomial modular number system (PMNS) allows for fast polynomial ...

Used concepts from a course in abstract algebra to implement the Affine Hill cipher. Developed an R package featuring a variety of functions for modular arithmetic and linear algebra. Implemented a web ...

The Zmodn package provides a class for representing integers modulo a given prime number. This class can be used to applications such as cryptography and computer algebra.

Modular arithmetic, often hailed as one of the cornerstones of number theory, holds a significant place in the realm of mathematics. Beyond its foundational role, modular arithmetic plays a pivotal ...

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

Primality testing is the problem of determining whether a given number is prime or not. A prime number is a positive integer that has exactly two positive divisors: 1 and itself. For example, 2, 3, 5, ...