| CPC G06F 21/45 (2013.01) [G06F 21/31 (2013.01); H04L 63/0838 (2013.01)] | 10 Claims |

|
1. A method for providing a virtual code, the method comprising:
receiving, by a virtual code verifying device, the virtual code from a virtual code generating device, 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;
extracting, by the virtual code verifying device, the plurality of detailed codes included in the virtual code; and
searching for, by the virtual code verifying device, the real code based on a correlation between the plurality of detailed codes,
wherein the plurality of detailed codes is changed per a time interval,
wherein the virtual code verifying device and the virtual code generating device include the same virtual code generation function,
wherein the virtual code generation function includes a plurality of detailed code generation functions for generating each of the plurality of detailed codes,
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 device, 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, and
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 MN) 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 device;
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.
|