358 search results - page 24 / 72 » GCD of Many Integers |
CRYPTO
1993
Springer
13 years 11 months ago
1993
Springer
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...
WSC
2004
13 years 8 months ago
2004
In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the ob...
IJNSEC
2006
13 years 7 months ago
2006
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplica...
DCG
2007
13 years 7 months ago
2007
Abstract. We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polyto...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The development of many highly dynamic environments, like pervasive environments, introduces the possibility to use geographically closely-related services. Dynamically integrating...