Implementing candidate graded encoding schemes from ideal lattices

DOI10.1007/978-3-662-48800-3_31MaRDI QIDQ2795999zbMATH OpenOpenAlexFDO

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

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

algorithmscryptographic multilinear mapsimplementationlattice-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• GGHLite: more efficient multilinear maps from ideal lattices
• Candidate Multilinear Maps from Ideal Lattices
• Cryptanalysis of multilinear maps from ideal lattices: revisited
• Practical multilinear maps over the integers
• Graph-induced multilinear maps from lattices

Cited in

(11)

• Security analysis of cryptosystems using short generators over ideal lattices
• Fast reduction of algebraic lattices over cyclotomic fields
• How to avoid obfuscation using witness PRFs
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
• Graph-induced multilinear maps from lattices
• GGHLite: more efficient multilinear maps from ideal lattices
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• A polynomial time algorithm for breaking NTRU encryption with multiple keys
• Non-interactive key exchange: new notions, new constructions, and forward security

This page was built for publication: Implementing candidate graded encoding schemes from ideal lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795999)