28 search results - page 6 / 6 » Cunningham numbers in modular arithmetic |
185
Voted
EUROCRYPT
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
124
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
125
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...