Security analysis of cryptosystems using short generators over ideal lattices
From MaRDI portal
Publication:1756730
Recommendations
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- Short generators without quantum computers: the case of multiquadratics
- Recovering short generators of principal ideals in cyclotomic rings
- On the ideal shortest vector problem over random rational primes
- Sieving for shortest vectors in ideal lattices
Cites work
- A numerical study of Weber's real class number calculation
- Approximate formulae for \(L(1,\chi)\)
- Asymptotically Efficient Lattice-Based Digital Signatures
- Candidate Multilinear Maps from Ideal Lattices
- Certain primary components of the ideal class group of the \(\mathbb Z_p\)-extension over the rationals
- Class Number Computations of Real Abelian Number Fields
- Class numbers of totally real fields and applications to the Weber class number problem
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Efficient public key encryption based on ideal lattices (extended abstract)
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Explicit upper bounds for \(|L(1, \chi )|\) when \(\chi (3)=0\)
- Explicit upper bounds of \(|L(1,\chi)|\). IV
- Fast quantum algorithms for computing the unit group and class group of a number field
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- GGHLite: more efficient multilinear maps from ideal lattices
- scientific article; zbMATH DE number 3666904 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1846912 (Why is no real title available?)
- scientific article; zbMATH DE number 6438487 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- scientific article; zbMATH DE number 3086405 (Why is no real title available?)
- Implementing candidate graded encoding schemes from ideal lattices
- Implementing Gentry's fully-homomorphic encryption scheme
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Making NTRU as secure as worst-case problems over ideal lattices
- Numerische Bestimmung von Klassenzahlen reeller zyklischer Zahlkörper
- On ideal lattices and learning with errors over rings
- On Lovász' lattice reduction and the nearest lattice point problem
- Recovering short generators of principal fractional ideals in cyclotomic fields of conductor p^ q^
- Recovering short generators of principal ideals in cyclotomic rings
- Short Stickelberger class relations and application to Ideal-SVP
- Simple proofs of the Siegel–Tatuzawa and Brauer–Siegel theorems
- Subexponential class group and unit group computation in large degree number fields
- Subexponential time relations in the class group of large degree number fields
- The Magma algebra system. I: The user language
- Theory of Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Weber's class number problem in the cyclotomic \(\mathbb Z_2\)-extension of \(\mathbb Q\). II.
- Weber's class number problem in the cyclotomic \(\mathbb Z_{2}\)-extension of \(\mathbb Q\). III.
Cited in
(3)
This page was built for publication: Security analysis of cryptosystems using short generators over ideal lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756730)
