A method for providing a virtual code, the method comprising: receiving, by a virtual code verifying means, the virtual code from a virtual code generating means, the virtual code being generated by combining a plurality of detailed codes according to a specific rule, the virtual code being a code generated in connection with a real code at a specific time; and extracting, by the virtual code verifying means, the plurality of detailed codes included in the virtual code, searching for, by the virtual code verifying means including a storage location search algorithm, a storage location of the real code based on the plurality of detailed codes by applying the storage location search algorithm, and extracting the real code from the storage location of the real code, wherein the plurality of detailed codes comprises a first code and a second code, wherein the first code and the second code are correlated and changed per time interval, and wherein the virtual code verifying means is configured to search the storage location of the real code matched with the first code and the second code by applying the storage location search algorithm, according to a specific search scheme, characterized in that the searching for the storage location of the real code comprises: if the storage location search algorithm performs rolling motion of a k-gon on a track, wherein k is M N and M and N are natural numbers, wherein k codes are sorted such that a vertex corresponds to a point where each code is arranged, performing the rolling motion of the k-gon to a point on the track, corresponding to the first code in the virtual code received from the virtual code generating means; setting a location corresponding to the first code to a search start point and searching for a storage location in an arrangement state of the k-gon based on the second code according to a search scheme applied to the second code, the storage location being matched to each vertex of the k-gon; and extracting the real code included in the storage location, and if a request to newly generate a real code in a specific count is received from a specific virtual code generating means, storing the real code in a storage location corresponding to a specific vertex of the k-gon, the specific vertex being a point where the track and the k-gon are met. receiving, by a virtual code verifying means, the virtual code from a virtual code generating means, the virtual code being generated by combining a plurality of detailed codes according to a specific rule, the virtual code being a code generated in connection with a real code at a specific time; and extracting, by the virtual code verifying means, the plurality of detailed codes included in the virtual code, searching for, by the virtual code verifying means including a storage location search algorithm, a storage location of the real code based on the plurality of detailed codes by applying the storage location search algorithm, and extracting the real code from the storage location of the real code, wherein the plurality of detailed codes comprises a first code and a second code, wherein the first code and the second code are correlated and changed per time interval, and wherein the virtual code verifying means is configured to search the storage location of the real code matched with the first code and the second code by applying the storage location search algorithm, according to a specific search scheme, characterized in that the searching for the storage location of the real code comprises: if the storage location search algorithm performs rolling motion of a k-gon on a track, wherein k is M N and M and N are natural numbers, wherein k codes are sorted such that a vertex corresponds to a point where each code is arranged, performing the rolling motion of the k-gon to a point on the track, corresponding to the first code in the virtual code received from the virtual code generating means; setting a location corresponding to the first code to a search start point and searching for a storage location in an arrangement state of the k-gon based on the second code according to a search scheme applied to the second code, the storage location being matched to each vertex of the k-gon; and extracting the real code included in the storage location, and if a request to newly generate a real code in a specific count is received from a specific virtual code generating means, storing the real code in a storage location corresponding to a specific vertex of the k-gon, the specific vertex being a point where the track and the k-gon are met. if the storage location search algorithm performs rolling motion of a k-gon on a track, wherein k is M N and M and N are natural numbers, wherein k codes are sorted such that a vertex corresponds to a point where each code is arranged, performing the rolling motion of the k-gon to a point on the track, corresponding to the first code in the virtual code received from the virtual code generating means; setting a location corresponding to the first code to a search start point and searching for a storage location in an arrangement state of the k-gon based on the second code according to a search scheme applied to the second code, the storage location being matched to each vertex of the k-gon; and extracting the real code included in the storage location, and if a request to newly generate a real code in a specific count is received from a specific virtual code generating means, storing the real code in a storage location corresponding to a specific vertex of the k-gon, the specific vertex being a point where the track and the k-gon are met.