Accelerating Finite Field Arithmetic for Homomorphic Encryption on GPUs

نویسندگان

چکیده

Fully Homomorphic Encryption (FHE) is a rapidly developing technology that enables computation directly on encrypted data, making it compelling solution for security in cloud-based systems. In addition, modern FHE schemes are believed to be resistant quantum attacks. Although offers unprecedented potential security, current implementations suffer from prohibitively high latency. Finite field arithmetic operations, particularly the multiplication of high-degree polynomials, key computational bottlenecks. The parallel processing capabilities provided by Graphical Processing Units (GPUs) make them candidates target these highly parallelizable workloads. this article, we discuss methods accelerate polynomial with GPUs, goal practical.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating Fully Homomorphic Encryption on GPUs

In a major breakthrough, in 2009 Gentry introduced the first plausible construction of a fully homomorphic encryption (FHE) scheme. FHE allows the evaluation of arbitrary functions directly on encrypted data on untwisted servers. In 2010, Gentry and Halevi presented the first FHE implementation on an IBM x3500 server. However, this implementation remains impractical due to the high latency of e...

متن کامل

Homomorphic Encryption for Arithmetic of Approximate Numbers

We suggest a method to construct a homomorphic encryption scheme for approximate arithmetic. It supports an approximate addition and multiplication of encrypted messages, together with a new rescaling procedure for managing the magnitude of plaintext. This procedure truncates a ciphertext into a smaller modulus, which leads to rounding of plaintext. The main idea is to add a noise following sig...

متن کامل

Fully Homomorphic Encryption from the Finite Field Isomorphism Problem

If q is a prime and n is a positive integer then any two finite fields of order q are isomorphic. Elements of these fields can be thought of as polynomials with coefficients chosen modulo q, and a notion of length can be associated to these polynomials. A non-trivial isomorphism between the fields, in general, does not preserve this length, and a short element in one field will usually have an ...

متن کامل

High-Precision Arithmetic in Homomorphic Encryption

In most RLWE-based homomorphic encryption schemes the native plaintext elements are polynomials in a ring Zt[x]/(x +1), where n is a power of 2, and t an integer modulus. For performing integer or rational number arithmetic one typically uses an encoding scheme, which converts the inputs to polynomials, and allows the result of the homomorphic computation to be decoded to recover the result as ...

متن کامل

Accelerating Radiosity on GPUs

We propose a novel approach to implement radiosity on GPU with specific optimizations via form-factor matrix transformations. The proposed transformations enable to reduce the amount of computations for multiple-bounce global illumination and apply DXT compression (with subsequent hardware decompression when reading formfactors on GPU). Our implementation is 10 times faster running and requires...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Micro

سال: 2023

ISSN: ['1937-4143', '0272-1732']

DOI: https://doi.org/10.1109/mm.2023.3253052