A framework for cryptographic problems from linear algebra
type: Item
instance of: scholarly article
title: A framework for cryptographic problems from linear algebra
zbMATH Open document ID: 1460.94037
author: Carl Bootland
author: Wouter Castryck
author: Alan Szepieniec
author: Frederik Vercauteren
published in: Journal of Mathematical Cryptology
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 13M10
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11H06
zbMATH DE Number: 7342612
zbMATH Keywords: LWE
zbMATH Keywords: SIS
zbMATH Keywords: NTRU
zbMATH Keywords: quotient ring
zbMATH Keywords: post-quantum
Wikidata QID: Q114845841
describes a project that uses: McEliece
describes a project that uses: NTRU
describes a project that uses: MaTRU
describes a project that uses: FrodoKEM
MaRDI profile type: Publication
full work available at URL: jmc-2019-0032
OpenAlex ID: W2988963440
cites work: A new public-key cryptosystem via Mersenne numbers
cites work: Q4228459
cites work: An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation
cites work: Minicrypt primitives with algebraic structure and applications
cites work: A Subfield Lattice Attack on Overstretched NTRU Assumptions
cites work: NTRU prime: reducing attack surface at low cost
cites work: On the hardness of the Mersenne Low Hamming Ratio assumption
cites work: Two-message statistically sender-private OT from LWE
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Classical hardness of learning with errors
cites work: On error distributions in ring-based LWE
cites work: High-precision arithmetic in homomorphic encryption
cites work: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
cites work: MaTRU: A New NTRU-Based Cryptosystem
cites work: Efficient Identity-Based Encryption over NTRU Lattices
cites work: Fully homomorphic encryption using ideal lattices
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Q3840170
cites work: Revisiting Lattice Attacks on Overstretched NTRU Parameters
cites work: Worst-case to average-case reductions for module lattices
cites work: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
cites work: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
cites work: Lattice Signatures without Trapdoors
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Q4612477
cites work: On Resultants
cites work: Q3752293
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Efficient Public Key Encryption Based on Ideal Lattices
DOI: 10.1515/JMC-2019-0032
description: scientific article; zbMATH DE number 7342612