Implementing Candidate Graded Encoding Schemes from Ideal Lattices

DOI10.1007/978-3-662-48800-3_31zbMath1382.94041OpenAlexW2295080346MaRDI QIDQ2795999

Adeline Roux-Langlois, Fabien Laguillaumie, Martin R. Albrecht, Catalin Cocis

Publication date: 23 March 2016

Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01237355/file/928.pdf

zbMATH Keywords

algorithmsimplementationlattice-based cryptographycryptographic multilinear maps

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Fast reduction of algebraic lattices over cyclotomic fields

This page was built for publication: Implementing Candidate Graded Encoding Schemes from Ideal Lattices