Method, device and system for verifying virtual code based on sphere

1. A method for verifying a virtual code based on a sphere, the method comprising:

a virtual code reception operation of receiving, by a virtual code verifying device, a virtual code from a virtual code generating device, the virtual code comprising a fixed code and a plurality of detailed codes; and

a storage location search algorithm selection operation of determining, by the virtual code verifying device, a group, to which the virtual code generating device belongs, through the fixed code and selecting a storage location search algorithm for the group, wherein:

the storage location search algorithm is generated for each group and is included in the virtual code verifying device,

each storage location search algorithm generated for each group has a cross-sectional shape, and each storage location search algorithm is gathered to form a single three-dimensional figure, and

the virtual code verifying device selects the storage location search algorithm by extracting a cross section corresponding to the group to which the virtual code generating device belongs from the three-dimensional figure.

2. The method of claim 1 , further comprising:

a detailed code extraction operation of extracting, by the virtual code verifying device, the plurality of detailed codes included in the virtual code; and

a real code search operation of searching for, by the virtual code verifying device, a storage location of a real code by applying the storage location search algorithm to the extracted plurality of detailed codes.

3. The method of claim 2 , wherein:

the fixed code is generated by fixing the location in the virtual code, and

the detailed code is extracted using a detailed code combination function corresponding to the selected storage location search algorithm.

4. The method of claim 3 , wherein the three-dimensional figure is cut into parallel cross sections, and is composed of a plurality of cut surfaces having different sizes.

5. The method of claim 3 , wherein the three-dimensional figure is cut into a cross section passing through the center of the figure, and is composed of a plurality of cut surfaces having different inclinations.

6. The method of claim 3 , wherein the detailed codes comprises:

a first code for setting a start point for searching for the storage location; and

a second code for setting a search path from the start point to the storage location according to a specific search scheme, and

wherein the first code and the second code is changed per unit count, and the unit count is set at a specific time interval and is changed as the time interval elapses.

7. The method of claim 6 , wherein the first code is generated based on a unit count elapsed from a time when the storage location search algorithm for the group to which the virtual code generating device belongs starts to be driven.

8. The method of claim 7 , wherein the drive start time of the storage location search algorithm is grasped by displaying an identification number of the cross section used in the storage location search algorithm in a count at which the storage location search algorithm starts to be driven on a track.

9. The method of claim 6 , wherein the second code is generated based on a unit count which elapses from a time when the real code for the virtual code generating device is newly generated.

10. The method of claim 6 , wherein the searching of the real code comprises:

if the storage location 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 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 (a storage location search operation); and

extracting the real code included in the storage location.

11. The method of claim 10 , wherein if the storage location search algorithm is a k-gon, k-gon cross sections of each different size are gathered to form a single sphere.

12. The method of claim 11 , wherein if the storage location search algorithm is a k-gon, an identification mark is provided at a vertex corresponding to a drive start time of the storage location search algorithm in a k-gon cross section used for the storage location search algorithm to grasp the drive start time of the storage location search algorithm.

13. The method of claim 10 , further comprising a real code storage operation of, if a request to newly generate a real code in a specific count is received from a specific virtual code generating device, storing the real code in a storage location corresponding to a specific vertex of the k-gon in the specific count, the specific vertex being a point where the track and the k-gon are met in the specific count.

14. The method of claim 3 , wherein the searching of the real code comprises generating a virtual track in which a cross section corresponding to a storage location search algorithm for the group is adjacent, and searching for a storage location of a real code.

15. A non-transitory computer-readable recording medium storing a computer program for verifying a virtual code based on a sphere, and configured to be coupled to a computer hardware, the program includes instructions to execute the method of claim 1 .

16. A device for verifying a virtual code based on a sphere, the device comprising:

a receiving unit configured to receive the virtual code including a fixed code and a plurality of detailed codes from a virtual code generating device; and

a storage location search algorithm selecting unit configured to determine a group to which the virtual code generating device belongs through the fixed code, and select a storage location search algorithm for the group, wherein:

the storage location search algorithm is generated for each group and is included in the virtual code verifying device,

each storage location search algorithm generated for each group has a cross-sectional shape, and each storage location search algorithm is gathered to form a single three-dimensional figure, and

the virtual code verifying device selects the storage location search algorithm by extracting a cross section corresponding to the group to which the virtual code generating device belongs from the three-dimensional figure.

17. The device of claim 16 , further comprising:

a detailed code extracting unit configured to extract the plurality of detailed codes included in the virtual code; and

a real code search unit configured to search for a storage location of a real code by applying the storage location search algorithm to the extracted plurality of detailed codes.

18. The device of claim 17 , wherein:

the fixed code is generated by fixing the location in the virtual code,

the detailed code is extracted using a detailed code combination function corresponding to the selected storage location search algorithm,

the detailed code comprises a first code and a second code,

the first code is generated based on a unit count elapsed from a time when the storage location search algorithm for the group to which the virtual code generating device belongs starts to be driven, and

the second code is generated based on a unit count which elapses from a time when the real code for the virtual code generating device is newly generated.

19. The device of claim 18 , wherein the three-dimensional figure is cut into parallel cross sections, and is composed of a plurality of cut surfaces having different sizes.

20. The device of claim 18 , wherein the three-dimensional figure is cut into a cross section passing through the center of the figure, and is composed of a plurality of cut surfaces having different inclinations.