公开(公告)号：US20220085970A1

公开(公告)日：2022-03-17

申请号：US16634570

申请日：2018-07-24

Applicant: Agency for Science, Technology and Research

Inventor： Ahmad AL BADAWI ,  Khin Mi Mi AUNG

IPC: H04L9/00 ,  H04L9/30 ,  G06F7/72

Abstract: Efficient polynomial multiplication for Accelerated Fully Homomorphic Encryption (FHE). An efficient method for large integer and polynomial multiplication in a ring using negacyclic convolution and discrete Galois transform with arbitrary primes is described. The method is adapted to work with arbitrary primes that support Gaussian arithmetic. Dealing with non-Gaussian primes gives rise to another problem of how to find primitive roots of unity and of (i). An efficient solution to find those roots of interest is provided.