Abstract
The computational equivalence problem for quadratic forms is shown to be NP-hard under randomized reductions, in particular for indefinite, ternary quadratic forms with integer coefficients. This result is conditional on a variant of the Cohen-Lenstra heuristics on class numbers. Our identification scheme proves knowledge of an equivalence transform. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Hartung, R. J., & Schnorr, C. P. (2007). Public key identification based on the equivalence of quadratic forms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 333–345). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
