Sciweavers

6897 search results - page 20 / 1380
» Parallelization of Modular Algorithms
Sort
View
ICPPW
2006
IEEE
14 years 2 months ago
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
Evolution of grid has drawn attention from various resource intensive applications addressing domains of bio-informatics, astrology and multimedia, to name a few. Image analysis a...
Abdul Aziz, Hesham El-Rewini
MOC
2011
13 years 3 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont
ARITH
2007
IEEE
14 years 3 months ago
Fast Modular Reduction
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
14 years 26 days ago
On the Genericity of the Modular Polynomial GCD Algorithm
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan
CSC
2006
13 years 10 months ago
Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm
- A modified Montgomery modular multiplication algorithm using four-to-two CSA (carry save adder) was proposed. The modified algorithm avoids the carry delay and the repeated outpu...
Gang Feng, Guang-Sheng Ma, Zhi Yang