Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders

DOI10.1007/978-3-319-26059-4_23zbMath1338.94083OpenAlexW2397185278MaRDI QIDQ3464413

Katsuyuki Takashima, Atsushi Takayasu

Publication date: 27 January 2016

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26059-4_23

zbMATH Keywords

SIStight reductionLWERényi divergencelattice based cryptographyBLISSsampling discrete Gaussian

Mathematics Subject Classification ID

Cryptography (94A60) Statistical aspects of information-theoretic topics (62B10) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Bit security as computational cost for winning games with high probability ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance

This page was built for publication: Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders