In this paper, we consider how to design efficient quantum algorithms by using the quantum database search algorithm designed by L. Grover, and show the following results: (1) we show how to apply an efficient quantum algorithm for finding the minimum designed by Dürr and Høyer to the shortest vector in lattice problem. The algorithm by Dürr and Høyer is designed based on Grover's algorithm, and (2) we estimate the time complexity of quantum algorithm for the collision problem, which are designed by using Grover's algorithm and various sorting algorithms.