137 search results - page 3 / 28 » Probabilistic algorithm for finding roots of linearized poly... |
JOC
2007
13 years 5 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
JSC
2010
13 years 3 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
13 years 9 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
JUCS
2010
13 years 3 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
DAGSTUHL
2006
13 years 6 months ago
2006
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...