Carl Bootland
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Carl Bootland has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Frederik Vercauteren
Imec-COSIC, KU Leuven
2 shared publications - Wouter Castryck
KU Leuven
2 shared publications - Alan Szepieniec
Nervos Foundation
1 shared publication Charlotte Bonte
KU Leuven
1 shared publication- Ilia Iliashenko
KU Leuven
1 shared publication - Joppe W. Bos
NXP Semiconductors
1 shared publication
Latest Publications
- Open Access
- 8 November 2019
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 14 (1) , 202-217
A framework for cryptographic problems from linear algebra
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 problems coming from code-based cryptography. The framework allows to easily instantiate new hard problems and to automatically construct plausibly 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 generalisations of hard problems such as SIS, LWE and NTRU to free modules over quotients of ℤ[ X ] by ideals of the form ( f , g ), where f is a monic polynomial and g ∈ ℤ[ X ] is a ciphertext modulus coprime to f . For trivial modules (i.e. of rank one), the case f = X n + 1 and g = q ∈ ℤ >1 corresponds to ring-LWE, ring-SIS and NTRU, while the choices f = X n – 1 and g = X – 2 essentially cover the recently proposed Mersenne prime cryptosystems. At the other extreme, when considering modules of large rank and letting deg( f ) = 1, one recovers the framework of LWE and SIS.
- 8 November 2019
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 14 (1) , 202-217
Open AccessA framework for cryptographic problems from linear algebra
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 problems coming from code-based cryptography. The framework allows to easily instantiate new hard problems and to automatically construct plausibly 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 generalisations of hard problems such as SIS, LWE and NTRU to free modules over quotients of ℤ[ X ] by ideals of the form ( f , g ), where f is a monic polynomial and g ∈ ℤ[ X ] is a ciphertext modulus coprime to f . For trivial modules (i.e. of rank one), the case f = X n + 1 and g = q ∈ ℤ >1 corresponds to ring-LWE, ring-SIS and NTRU, while the choices f = X n – 1 and g = X – 2 essentially cover the recently proposed Mersenne prime cryptosystems. At the other extreme, when considering modules of large rank and letting deg( f ) = 1, one recovers the framework of LWE and SIS.
- 25 August 2017
- Published by Springer Nature
- p. 579-600
Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- 25 August 2017
- Published by Springer Nature
- p. 579-600
Faster Homomorphic Function Evaluation Using Non-integral Base Encoding