28 search results - page 1 / 6 » Cunningham numbers in modular arithmetic |
PCS
2007
13 years 6 months ago
2007
ACISP
2008
Springer
14 years 1 months ago
2008
Springer
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
ASAP
1996
IEEE
13 years 11 months ago
1996
IEEE
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large modul...