1380 search results - page 5 / 276 » A General Polynomial Sieve |
EUROCRYPT
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
MOC
2000
13 years 8 months ago
2000
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
ALT
2002
Springer
14 years 5 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— The ability of mobile robots to quickly and accurately analyze their dynamics is critical to their safety and efficient operation. In field conditions, significant uncertainty ...