Use this URL to cite or link to this record in EThOS:
Title: Lattice-based cryptanalysis
Author: Pol, Joop van de
ISNI:       0000 0004 5923 1479
Awarding Body: University of Bristol
Current Institution: University of Bristol
Date of Award: 2015
Availability of Full Text:
Full text unavailable from EThOS.
Please contact the current institution’s library for further details.
This thesis examines the use of lattice algorithms in cryptanalysis. Lattice algorithms have a rich history, and they have long been used in the context of cryptanalysis in various forms. Recently, the applications of lattice algorithms in cryptography have increased sharply in number, most notably due to the rise of lattice-based cryptography. The thesis begins by examining the state of the art in lattice-based cryptanalysis, outlining the important algorithms, and considering the performance of these algorithms in a practical setting. The remainder of the thesis is dedicated to extending the state of the art both in theory and practice, and to finding new applications for lattice algorithms in cryptanalysis. In particular, it is considered how sieving algorithms can be improved asymptotically by the use of quantum algorithms, as well as in practice by the use of Discrete Fourier Transforms. While cryptanalysis is used to break cryptographic schemes, the understanding of the algorithms used for cryptanalysis can also be used to construct secure schemes and to choose secure parameters for the schemes. Such a parameter selection method is considered in this thesis, and it is used to select secure parameters for a new boots trapping scheme for Fully Homomorphic Encryption. The thesis is concluded by a new application for lattice algorithms, which are used to obtain the signing key from an implementation of ECDSA by processing the output of a side-channel.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available