DAWN: smaller and faster NTRU encryption via double encoding

DOI10.1007/978-981-95-5099-9_13MaRDI QIDQ7228253zbMATH OpenFDO

Authors Yijian Liu, Yu Zhang, Xianhui Lu, Yao Cheng, Yongjian Yin

Publication date 13 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5099-9_13

zbMATH Keywords

KEMlattice based cryptographyNTRUPKE

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A modular analysis of the Fujisaki-Okamoto transformation
• A novel CCA attack using decryption errors against LAC
• A thorough treatment of highly-efficient NTRU instantiations
• Compact encryption based on Module-NTRU problems
• Decryption failure attacks on IND-CCA secure lattice-based schemes
• Efficient identity-based encryption over NTRU lattices
• Efficient public key encryption based on ideal lattices (extended abstract)
• Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
• Fast reduction of algebraic lattices over cyclotomic fields
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
• High-speed key encapsulation from NTRU
• Homomorphic encryption for arithmetic of approximate numbers
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1346524 (Why is no real title available?)
• IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
• Lattice decoding attacks on binary LWE
• Lossiness and entropic hardness for ring-LWE
• Making NTRU as secure as worst-case problems over ideal lattices
• Minkowski's Convex Body Theorem and Integer Programming
• NEV: faster and smaller NTRU encryption using vector decoding
• New Algorithms for Learning in Presence of Errors
• Noise-tolerant learning, the parity problem, and the statistical query model
• NTRU Fatigue: How Stretched is Overstretched?
• NTRU prime: reducing attack surface at low cost
• On ideal lattices and learning with errors over rings
• On the complexity of the BKW algorithm on LWE
• On the concrete hardness of learning with errors
• On the hardness of the NTRU problem
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Optimizations for NTRU
• Provably weak instances of ring-LWE revisited

This page was built for publication: DAWN: smaller and faster NTRU encryption via double encoding

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