Chapter 2
Secure Implementation of Lattice-Based
Encryption Schemes
Tobias Oder, Tobias Schneider, and Tim Güneysu
2.1 Introduction
Cryptographic key-exchange mechanisms (KEMs) are essential to secure confidential information that gets transmitted over an insecure channel. By using a KEM, the
communicating parties can agree on a shared secret key that they can use to encrypt
data without an eavesdropper being able to derive any information about that key.
The majority of KEMs that are in use today base their cryptographic security on
either the prime factorization problem or the discrete logarithm problem. However,
given a fairly powerful quantum computer, one can break cryptographic schemes
based on these mathematical problems using Shor’s algorithm [52]. The ubiquitous
threat posed by recent advances in quantum computing to currently employed KEMs
The majority of the work was performed while Tobias Schneider was with Ruhr-Universität
Bochum.
T. Oder
Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
e-mail: tobias.oder@rub.de
T. Schneider
ICTEAM/ELEN/Crypto Group, Université Catholique de Louvain, Louvain, Belgium
e-mail: tobias.schneider@uclouvain.be
T. Güneysu ()
Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
DFKI, Bremen, Germany
e-mail: tim.gueneysu@rub.de
© Springer Nature Switzerland AG 2020
R. Drechsler, M. Soeken (eds.), Advanced Boolean Techniques,
https://doi.org/10.1007/978-3-030-20323-8_2
21
Secure Implementation of Lattice-Based
Encryption Schemes
Tobias Oder, Tobias Schneider, and Tim Güneysu
2.1 Introduction
Cryptographic key-exchange mechanisms (KEMs) are essential to secure confidential information that gets transmitted over an insecure channel. By using a KEM, the
communicating parties can agree on a shared secret key that they can use to encrypt
data without an eavesdropper being able to derive any information about that key.
The majority of KEMs that are in use today base their cryptographic security on
either the prime factorization problem or the discrete logarithm problem. However,
given a fairly powerful quantum computer, one can break cryptographic schemes
based on these mathematical problems using Shor’s algorithm [52]. The ubiquitous
threat posed by recent advances in quantum computing to currently employed KEMs
The majority of the work was performed while Tobias Schneider was with Ruhr-Universität
Bochum.
T. Oder
Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
e-mail: tobias.oder@rub.de
T. Schneider
ICTEAM/ELEN/Crypto Group, Université Catholique de Louvain, Louvain, Belgium
e-mail: tobias.schneider@uclouvain.be
T. Güneysu ()
Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
DFKI, Bremen, Germany
e-mail: tim.gueneysu@rub.de
© Springer Nature Switzerland AG 2020
R. Drechsler, M. Soeken (eds.), Advanced Boolean Techniques,
https://doi.org/10.1007/978-3-030-20323-8_2
21