1380 search results - page 73 / 276 » A General Polynomial Sieve |
157
click to vote
CSJM
2008
15 years 6 months ago
2008
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon general...
148
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
Recently, it was shown that it is possible to sample classes of 1D and 2-D signals with finite rate of innovation (FRI) [9, 4, 5, 3, 2, 7]. In particular, in [7], we presented loc...
152
click to vote
ESA
2007
Springer
16 years 10 days ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
176
click to vote
IACR
2011
14 years 5 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
178
click to vote
ECCC
2011
14 years 9 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...