Short Generators Without Quantum Computers: The Case of Multiquadratics

DOI10.1007/978-3-319-56620-7_2zbMath1410.11136OpenAlexW2600682596MaRDI QIDQ5738870

Tanja Lange, Henry de Valence, Christine van Vredendaal, Daniel J. Bernstein, Jens-Dietrich Bauch

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://zenodo.org/record/2594697

zbMATH Keywords

unitsideal latticespublic-key encryptionlattice-based cryptographymultiquadratic fieldssoliloquygentrySmart-Vercauteren

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Algebraic number theory computations (11Y40) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (9)

On the ring-LWE and polynomial-LWE problems ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Fast multiquadratic S-unit computation and application to the calculation of class groups ⋮ Norm relations and computational problems in number fields ⋮ Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's \(p\)-rationality conjecture ⋮ Short principal ideal problem in multicubic fields ⋮ Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus ⋮ On ideal class group computation of imaginary multiquadratic fields

Uses Software

• SageMath
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics in computational algebraic number theory
• Binary quadratic forms. An algorithmic approach
• Recent progress on the elliptic curve discrete logarithm problem
• On Lovász' lattice reduction and the nearest lattice point problem
• A modification of the LLL reduction algorithm
• Factoring polynomials with rational coefficients
• Weak Instances of PLWE
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Mathematics of Public Key Cryptography
• Cryptanalysis of the Multilinear Map over the Integers
• New techniques for computing the ideal class group and a system of fundamental units in number fields
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Über Den Bizyklischen Biquadratischen Zahlkörper
• New Multilinear Maps Over the Integers
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Candidate Multilinear Maps from Ideal Lattices
• Fully homomorphic encryption using ideal lattices
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Recovering Short Generators of Principal Ideals in Cyclotomic Rings
• Cryptography based on number fields with large regulator

This page was built for publication: Short Generators Without Quantum Computers: The Case of Multiquadratics