Cryptography Based on Quadratic Forms: Complexity Considerations

DOI10.1007/978-3-540-88353-1_5zbMath1166.94313OpenAlexW1561915869MaRDI QIDQ5504549

Rupert J. Hartung

Publication date: 22 January 2009

Published in: Research in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88353-1_5

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Uses Software

• NTRUSign

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing isometries of lattices
• Lattice basis reduction for indefinite forms and an application
• Introduction to quadratic forms
• Class Groups of Number Fields: Numerical Heuristics
• Public Key Identification Based on the Equivalence of Quadratic Forms
• Hardness of approximating the shortest vector problem in lattices
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Constructing integral lattices with prescribed minimum. I
• A Simple Unpredictable Pseudo-Random Number Generator
• Solving Bivariate Quadratic Congruences in Random Polynomial Time
• Minkowski's Convex Body Theorem and Integer Programming
• Strengths and Weaknesses of Quantum Computing
• Solving quadratic equations using reduced unimodular quadratic forms

This page was built for publication: Cryptography Based on Quadratic Forms: Complexity Considerations