Analysis of error terms of signatures based on learning with errors

DOI10.1007/978-3-319-53177-9_4MaRDI QIDQ2988339zbMATH OpenOpenAlexWikidataFDO

Authors Jeongsu Kim, Suyong Park, Seonggeun Kim, Busik Jang, Sang Geun Hahn, Sangim Jung, Dongyoung Roh

Publication date 19 May 2017

Published in Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-53177-9_4

zbMATH Keywords

latticelearning with errorsLWEdigital signaturediscrete random variablediscrete Gaussian distribution

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• An improved compression technique for signatures based on learning with errors
• Lattice signatures without trapdoors
• Lattice signatures and bimodal Gaussians
• High-speed signatures from standard lattices
• On rejection sampling in Lyubashevsky's signature scheme

Cites work

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• An improved compression technique for signatures based on learning with errors
• BKZ 2.0: Better lattice security estimates
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• High-speed signatures from standard lattices
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Lattice-Based Identification Schemes Secure Under Active Attacks
• On lattices, learning with errors, random linear codes, and cryptography
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(6)

• Cryptanalysis of a code-based one-time signature
• Rejection sampling revisit: how to choose parameters in lattice-based signature
• On removing rejection conditions in practical lattice-based signatures
• On the higher-bit version of approximate inhomogeneous short integer solution problem
• Compact ring signatures from learning with errors
• An improved compression technique for signatures based on learning with errors

Describes a project that uses

Uses Software

• NTRUSign
• NTRU
• BKZ
• eBACS
• eBASH

This page was built for publication: Analysis of error terms of signatures based on learning with errors

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