Search for dissertations about: "Lattice sieving"
Found 3 swedish dissertations containing the words Lattice sieving.
-
1. Some Notes on Post-Quantum Cryptanalysis
Abstract : Cryptography as it is used today relies on a foundational level on the assumptionthat either the Integer Factoring Problem (IFP) or the DiscreteLogarithm Problem (DLP) is computationally intractable. In the 1990s PeterShor developed a quantum algorithm that solves both problems in polynomialtime. READ MORE
-
2. Dynamics and limits in algebraic combinatorics
Abstract : This thesis consists of the following six articles.Properties of the Edelman-Greene bijection. Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. READ MORE
-
3. Combinatorics and zeros of multivariate polynomials
Abstract : This thesis consists of five papers in algebraic and enumerative combinatorics. The objects at the heart of the thesis are combinatorial polynomials in one or more variables. We study their zeros, coefficients and special evaluations. Hyperbolic polynomials may be viewed as multivariate generalizations of real-rooted polynomials in one variable. READ MORE