Cryptography Based on Quadratic Forms: Complexity Considerations

DOI10.1007/978-3-540-88353-1_5MaRDI QIDQ5504549zbMATH OpenOpenAlexFDO

Authors Rupert 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) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Computational problems of quadratic forms: complexity and cryptographic perspectives
• Public Key Identification Based on the Equivalence of Quadratic Forms
• Identification and signatures based on NP-hard problems of indefinite quadratic forms
• Binary quadratic forms. An algorithmic approach
• Smallest Reduction Matrix of Binary Quadratic Forms

Cites work

• A Simple Unpredictable Pseudo-Random Number Generator
• Class Groups of Number Fields: Numerical Heuristics
• Computing isometries of lattices
• Constructing integral lattices with prescribed minimum. I
• Hardness of approximating the shortest vector problem in lattices
• scientific article; zbMATH DE number 1722680 (Why is no real title available?)
• scientific article; zbMATH DE number 3889661 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 3613145 (Why is no real title available?)
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Introduction to quadratic forms
• Lattice basis reduction for indefinite forms and an application
• Minkowski's Convex Body Theorem and Integer Programming
• Public Key Identification Based on the Equivalence of Quadratic Forms
• Solving Bivariate Quadratic Congruences in Random Polynomial Time
• Solving quadratic equations using reduced unimodular quadratic forms
• Strengths and Weaknesses of Quantum Computing

Cited in

(5)

• Computational problems of quadratic forms: complexity and cryptographic perspectives
• scientific article; zbMATH DE number 4168790 (Why is no real title available?)
• Identification and signatures based on NP-hard problems of indefinite quadratic forms
• Multiplication and squaring in cubic and quartic extensions for pairing based cryptography
• On quadratic approximations in block ciphers

Describes a project that uses

Uses Software

• NTRUSign

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

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