Sciweavers

237 search results - page 18 / 48
» MapReduce for Integer Factorization
Sort
View
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
14 years 3 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
EUROCAL
1987
115views Mathematics» more  EUROCAL 1987»
14 years 2 months ago
Number-theoretic transforms of prescribed length
Abstract. A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is prese...
Reiner Creutzburg, Manfred Tasche
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 11 months ago
Algorithms and Approaches of Proxy Signature: A Survey
Numerous research studies have been investigated on proxy signatures over the last decade. This survey reviews the research progress on proxy signatures, analyzes a few notable pr...
Manik Lal Das, Ashutosh Saxena, Deepak B. Phatak
AMC
2005
124views more  AMC 2005»
13 years 10 months ago
An efficient undeniable group-oriented signature scheme
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen
SIGCOMM
2009
ACM
14 years 5 months ago
Understanding TCP incast throughput collapse in datacenter networks
TCP Throughput Collapse, also known as Incast, is a pathological behavior of TCP that results in gross under-utilization of link capacity in certain many-to-one communication patt...
Yanpei Chen, Rean Griffith, Junda Liu, Randy H. Ka...