Similarity between Compressed Strings
- PDF / 247,479 Bytes
- 4 Pages / 547.087 x 737.008 pts Page_size
- 45 Downloads / 219 Views
Similarity between Compressed Strings
NTL also includes an implementation of Block KorkineZolotarev reduction that has been extensively used for cryptanalysis applications.
Similarity between Compressed Strings 2005; Kim, Amir, Landau, Park
Cross References Cryptographic Hardness of Learning Knapsack Learning Heavy Fourier Coefficients of Boolean Functions Quantum Algorithm for the Discrete Logarithm Problem Quantum Algorithm for Factoring Sphere Packing Problem
JIN W OOK KIM1 , AMIHOOD AMIR2 , GAD M. LANDAU3 , KUNSOO PARK4 1 HM Research, Seoul, Korea 2 Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel 3 Department of Computer Science, University of Haifa, Haifa, Israel 4 School of Computer Science and Engineering, Seoul National University, Seoul, Korea
Recommended Reading
Keywords and Synonyms
1. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the thirtythird annual ACM symposium on theory of computing – STOC 2001, Heraklion, Crete, Greece, July 2001, pp 266–275. ACM, New York (2001) 2. Babai, L.: On Lovasz’ lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986). Preliminary version in STACS 1985 3. Cassels, J.W.S.: An introduction to the geometry of numbers. Springer, New York (1971) 4. Dinur, I., Kindler, G., Raz, R., Safra, S.: Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica 23(2), 205–243 (2003). Preliminary version in FOCS 1998 5. von zur Gathen, J., Gerhard, J.: Modern Comptuer Algebra, 2nd edn. Cambridge (2003) 6. Grotschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics, vol. 2, 2nd edn. Springer (1993) 7. Joux, A., Stern, J.: Lattice reduction: A toolbox for the cryptanalyst. J. Cryptolo. 11(3), 161–185 (1998) 8. Kannan, R.: Annual reviews of computer science, vol. 2, chap. “Algorithmic geometry of numbers”, pp. 231–267. Annual Review Inc., Palo Alto, California (1987) 9. Kannan, R.: Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415–440 (1987) 10. Khot, S.: Hardness of Approximating the Shortest Vector Problem in Lattices. J. ACM 52(5), 789–808 (2005). Preliminary version in FOCS 2004 11. Lenstra, A.K., Lenstra, Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math Ann. 261, 513–534 (1982) 12. Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston, Massachusetts (2002) 13. Nguyen, P., Stern, J.: The two faces of lattices in cryptology. In: J. Silverman (ed.) Cryptography and lattices conference – CaLC 2001, Providence, RI, USA, March 2001. Lecture Notes in Computer Science, vol. 2146, pp. 146–180. Springer, Berlin (2001) 14. Schnorr, C.P.: Fast LLL-type lattice reduction. Inform. Comput. 204(1), 1–25 (2006) 15. Vazirani, V.V.: Approximation Algorithms. Springer (20
Data Loading...
