Computational problems of quadratic forms: complexity and cryptographic perspectives

MaRDI QIDQ2800008zbMATH OpenFDO

Authors Rupert Hartung

Publication date 14 April 2016

Full work available at URL http://d-nb.info/988433699/34, http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hebis:30-54444

zbMATH Keywords

Diophantine equationsquadratic formscryptographic protocolsHilbert's tenth problem

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quadratic forms over general fields (11E04) Computational number theory (11Y99) Research exposition (monographs, survey articles) pertaining to number theory (11-02)

Recommendations

• Cryptography Based on Quadratic Forms: Complexity Considerations
• Computing with quadratic forms over number fields
• scientific article; zbMATH DE number 4168790
• Cryptography in quadratic function fields
• scientific article; zbMATH DE number 195204
• Binary quadratic forms. An algorithmic approach
• The multiplicative complexity of quadratic boolean forms
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• scientific article; zbMATH DE number 176872
• Algorithms for quadratic forms over real function fields

Cited in

(5)

• Cryptography Based on Quadratic Forms: Complexity Considerations
• Smallest Reduction Matrix of Binary Quadratic Forms
• Identification and signatures based on NP-hard problems of indefinite quadratic forms
• scientific article; zbMATH DE number 1080058 (Why is no real title available?)
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography

This page was built for publication: Computational problems of quadratic forms: complexity and cryptographic perspectives

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