Return to search

Lattice-based digital signature and discrete gaussian sampling

Lattice-based cryptography has generated considerable interest in the last two decades due toattractive features, including conjectured security against quantum attacks, strong securityguarantees from worst-case hardness assumptions and constructions of fully homomorphicencryption schemes. On the other hand, even though it is a crucial part of many lattice-basedschemes, Gaussian sampling is still lagging and continues to limit the effectiveness of this newcryptography. The first goal of this thesis is to improve the efficiency of Gaussian sampling forlattice-based hash-and-sign signature schemes. We propose a non-centered algorithm, with aflexible time-memory tradeoff, as fast as its centered variant for practicable size of precomputedtables. We also use the Rényi divergence to bound the precision requirement to the standarddouble precision. Our second objective is to construct Falcon, a new hash-and-sign signaturescheme, based on the theoretical framework of Gentry, Peikert and Vaikuntanathan for latticebasedsignatures. We instantiate that framework over NTRU lattices with a new trapdoor sampler.

Identiferoai:union.ndltd.org:univ-toulouse.fr/oai:oatao.univ-toulouse.fr:23886
Date12 November 2018
CreatorsRicosset, Thomas
ContributorsInstitut National Polytechnique de Toulouse - INPT (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France)
Source SetsUniversité de Toulouse
LanguageEnglish
Detected LanguageEnglish
TypePhD Thesis, PeerReviewed, info:eu-repo/semantics/doctoralThesis
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess
Relationhttp://oatao.univ-toulouse.fr/23886/

Page generated in 0.0022 seconds