237 search results - page 20 / 48 » MapReduce for Integer Factorization |
EUROCRYPT
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. This paper reports record-setting performance for the ellipticcurve method of integer factorization: for example, 926.11 curves/second for ECM stage 1 with B1 = 8192 for ...
ANTS
2004
Springer
14 years 4 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
DM
2008
13 years 11 months ago
2008
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
SCP
2010
13 years 9 months ago
2010
Several scienti c bottlenecks have been identi ed in existing component-based approaches. em, we focus on the identi cation of a relevant abstraction for the component expression ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...