Paper 2019/282
A Framework for Cryptographic Problems from Linear Algebra
Carl Bootland, Wouter Castryck, Alan Szepieniec, and Frederik Vercauteren
Abstract
We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also code-based cryptography. The framework allows to easily instantiate new hard problems and to automatically construct post-quantum secure primitives from them. As a first basic application, we introduce two new hard problems and the corresponding encryption schemes.
Concretely, we study generalizations of hard problems such as SIS, LWE and NTRU to free modules over quotients of
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- LWESISNTRUquotient ringpost-quantum
- Contact author(s)
-
carl bootland @ kuleuven be
frederik vercauteren @ kuleuven be - History
- 2019-03-12: received
- Short URL
- https://ia.cr/2019/282
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/282, author = {Carl Bootland and Wouter Castryck and Alan Szepieniec and Frederik Vercauteren}, title = {A Framework for Cryptographic Problems from Linear Algebra}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/282}, year = {2019}, url = {https://eprint.iacr.org/2019/282} }