Public Key Identification Based on the Equivalence of Quadratic Forms

DOI10.1007/978-3-540-74456-6_31zbMath1147.94316OpenAlexW1505676972MaRDI QIDQ3525581

Rupert J. Hartung, Claus Peter Schnorr

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_31

Mathematics Subject Classification ID

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

Related Items (3)

General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Identification and signatures based on NP-hard problems of indefinite quadratic forms ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations

Uses Software

• NTRUSign

This page was built for publication: Public Key Identification Based on the Equivalence of Quadratic Forms