Random self-reducibility of ideal-SVP via Arakelov random walks
type: Item
instance of: scholarly article
title: Random self-reducibility of ideal-SVP via Arakelov random walks
zbMATH Open document ID: 1504.94130
DOI: 10.1007/978-3-030-56880-1_9
author: Koen de Boer
author: Léo Ducas
author: Alice Pellet-Mary
author: Benjamin Wesolowski
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11H71
Mathematics Subject Classification ID: 11R29
zbMATH DE Number: 7614569
zbMATH Keywords: Arakelov class group
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 9
OpenAlex ID: W3013541847
cites work: Q4888749
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: Computing Generator in Cyclotomic Integer Rings
cites work: Subexponential class group and unit group computation in large degree number fields
cites work: Calculating the Power Residue Symbol and Ibeta
cites work: Q4664841
cites work: Recovering Short Generators of Principal Ideals in Cyclotomic Rings
cites work: Short Stickelberger Class Relations and Application to Ideal-SVP
cites work: Principles of harmonic analysis
cites work: On a question of Lehmer and the number of irreducible factors of a polynomial
cites work: On the shortness of vectors to be found by the ideal-SVP quantum algorithm
cites work: A quantum algorithm for computing the unit group of an arbitrary degree number field
cites work: Fully homomorphic encryption using ideal lattices
cites work: Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Q4830109
cites work: Expander graphs based on GRH with an application to elliptic curve cryptography
cites work: On the minimum of the unit lattice
cites work: Q4952720
cites work: An LLL algorithm for module lattices
cites work: Explicit bounds for residues of Dedekind zeta functions, values of \(L\)-functions at \(s=1\), and relative class numbers
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Real cyclotomic fields of prime conductor and their class numbers
cites work: Q4693061
cites work: Class Field Theory
cites work: Theory of Cryptography
cites work: Approx-SVP in ideal lattices with pre-processing
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Computing Arakelov class groups
cites work: A new polynomial factorization algorithm and its implementation
cites work: Efficient Public Key Encryption Based on Ideal Lattices
cites work: Factoring polynomials over finite fields: A survey
description: scientific article; zbMATH DE number 7614569