251 search results - page 2 / 51 » On Modular Decomposition of Integers |
CRYPTO
1993
Springer
13 years 9 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...
WG
2005
Springer
13 years 10 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We give an O(N
ACSAC
2000
IEEE
13 years 9 months ago
2000
IEEE
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE