Compact encryption based on Module-NTRU problems

DOI10.1007/978-3-031-62743-9_13MaRDI QIDQ7034563zbMATH OpenFDO

Authors Shi Bai, Hansraj Jangir, Hao Lin, Tran Ngo, Weiqiang Wen, Jinwei Zheng

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-62743-9_13

zbMATH Keywords

encapsulationencryptionlattice-based cryptographyModule-NTRU problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• A modular analysis of the Fujisaki-Okamoto transformation
• A thorough treatment of highly-efficient NTRU instantiations
• A toolkit for ring-LWE cryptography
• Advances in cryptology -- ASIACRYPT 2017. 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, December 3--7, 2017. Proceedings. Part II
• Advances in cryptology -- ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6--10, 2021. Proceedings. Part IV
• An efficient and parallel Gaussian sampler for lattices
• Efficient identity-based encryption over NTRU lattices
• Efficient public key encryption based on ideal lattices (extended abstract)
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
• Fiat-Shamir signatures based on module-NTRU
• GGHLite: more efficient multilinear maps from ideal lattices
• scientific article; zbMATH DE number 5485483 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Large modulus ring-LWE \(\geq \) module-LWE
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Making NTRU as secure as worst-case problems over ideal lattices
• NEV: faster and smaller NTRU encryption using vector decoding
• New Algorithms for Learning in Presence of Errors
• NTRU Fatigue: How Stretched is Overstretched?
• NTRU prime: reducing attack surface at low cost
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On module unique-SVP and NTRU
• On the concrete hardness of learning with errors
• On the hardness of learning with rounding over small modulus
• Online-extractability in the quantum random-oracle model
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Revisiting the expected cost of solving uSVP and applications to LWE
• Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
• Worst-case to average-case reductions for module lattices

Cited in

(2)

• Compact lattice signatures via iterative rejection sampling
• DAWN: smaller and faster NTRU encryption via double encoding

This page was built for publication: Compact encryption based on Module-NTRU problems

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