A note on class-number one in certain real quadratic and pure cubic fields
Mathematics of Computation
Heuristics on class groups: some good primes are not too good
Mathematics of Computation
A course in computational algebraic number theory
A course in computational algebraic number theory
Lattice basis reduction for indefinite forms and an application
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Complexity of Lattice Problems
Complexity of Lattice Problems
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
NSS: An NTRU Lattice-Based Signature Scheme
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
NTRUSign: digital signatures using the NTRU lattice
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Cryptography Based on Quadratic Forms: Complexity Considerations
Research in Cryptology
| Hi-index | 0.00 |
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.