A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
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
Strengths and Weaknesses of Quantum Computing
SIAM Journal on 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
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Public key identification based on the equivalence of quadratic forms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
We study the computational problem Trafoof finding an integral equivalence transform between two given quadratic forms. This is motivated by a recent identification scheme based on this problem [10]. We prove that for indefinite forms over 驴, its hardness is concentrated in dimensions 3 and 4. Moreover, over the field of rational numbers the complexity of Trafois closely related to that of factoring. However, for definite forms over 驴, as well as for forms over finite fields, the transformation problem is solvable in polynomial time.