12 search results - page 1 / 3 » Practical Bootstrapping in Quasilinear Time |
PKC
2012
Springer
11 years 7 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
On open and controversial issue in empirical data analysis is to decide whether scaling and multifractal properties observed in empirical data actually exist, or whether they are ...
MM
2004
ACM
13 years 10 months ago
2004
ACM
Most current image retrieval systems and commercial search engines use mainly text annotations to index and retrieve WWW images. This research explores the use of machine learning...