Meta-heuristic approaches to solve shortest lattice vector problem

References

• P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134, IEEE, (1994).
   Google Scholar
• H. W. Lenstra Jr, “Integer programming with a fixed number of variables,” Mathematics of operations research, vol. 8, no. 4, pp. 538–548, (1983). doi: 10.1287/moor.8.4.538
   Web of Science ®Google Scholar
• A. Schönhage, “Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm,” in International Colloquium on Automata, Languages, and Programming, pp. 436–447, Springer, (1984).
   Google Scholar
• A. K. Lenstra, H. W. Lenstra, and L. Lovász, “Factoring polynomials with rational coefficients,” Mathematische Annalen, vol. 261, no. 4, pp. 515-534, (1982). doi: 10.1007/BF01457454
   Web of Science ®Google Scholar
• R. Kannan, “Minkowski’s convex body theorem and integer programming,” Mathematics of operations research, vol. 12, no. 3, pp. 415– 440, (1987). doi: 10.1287/moor.12.3.415
   Web of Science ®Google Scholar
• A. Shamir, “A polynomial time algorithm for breaking the basic merkle-hellman cryptosystem,” in Proceedings of 23rd Annual Symposium on Foundations of Computer Science, pp. 145–152, IEEE, (1982).
   Google Scholar
• J. Hastad, “Solving simultaneous modular equations of low degree,” siam Journal on Computing, vol. 17, no. 2, pp. 336–341, (1988). doi: 10.1137/0217019
   Web of Science ®Google Scholar
• A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and A. Shamir, “Reconstructing truncated integer variables satisfying linear congruences,” SIAM Journal on Computing, vol. 17, no. 2, pp. 262–280, (1988). doi: 10.1137/0217016
   Web of Science ®Google Scholar
• D. Coppersmith, “Small solutions to polynomial equations, and low exponent rsa vulnerabilities,” Journal of Cryptology, vol. 10, no. 4, pp. 233-260, (1997). doi: 10.1007/s001459900030
   Web of Science ®Google Scholar
• M. Bellare, S. Goldwasser, and D. Micciancio, “Pseudo-random generators within cryptographic applications: the dss case,” in Advances in CryptologyCRYPTO, vol. 97, pp. 277–291, (1997). doi: 10.1007/BFb0052242
   Google Scholar
• J. Hoffstein, J. Pipher, and J. H. Silverman, “Ntru: A ring-based public key cryptosystem,” in International Algorithmic Number Theory Symposium, pp. 267–288, Springer, (1998). doi: 10.1007/BFb0054868
   Google Scholar
• C. Gentry et al., “Fully homomorphic encryption using ideal lattices.,” in Stoc, vol. 9, pp. 169–178, (2009). doi: 10.1142/S0219493709002610
   Google Scholar
• S. Arora, L. Babai, J. Stern, and Z. Sweedyk, “The hardness of approximate optima in lattices, codes, and systems of linear equations,” Journal of Computer and System Sciences, vol. 54, no. 2, pp. 317–331, (1997). doi: 10.1006/jcss.1997.1472
   Web of Science ®Google Scholar
• M. Ajtai, R. Kumar, and D. Sivakumar, “A sieve algorithm for the shortest lattice vector problem,” in Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 601-610, ACM, (2001). doi: 10.1145/380752.380857
   Google Scholar
• C.-P. Schnorr, “A hierarchy of polynomial time lattice basis reduction algorithms,” The oretical computer science, vol. 53, no. 2-3, pp. 201-224, (1987).
   Web of Science ®Google Scholar
• P. Q. Nguyen and J. Stern, “The two faces of lattices in cryptology,” in Cryptography and lattices, pp. 146–180, Springer, (2001). doi: 10.1007/3-540-44670-2_12
   Google Scholar
• D. Micciancio, On the hardness of the shortest vector problem. PhD thesis, Massachusetts Institute of Technology, (1998).
   Google Scholar
• O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM (JACM), vol. 56, no. 6, p. 34, (2009). doi: 10.1145/1568318.1568324
   Web of Science ®Google Scholar
• R. Poli, J. Kennedy, and T. Blackwell, “Particle swarm optimization,” Swarm intelligence, vol. 1, no. 1, pp. 33–57, (2007). doi: 10.1007/s11721-007-0002-0
   Google Scholar
• V. D. Reddy, G. R. Gangadharan, and G. S. V. R. K. Rao, “Energyaware virtual machine allocation and selection in cloud data centers,” Soft Computing, pp. 1-16, (2017).
   Web of Science ®Google Scholar
• C. Jatoth and G. Gangadharan, “Qos-aware web service composition using quantum in spired particle swarm optimization,” in International Conference on Intelligent Decision Technologies, pp. 255–265, Springer, (2017).
   Google Scholar
• J. H. Holland, “Genetic algorithms,” Scientific american, vol. 267, no. 1, pp. 66–73, (1992). doi: 10.1038/scientificamerican0792-66
   PubMed Web of Science ®Google Scholar
• D. E. Goldberg, Genetic algorithms. Pearson Education India, (2006).
   Google Scholar
• J. E. Beasley and P. C. Chu, “A genetic algorithm for the set covering problem,” European journal of operational research, vol. 94, no. 2, pp. 392–404, (1996). doi: 10.1016/0377-2217(95)00159-X
   Web of Science ®Google Scholar
• L. Richard and S. Michael, “Hard lattice generator,” http://doc.sage-math.org/html/en/reference/cryptography/sage/crypto/lattice.html.
   Google Scholar