DISCO
1993
13 years 11 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
INDOCRYPT
2005
Springer
14 years 12 days ago
2005
Springer
Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av2 n...
ARITH
2005
IEEE
14 years 15 days 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...