A framework for cryptographic problems from linear algebra
From MaRDI portal
Publication:2023808
DOI10.1515/jmc-2019-0032zbMath1460.94037OpenAlexW2988963440WikidataQ114845841 ScholiaQ114845841MaRDI QIDQ2023808
Alan Szepieniec, Frederik Vercauteren, Wouter Castryck, Carl Bootland
Publication date: 3 May 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2019-0032
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Polynomials and finite commutative rings (13M10)
Related Items
Reproducible families of codes and cryptographic applications ⋮ On the integer polynomial learning with errors problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- A new public-key cryptosystem via Mersenne numbers
- Two-message statistically sender-private OT from LWE
- NTRU prime: reducing attack surface at low cost
- High-precision arithmetic in homomorphic encryption
- On the hardness of the Mersenne Low Hamming Ratio assumption
- Worst-case to average-case reductions for module lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- On error distributions in ring-based LWE
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- On Resultants
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- A Framework for Efficient and Composable Oblivious Transfer
- Efficient Public Key Encryption Based on Ideal Lattices
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Fully homomorphic encryption using ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- MaTRU: A New NTRU-Based Cryptosystem
- Classical hardness of learning with errors
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On lattices, learning with errors, random linear codes, and cryptography
- Minicrypt primitives with algebraic structure and applications
