Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882)

scientific article; zbMATH DE number 6729670

Language	Label	Description	Also known as
English	Short Stickelberger Class Relations and Application to Ideal-SVP	scientific article; zbMATH DE number 6729670

Statements

instance of

scholarly article

0 references

title

Short Stickelberger Class Relations and Application to Ideal-SVP (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

full work available at URL

https://ir.cwi.nl/pub/25744

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q4938616

0 references

Explicit Bounds for Primality Testing and Related Problems

0 references

NTRU prime: reducing attack surface at low cost

0 references

Computing Generator in Cyclotomic Integer Rings

0 references

Subexponential class group and unit group computation in large degree number fields

0 references

Q4664841

0 references

Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

0 references

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

0 references

Recovering Short Generators of Principal Ideals in Cyclotomic Rings

0 references

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

0 references

Q5417640

0 references

A quantum algorithm for computing the unit group of an arbitrary degree number field

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Q3549702

0 references

Q4737253

0 references

Q3840170

0 references

Expander graphs based on GRH with an application to elliptic curve cryptography

0 references

Euclid's Algorithm in Cyclotomic Fields

0 references

Factoring polynomials with rational coefficients

0 references

Generalized Compact Knapsacks Are Collision Resistant

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Worst-case to average-case reductions for module lattices

0 references

GGHLite: More Efficient Multilinear Maps from Ideal Lattices

0 references

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions

0 references

Real cyclotomic fields of prime conductor and their class numbers

0 references

A generalization of the LLL-algorithm over Euclidean rings or orders

0 references

Theory of Cryptography

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

Minus class groups of the fields of the 𝑙-th roots of unity

0 references

Class numbers of real cyclotomic fields of prime conductor

0 references

Catalan's conjecture

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

On the Stickelberger ideal and the circular units of an abelian field

0 references

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

0 references

Efficient Public Key Encryption Based on Ideal Lattices

0 references

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

0 references

Q3943047

0 references

Identifiers

zbMATH Open document ID

1411.94057

0 references

DOI

10.1007/978-3-319-56620-7_12

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738882