9 search results - page 1 / 2 » Efficient Modular Arithmetic in Adapted Modular Number Syste... |
ACISP
2008
Springer
13 years 11 months ago
2008
Springer
ARITH
2005
IEEE
13 years 11 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...
ARITH
1997
IEEE
13 years 9 months ago
1997
IEEE
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
ISSRE
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, based on software reliability growth models with generalized logistic testing-effort function, we study three optimal resource allocation problems in modular softwa...
IJNSEC
2010
13 years 3 days ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...