Article
Open Access
Identification and signatures based on NP-hard problems of indefinite quadratic forms
-
Rupert J. Hartung
Published/Copyright:
February 4, 2009
Received: 2007-12-13
Revised: 2008-09-29
Published Online: 2009-02-04
Published in Print: 2008-December
© de Gruyter 2008
Articles in the same Issue
- Another look at non-standard discrete log and Diffie-Hellman problems
- Identification and signatures based on NP-hard problems of indefinite quadratic forms
- Polylogarithmic two-round argument systems
- Minimal weight expansions in Pisot bases
- Two attacks on a sensor network key distribution scheme of Cheng and Agrawal
Keywords for this article
Identification;
signature;
indefinite quadratic forms;
NP-hardness;
proof of knowledge;
anisotropic form;
equivalence class
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- Another look at non-standard discrete log and Diffie-Hellman problems
- Identification and signatures based on NP-hard problems of indefinite quadratic forms
- Polylogarithmic two-round argument systems
- Minimal weight expansions in Pisot bases
- Two attacks on a sensor network key distribution scheme of Cheng and Agrawal
