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 (S 1000), by the virtual code verifying means, the real code based on a correlation between the plurality of detailed codes, and wherein the plurality of detailed codes is changed per a time interval, wherein the plurality of detailed codes comprises a first code and a second code, wherein the searching for the real code comprises searching for, by the virtual code verifying means, the real code matched with a correlation between the first code and the second code by applying a predetermined search algorithm, according to a specific search scheme, characterized in that the method is further comprising: the first code or the second code of N (N is a natural number) digits is generated with M (M is a natural number) characters, a virtual code generation function comprises a first function or a second function for providing different M N codes as the first code or the second code sequentially changed per the time interval, wherein the searching for the real code comprises: when the predetermined search algorithm performs rolling motion of a k-gon on a track where k (k is M N) 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 searching for the real code stored in the storage location. 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 (S 1000), by the virtual code verifying means, the real code based on a correlation between the plurality of detailed codes, and wherein the plurality of detailed codes is changed per a time interval, wherein the plurality of detailed codes comprises a first code and a second code, wherein the searching for the real code comprises searching for, by the virtual code verifying means, the real code matched with a correlation between the first code and the second code by applying a predetermined search algorithm, according to a specific search scheme, characterized in that the method is further comprising: the first code or the second code of N (N is a natural number) digits is generated with M (M is a natural number) characters, a virtual code generation function comprises a first function or a second function for providing different M N codes as the first code or the second code sequentially changed per the time interval, wherein the searching for the real code comprises: when the predetermined search algorithm performs rolling motion of a k-gon on a track where k (k is M N) 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 searching for the real code stored in the storage location. when the predetermined search algorithm performs rolling motion of a k-gon on a track where k (k is M N) 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 searching for the real code stored in the storage location.