Exploration of Polynomial Multiplication Algorithms for Homomorphic Encryption Schemes - Laboratoire des Sciences et Techniques de l'Information, de la Communication et de la Connaissance, site ENIB Brest Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Exploration of Polynomial Multiplication Algorithms for Homomorphic Encryption Schemes

Résumé

Homomorphic encryption schemes allow performing computations in the ciphertext domain, without the need of the secret key. In most promising schemes based on the ringlearning with errors (R-LWE) problem, polynomial multiplication operation is considered as an important bottleneck. In this study, a comparison between the Karatsuba and the fast Fourier transform (FFT) multiplication algorithms in the context of homomorphic encryption is proposed in terms of complexity, flexibility and possible optimizations. A complete hardware architecture to speeding up polynomial multiplication is provided and impacts of such an architecture on the Karatsuba and the FFT algorithms is thoroughly studied. The study demonstrates that in a realistic architecture, Karatsuba can be a better alternative to the FFT one.
Fichier principal
Vignette du fichier
reconfig-2015.pdf (2.47 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01273192 , version 1 (25-02-2021)

Identifiants

Citer

Vincent Migliore, Maria Méndez Real, Vianney Lapotre, Arnaud Tisserand, Caroline Fontaine, et al.. Exploration of Polynomial Multiplication Algorithms for Homomorphic Encryption Schemes. International Conference on Reconfigurable Computing and FPGAs (ReConFig), Dec 2015, Cancun, Mexico. ⟨10.1109/ReConFig.2015.7393307⟩. ⟨hal-01273192⟩
382 Consultations
145 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More