Skip to Main content Skip to Navigation
Conference papers

Implementing Candidate Graded Encoding Schemes from Ideal Lattices

Abstract : 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).
Document type :
Conference papers
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01237355
Contributor : Fabien Laguillaumie <>
Submitted on : Tuesday, December 8, 2015 - 3:19:47 PM
Last modification on : Thursday, December 3, 2020 - 11:24:04 AM

File

928.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

574

Files downloads

522