Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Exploration of Polynomial Multiplication Algorithms for Homomorphic Encryption Schemes

Vincent Migliore 1 Maria Méndez Real 1 Vianney Lapotre 1 Arnaud Tisserand 2 Caroline Fontaine 3, 4 Guy Gogniat 1
1 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
2 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
IRISA-D3 - ARCHITECTURE, Inria Rennes – Bretagne Atlantique
4 Lab-STICC_TB_CID_SFIIS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : 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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01273192
Contributeur : Vianney Lapôtre <>
Soumis le : jeudi 25 février 2021 - 19:23:37
Dernière modification le : lundi 17 mai 2021 - 11:24:01
Archivage à long terme le : : mercredi 26 mai 2021 - 19:22:48

Fichier

reconfig-2015.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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⟩

Partager

Métriques

Consultations de la notice

2630

Téléchargements de fichiers

99