Verification of NP-Hardness Reduction Functions for Exact Lattice Problems

DOI10.1007/978-3-031-38499-8_21MaRDI QIDQ6492756

Tobias Nipkow, Author name not available (Why is that?)

Publication date: 26 April 2024

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Isabelle/HOL. A proof assistant for higher-order logic
• Approximating CVP to within almost-polynomial factors is NP-hard
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
• Concrete Semantics
• Hardness of approximating the shortest vector problem in lattices
• Lattice-based Cryptography

Related Items (1)

Formalizing Coppersmith's method in Isabelle/HOL

This page was built for publication: Verification of NP-Hardness Reduction Functions for Exact Lattice Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492756)