On first read, calling this “practical” may be overstating the case a bit, but interesting work nevertheless. They’re claiming a 100-fold improvement over other algorithms for computing the product of two encrypted integers, for example. Their security claims come from the partial approximate common divisor problem.
On first read, calling this “practical” may be overstating the case a bit, but interesting work nevertheless. They’re claiming a 100-fold improvement over other algorithms for computing the product of two encrypted integers, for example. Their security claims come from the partial approximate common divisor problem.