Implementing Candidate Graded Encoding Schemes from Ideal Lattices - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Implementing Candidate Graded Encoding Schemes from Ideal Lattices


Multilinear maps have become popular tools for designing cryptographic schemes since a first approximate realisation candidate was proposed by Garg, Gentry and Halevi (GGH). This construction was later improved by Langlois, Stehlé and Steinfeld who proposed GGHLite which offers smaller parameter sizes. In this work, we provide the first implementation of such approximate multilinear maps based on ideal lattices. Implementing GGH-like schemes naively would not allow instantiating it for non-trivial parameter sizes. We hence propose a strategy which reduces parameter sizes further and several technical improvements to allow for an efficient implementation. In particular, since finding a prime ideal when generating instances is an expensive operation, we show how we can drop this requirement. We also propose algorithms and implementations for sampling from discrete Gaussians, for inverting in some Cyclotomic number fields and for computing norms of ideals in some Cyclotomic number rings. Due to our improvements we were able to compute a multilinear jigsaw puzzle for κ " 52 (resp. κ " 38) and λ " 52 (resp. λ " 80).
Fichier principal
Vignette du fichier
928.pdf (532.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01237355 , version 1 (08-12-2015)



Martin R. Albrecht, Catalin Cocis, Fabien Laguillaumie, Adeline Langlois. Implementing Candidate Graded Encoding Schemes from Ideal Lattices. Asiacrypt 2015, Nov 2015, Auckland, New Zealand. ⟨10.1007/978-3-662-48800-3_31⟩. ⟨hal-01237355⟩
275 Consultations
240 Téléchargements



Gmail Facebook Twitter LinkedIn More