In 2010, Gentry and Halevi presented the first FHE implementation. FHE allows the
evaluation of arbitrary functions directly on encrypted data on untrusted servers. However …

We present a custom architecture for realizing the Gentry-Halevi fully homomorphic
encryption (FHE) scheme. This contribution presents the first full realization of FHE in …

This paper presents the design of a power-and area-efficient high-speed 768000-bit
multiplier, based on fast Fourier transform multiplication for fully homomorphic encryption …

大数乘法是全同态加密算法中一个不可或缺的单元模块, 也是其中耗时最多的模块,
设计一个性能优良的大数乘法器有助于推进全同态加密的实用化进程. 针对SSA …

We have improved our prior implementation of Strassens algorithm for high performance
multiplication of very large integers on a general purpose graphics processor (GPU). A …

A precise meaning is given to general recursive definitions of functionals of arbitrarily high
type, including non-deterministic definitions. Domain equations involving products, sums …

The multiplication of large integers, which has many applications in computer science, is an
operation that can be expressed as a polynomial multiplication followed by a carry …

With the growth of digital data and rising security concerns, techniques for privacy-
preserving computation have become increasingly essential. Big integer multiplication …

Large multiplier is an indispensable module in fully homomorphic encryption, while is also
the most time-consuming module. Therefore, design of a large multiplier with good …

This paper explores practical aspects of using a high-level functional language for GPU-
based arithmetic on``midsize''integers. By this we mean integers of up to about a quarter …