358 search results - page 3 / 72 » GCD of Many Integers |
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
ICISC
2008
13 years 6 months ago
2008
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing ...
WEA
2009
Springer
14 years 3 days ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
– Future wireless cellular networks such as High Speed Downlink Packet Access (HSDPA) and 1x EVolution Data Optimized (1xEV-DO) promise to revolutionize the mobile user’s wirel...