KR20200038451A - System, method and program for providing virtual code, vritual code generator and vritual code verification device - Google Patents

Abstract

The present invention relates to a system, method, and program for providing a virtual code, a virtual code generation device, and a virtual code verification device. According to one embodiment of the present invention, the method, capable of retrieving an actual code based on a virtual code, comprises: a virtual code reception step (S200) of receiving a virtual code from a virtual code generation means by a virtual code verification means; a step (S400) of extracting a plurality of detailed codes included in the virtual code by the virtual code verification means; and an actual code search step (S600) of retrieving a storage location of an actual code based on the plurality of detailed codes by the virtual code verification means.

Description

Virtual code providing system, virtual code generating device, virtual code verification device, virtual code providing method and virtual code providing program {SYSTEM, METHOD AND PROGRAM FOR PROVIDING VIRTUAL CODE, VRITUAL CODE GENERATOR AND VRITUAL CODE VERIFICATION DEVICE}

The present invention relates to a virtual code providing system, a virtual code generating device, a virtual code verifying device, a virtual code providing method and a virtual code providing program, and more specifically, to generate a virtual code that is not duplicated at each time point and based on this The present invention relates to a system, method and program for searching for real code, a device for generating virtual code that does not overlap at each time point, and a device for searching for real code based on the same.

Code type data is used in many areas. Not only the card number and account number used at the time of payment, but also the IPIN number for identification of the user and the social security number are code type data.

However, many accidents are leaked in the process of using such code data. In the case of the card number, the actual card number is written on the card surface as it is, so it is visually leaked to others, and the card number is transferred to the POS device as it is when the payment is made using magnetic.

Many attempts have been made to use the virtual code to prevent the actual code from leaking, but data to identify the user was required to search for the actual code corresponding to the virtual code. For example, in the case of OTP (One Time Password), the code is changed and generated each time, but it is difficult to apply to various areas because a login procedure is required to determine the algorithm granted to the user.

Accordingly, there is a need for an invention capable of searching for real codes based on virtual codes that change in real time without providing identification information for users or devices corresponding to the real codes.

Korean Registered Patent 10-1316466 (2013.10.01)

The present invention provides a virtual code providing system, a virtual code generating device, a virtual code verifying device, a virtual code providing method and a virtual code providing program capable of searching for actual code based on the virtual code without a separate procedure for identifying the virtual code generating means Want to provide

In addition, the present invention provides a virtual code that is newly generated at a unit count interval without being duplicated within the entire cycle in all virtual code generation means. It is intended to provide a virtual code providing system, a virtual code generating device, a virtual code verification device, a virtual code providing method and a virtual code providing program.

The problems to be solved by the present invention are not limited to the problems mentioned above, and other problems not mentioned will be clearly understood by those skilled in the art from the following description.

In the method for providing a virtual code according to an embodiment of the present invention, the virtual code verification means receives the virtual code from the virtual code generation means, and the virtual code is generated by combining a plurality of detailed codes according to specific rules. Virtual code receiving step; The virtual code verification means extracting a plurality of detailed codes included in the virtual code; And a real code search step in which the virtual code verification means searches a storage location of the real code based on a plurality of detailed codes. The virtual code verification means and the virtual code generation means include the same virtual code generation function. The detailed code includes: a first code for setting a start point of a search for a storage location; And a second code for setting a search path from the starting point to the storage location according to a specific search method, wherein the first code and the second code are changed for each count, and the virtual code verification means Includes a storage location search algorithm that adjusts the storage location of the actual code to match the first code and the second code generated for each unit count, and when the virtual code normally generated for each unit count is received, the first code It characterized in that the point moved according to the search path corresponding to the second code from the starting point corresponding to the code is calculated as the storage location, the unit count is set to a specific time interval, the time interval elapses It will change as it becomes.

Further, in another embodiment, the virtual code generation function, when generating the first code or the second code of the N digits in M characters, different M ^N codes are sequentially changed for each unit count. It includes the first function or the second function provided by one code or second code.

In addition, in another embodiment, the second code is generated based on a unit count elapsed from the time when the actual code is newly generated.

In addition, in another embodiment, the actual code search step, the storage location search algorithm is a k (k is M ^N ) on the track listing the code list k k is a vertex corresponding to the point where each code is placed in the cloud If moving, moving the k-angle to a point on the track corresponding to the first code in the virtual code received from the virtual code generating means; The location corresponding to the first code is set as the search start point, and the storage location in the k-angle arrangement state is searched for based on the second code according to the search method applied to the second code. a storage location search step of matching each vertex of the k-gon; And extracting the actual code included in the storage location.

Further, according to another embodiment, when a new actual code is requested to be generated from a specific virtual code generating means, a real code is stored in a storage location corresponding to a specific vertex of a k-angle to the specific count, and the specific vertex is generated. It further comprises the step of storing the actual code, which is on the track at the specific count.

Further, in another embodiment, the virtual code generation function includes a detailed code combining function corresponding to a rule for arranging a plurality of detailed codes.

Further, in another embodiment, the virtual code further includes a fixed code for determining a group including the virtual code generation means, and the detailed code generation function has a specific listing rule that lists M characters in ascending order. Applied, the character is to include at least one of uppercase alphabet, lowercase alphabet, numbers and special characters.

Further, in another embodiment, the virtual code further includes a fixed code for determining a group including the virtual code generating means, and the detailed code extraction step extracts the fixed code from within the virtual code, And determining the group of the virtual code generation means based on the fixed code, and determining the virtual code generation function or the storage location search algorithm for the group.

Further, in another embodiment, the virtual code further includes a security code having a specific number of digits, and the generated virtual code verification means generated by the virtual code verification means and the received security code received from the virtual code generation means And determining whether the security codes match or not and verifying the virtual codes.

In addition, in another embodiment, the security code is generated by using the unique identification value and generation time data of the virtual code generation means as function values, and the virtual code verification means is generated when the actual code for the virtual code generation means is generated. And receiving and storing the unique identification value.

In another embodiment, verifying whether the virtual code verification means corresponds to the virtual code normally generated by applying the inverse function of the first function or the second function to the first code or the second code; It includes more.

In another embodiment, comparing the first received code generated according to the first function generated by the virtual code verification means and the first received code received from the virtual code generation means; If the first received code is included in an error tolerance range from the first generated code, setting the first received code as a first code as the starting point; And determining that the first received code is an abnormal code when it is out of an error tolerance range from the first generated code.

The virtual code providing program according to another embodiment of the present invention is combined with hardware to execute the aforementioned virtual code providing method, and is stored in a medium.

The virtual code generation growth value according to another embodiment of the present invention includes: a detailed code generation unit generating one or more detailed codes; A virtual code generation unit for generating the virtual code by combining the one or more detailed codes; And a virtual code providing unit outputting the virtual code to the outside to provide the virtual code to the virtual code verification device, wherein the virtual code is generated by combining a plurality of detailed codes according to specific rules. A first code for setting a search start point of a storage location in the virtual code verification device; And a second code that sets a search path from the starting point to the storage location in the virtual code verification device according to a specific search method. The first code and the second code are changed for each unit count. , The virtual code verification device includes a storage location search algorithm for adjusting the storage location of the actual code to match the first code and the second code generated for each unit count, and the virtual code normally generated for each unit count is When received, it is characterized in that a point moved along the search path corresponding to the second code from the search start point corresponding to the first code is calculated as the storage location, and the unit count is set at a specific time interval. It is set, and changes as the time interval elapses.

According to another embodiment of the present invention, a virtual code verification device includes: a reception unit that receives a virtual code from a virtual code generation device; A detailed code extraction unit for extracting a plurality of detailed codes included in the virtual code; And a real code search unit for searching a storage location of the real code based on a plurality of detailed codes, wherein the virtual code verification device and the virtual code generation growth value include the same virtual code generation function, and the virtual code Is generated by combining a plurality of detailed codes according to a specific rule, the detailed codes comprising: a first code for setting a search start point of a storage location search in an actual code search unit; And a second code for setting a search path from the starting point to the storage location in the real code search unit according to a specific search method, wherein the real code search unit is configured for each unit count in the virtual code generation device. And a storage location search algorithm that adjusts the storage location of the actual code to match the first code and the second code provided by modification, and when the virtual code normally generated for each unit count is received, corresponds to the first code. It characterized in that the point moved according to the search path corresponding to the second code from the search start point is calculated as the storage location, the unit count is set to a specific time interval, the time interval elapses It will change accordingly.

According to the present invention as described above, it has various effects as follows.

First, since virtual codes are newly generated for each unit count, and duplicate virtual codes do not appear within a predetermined period, the actual code is not leaked even when the virtual codes are leaked.

Second, since algorithms for generating virtual code and searching for real code need only be added to the virtual code generating device and the device using the actual code (for example, a financial company server, IOT device, etc.), the existing process using the actual code is maintained. You can. For example, if a smart card or an app card is provided by generating a virtual card number that is not duplicated, the POS device and the PG company server are maintained and the virtual card number is transferred to the card company server, and the card server server is assigned to the virtual card number. Payment can be performed by searching the corresponding actual card number. Through this, it is possible to minimize the portion to be changed in the existing process in order to increase security, and the user does not need to perform a separate step to improve security.

Third, there are various ways to implement the virtual code generation function, so different virtual code generation functions can be applied for each group and each application field.

1 is a configuration diagram of a virtual code providing system according to an embodiment of the present invention.
2 is a block diagram of an apparatus for generating a virtual code according to an embodiment of the present invention.
3 to 4 are configuration diagrams of a virtual code verification device according to embodiments of the present invention.
5 is a flowchart of a method for providing a virtual code according to an embodiment of the present invention.
6 is an exemplary diagram of a storage location search algorithm for searching a real code storage location through a k-shaped cloud movement according to an embodiment of the present invention.
7 is a flow chart of a method for providing a virtual code including an actual code search process according to a k-angle cloud movement according to an embodiment of the present invention.
8 is a flowchart of a method for providing a virtual code, further comprising issuing an actual code and storing it in a storage location according to an embodiment of the present invention.
9 is a flow chart of a method for providing a virtual code further comprising a virtual code verification process according to an embodiment of the present invention.
10 is a flowchart of a method for providing a virtual code further comprising a process of determining whether the virtual code is abnormal according to an embodiment of the present invention.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. Advantages and features of the present invention, and methods for achieving them will be clarified with reference to embodiments described below in detail together with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various different forms, and only the embodiments allow the publication of the present invention to be complete, and common knowledge in the art to which the present invention pertains It is provided to completely inform the person having the scope of the invention, and the present invention is only defined by the scope of the claims. The same reference numerals refer to the same components throughout the specification.

Unless otherwise defined, all terms (including technical and scientific terms) used in the present specification may be used as meanings commonly understood by those skilled in the art to which the present invention pertains. In addition, terms defined in the commonly used dictionary are not ideally or excessively interpreted unless specifically defined.

The terminology used herein is for describing the embodiments and is not intended to limit the present invention. In this specification, the singular form also includes the plural form unless otherwise specified in the phrase. As used herein, “comprises” and / or “comprising” does not exclude the presence or addition of one or more other components other than the components mentioned.

In this specification, 'letter' is a component constituting the code, and includes all or part of uppercase and lowercase alphabets, numbers, and special characters.

In this specification, 'code' means a character string.

In this specification, 'actual code' means a code actually used. For example, when the code is a card number, the actual code may be an actual card number issued to a card of a specific user by a card company.

In this specification, 'virtual code' refers to code that is temporarily generated to be linked to real code.

In this specification, 'detailed code' means some code included in the virtual code. That is, when the virtual code is generated by combining a plurality of codes separately generated, the detailed code is generated separately to mean individual codes constituting the virtual code.

In the present specification, the 'unit count' is a unit defined as being set to a specific time interval and changed as the time interval elapses. For example, one count may be set and used at a specific time interval (eg, 1.5 seconds).

In this specification, 'virtual code generation function' means a function used to generate virtual code.

In this specification, 'smart card' means a card that can be output by changing the card number.

In this specification, 'cloud movement' means that the subject rotates and performs translational motion. That is, 'cloud movement' refers to moving while performing rotational and translational motions together, and means that each point of the rotating object moves in contact with the moving axis in turn.

Hereinafter, a virtual code providing system, a virtual code generating device 100, a virtual code verification device 200, a virtual code providing method and a virtual code providing program according to embodiments of the present invention will be described in detail with reference to the drawings. .

1 is a configuration diagram of a virtual code providing system according to an embodiment of the present invention.

Referring to Figure 1, the virtual code providing system according to an embodiment of the present invention, the virtual code generation means 10 and the virtual code verification means 20 includes.

The virtual code generation means 10 serves to generate a virtual code including information that allows the virtual code verification means 20 to search the actual code. That is, the virtual code generation means 10 generates a virtual code according to the virtual code generation function. At this time, since the virtual code verification means 20 searches for the actual code based on the virtual code, the virtual code generation means 10 may not store the actual code. Through this, it is possible to prevent the actual code from leaking through hacking of the virtual code generating means 10. The detailed description of the virtual code generation function will be described later.

The virtual code verification means 20 serves to search for the actual code based on the virtual code provided from the virtual code generation means 10. The virtual code verification means 20 stores the same virtual code generation function as the virtual code generation means 10 to search for the actual code from the virtual code received from the virtual code generation means 10. A detailed description of how the virtual code verification means 20 searches for the actual code based on the virtual code will be described later.

In addition, the virtual code verification means 20 serves to verify whether the virtual code is normally generated code in the virtual code generation means 10. A detailed description of how the virtual code verification means 20 determines whether the virtual code is normal will be described later.

The virtual code verification means 20 may receive the virtual code from the virtual code generation means 10 through various methods. In one embodiment, the virtual code verification means 20 may receive the virtual code from the virtual code generation means 10 through wireless communication. In addition, in another embodiment, the virtual code verification means 20 may receive the virtual code generated by the virtual code generation means 10 and provided to the user directly from the user.

In addition, in another embodiment, the virtual code verification means 20 may be received from another server that has received the virtual code from the virtual code generation means 10. For example, if the virtual code generation means 10 is a payment card, the virtual code is a virtual card number replacing a real card number, and the virtual code verification means 20 is a card company server including a virtual code generation function, the virtual code When payment is performed at the POS with the card as the generating means 10, the virtual code verification means 20 receives the virtual card number (ie, virtual code) from the PG company server that received the virtual card number from the POS. That is, the virtual code verification means 20 (that is, the card company server) may receive the virtual card number from the virtual code generation means 10 using the existing payment process instead of the actual card number.

In addition, in one embodiment, the virtual code verification means 20 and the virtual code generation means 10 include the same virtual code generation function. As the virtual code verification means 20 and the virtual code generation means 10 include the same virtual code generation function, the virtual code verification means 20 includes a plurality of detailed codes in the virtual code generated by the virtual code generation means 10. Can extract properly. Further, the virtual code verification means 20 may verify whether the received virtual code is generated and received by the normal virtual code generation means 10. That is, the code received from the virtual code generating means 10 (ie, the virtual code or the specific detailed code) is generated under the same conditions as the virtual code generating means 20 and the virtual code generating means 10 (ie , Virtual code or specific detailed code) to perform verification according to the spring.

2 is a configuration diagram of a virtual code generation device 100 according to another embodiment of the present invention.

2, the virtual code generating apparatus 100 according to another embodiment of the present invention, the detailed code generating unit 110; Virtual code generation unit 120; And a virtual code providing unit 130.

The virtual code generating device 100 according to embodiments of the present invention may be a device in which a program corresponding to the virtual code generating means 10 is embedded or a program corresponding to the virtual code generating means 10 is installed. . For example, when the virtual code is a virtual card number, the virtual code generating device 100 may be a smart card in which a program corresponding to the virtual code generating means 10 is embedded. Further, for example, when the virtual code is a virtual card number, the virtual code generating device 100 may be a mobile terminal in which an app card application corresponding to the virtual code generating means 10 is installed. In addition, for example, when the virtual code is a virtual authentication key for an Internet of Things (IOT) device, the virtual code generating device 100 controls a program corresponding to the virtual code generating means 10 embedded. It may be a device (eg, a remote control). The virtual code generation device 100 may be applied to various cases in which a virtual code needs to be generated and transmitted to another device (for example, another device or server) other than the above-described examples.

The virtual code generator 120 combines one or more detailed codes to generate virtual codes. In one embodiment, the virtual code is generated by combining a plurality of detailed codes according to specific rules. The virtual code generation function includes a rule for combining a plurality of detailed codes (that is, a detailed code combining function).

Various methods can be applied as a method of generating a single virtual code by combining a plurality of detailed codes. As an example of the detailed code combining function, the virtual code generation unit 120 may generate a virtual code by alternately arranging the N-digit first code and the N-digit second code. Further, as another example, the detailed code combining function may be a function that combines the second code after the first code. As the number of detailed codes included in the virtual function increases, the detailed code combining function may be variously generated.

The detailed code generator 110 serves to generate one or more detailed codes. The virtual code generation function includes each detailed code generation function. For example, the virtual code generation function generates a plurality of detailed codes using a plurality of detailed code generation functions, and generates a virtual code using a detailed code combining function that combines a plurality of detailed codes.

In one embodiment, the detailed code generation unit 110 includes the first and second functions as the detailed code generation function, and generates the first code and the second code. The first code and the second code have a correlation for searching the storage location of the actual code in the virtual code verification means 20, but the virtual code generation device 100 generates the first code to increase security. Only the second function for generating the first function and the second code is included as the detailed code generation function, and data for the correlation between the first code and the second code may not be included.

Further, in another embodiment, the virtual code may include an unchanged fixed code for distinguishing a group together with a plurality of detailed codes. The virtual code verification means 20 may include several virtual code generation functions corresponding to several groups, and when a virtual code is received from the virtual code generation device 100, the virtual code generation device 100 belongs to the group to which the corresponding virtual code generation device 100 belongs. The actual code search should be performed based on the virtual code generation function. If the fixed code is not included and the entire code includes only the detailed code that is newly generated each time a unit count passes, the group to which the virtual code generating device 100 belongs cannot be determined without additional information. Therefore, the virtual code generation device 100 includes a fixed code that does not change to identify a group.

For example, if the actual code is a real card number, and a virtual code generation function is assigned to each card type of a specific card company, the virtual code generation device 100 fixes the first six digits of the card number indicating the card company and the card type. By using it as a code, the virtual code verification means 20 can identify a specific card type of a specific card company to which the same virtual code generation function as the virtual code generation device 100 is applied.

In addition, for example, when the resident registration number is the actual code and people who have the same date of birth are judged as the same group, the virtual code generation device 100 sets 6 digits corresponding to the date of birth among the 13 digits of the resident registration number as fixed codes. , The remaining 7 digits can be newly generated for each unit count based on the virtual code generation function. The virtual code verification means 20 receives the virtual code and determines the group based on six fixed digits.

In addition, in one embodiment, the virtual code further includes a security code. For example, the virtual code includes a plurality of detailed codes and security codes. The security code is a code generated based on a specific security code generation function, and is used to verify whether it is a normal virtual code. The security code generation function uses a unique value of time data and virtual code generation means as a function value to generate a security code of a specific digit.

An example of the process of determining whether the virtual code is normal using the security code is as follows. The virtual code verification means 20 receives the unique value of the virtual code generation device 100 (for example, the unique value of the chip in the smart card or the unique value of the smartphone on which the app card is installed) when issuing the actual code. It can be stored together in a code storage location or in a separate storage space connected to the actual code storage location. When the virtual code generation device 100 generates the virtual code combined with the security code and provides it to the virtual code verification means 20, the virtual code verification means 20 receives the time data generated by the virtual code based on the detailed code. Acquiring, extracting the unique value of the specific virtual code generation device 100 stored therein and applying the time data together with the security code generation function to calculate the security code. The virtual code verification means 20 matches the security code (i.e., the generated security code) calculated by the security code generation function stored therein and the security code (i.e., the received security code) received from the virtual code generation device 100. Judge. If the received security code and the generated security code match, the virtual code verification means 20 determines the normal virtual code and provides the actual code.

For example, if the actual code is a number included in the card (for example, the card number, expiration date, and card security number) (ie, the virtual code generation device is a smart card), the security code is the card security number. Can be created. That is, the virtual code generation device 100 generates a 3 or 4 digits corresponding to the card security number as a security code using the security code generation function, and inputs the security code as the card security number when the card is used. The verification means 20 performs a process of verifying the security code.

Also, as another example, the security code generation function may generate codes of different digits (where l is a natural number) for each count and apply them together as a function value. That is, the security code generation function may include a l-digit random code generation function.

In addition, in one embodiment, when the virtual code is generated in a combination according to a specific rule of the first code and the second code, the first code and the second code serve as respective roles for searching the storage location where the actual code is stored. Can be done. For example, the first code sets the starting point of the search for a storage location, and the second code sets the search path from the starting point to the storage location according to a specific search method. That is, when the virtual code generated normally for each unit count is provided from the virtual code generation device 100, the virtual code verification means 20 is based on the search path corresponding to the second code from the search start point corresponding to the first code The moved point is judged as the storage location of the actual code. A specific method of searching a storage location based on the first code and the second code constituting the virtual code will be described later.

As an embodiment of the method in which the detailed code generation unit 110 generates detailed codes, the detailed code generation unit 110 generates new detailed codes for each unit count, and accordingly, the virtual code generation unit 100 generates unit codes. Each time a new virtual code is created. Virtual codes newly generated for each unit count are not duplicated. Specifically, the detailed code generation unit 110 not only does not generate duplicate codes generated for each unit count for a specific user or a specific virtual code generation device 100 for a predetermined period of time, but also between users belonging to a specific group. It is set not to be duplicated.

In a specific embodiment of preventing duplicate generation of virtual codes, when generating the first code or the second code of N digits with M characters, the detailed code generation functions included in the virtual code generation function are M ^N The code can be generated as the first code or the second code, and each code is matched for each count from the initial time at which the detailed code generation function is driven. For example, when the unit count is set to 1 second, different M ^N codes are matched every second from the time when the detailed code generation function is first driven. In addition, the period of time using the specific detailed code generation function or the period of use of the virtual code generation apparatus 100 (for example, the validity period of the smart card generating the virtual card number) corresponds to the length of time corresponding to the M ^N count (eg For example, if 1 count is 1 second, if the length is set to a time length shorter than M ^N seconds), the same code is not duplicated during the use cycle of the first code or the second code. That is, when the count increases with time, when the user makes a virtual code generation request to the virtual code generation device 100 at a specific time, the virtual code generation device 100 matches the count corresponding to the specific time The generated code value can be generated as the first code or the second code.

As another specific embodiment of preventing duplicate generation of the virtual code, a function for generating the first code or the second code when the use cycle of the virtual code generation device 100 has elapsed (that is, the first function or the second function) ) Or the matching relationship between the first code and the second code to create a virtual code different from the previous use cycle. When the first code generated by the first function and the second code generated by the second function are combined when the virtual code is generated by the first function, if the first code generation function or the second code generation function is changed, the virtual code generation device 100 ) May be applied to a new use cycle using a virtual code generation function that generates a different virtual code from the previous cycle as the order in which the first code or the second code appears is different from the previous use cycle. In addition, the virtual code generation device 100 prevents the same code as the virtual code used in the previous use cycle from appearing as the virtual code of each count in the new use cycle (ie, the first code and the first code generated according to the first function). The first function and the second function may be selected so that the matching relationship of the second code generated according to the 2 function is not included among the matching relationships included in the previous use cycle at all counts of the new use cycle. That is, after the usage cycle that can apply M ^N codes once, the virtual code generation function of a new usage cycle that does not generate a virtual code that overlaps the previous usage cycle is applied through adjustment or update of the virtual code generation function. You can.

At this time, the virtual code generation means 10 and the virtual code verification means 20 may store rules for updating the virtual code generation function. That is, the virtual code generation means 10 and the virtual code verification means 20 may store a sequence or rules for applying a plurality of first and second functions to each use cycle.

In addition, as another specific example of preventing duplicate generation of the virtual code, either the first code or the second code included in the virtual code is not generated between users belonging to the same group at the same time. At least, each virtual code generation device 100 may be generated by reflecting a value (that is, a device identification value) that is always different at the same time. In one embodiment, the device identification value is a time point when a specific virtual code generation device 100 is included in a group to which a specific detailed code generation function is applied (for example, a specific detailed code generation function in the virtual code verification means 20). It may be a time (or count) that has elapsed from the first time when the detailed code generation function starts to be applied to the specific virtual code generation device 100 after a specific time has elapsed. When a plurality of virtual code generating devices 100 are included in one group, if the counts for setting the virtual code generating devices 100 to belong to the corresponding group are not the same (that is, the virtual code generating devices 100) If it is impossible to belong to the group at the same time), the time elapsed from the time (or count) when the virtual code generation device 100 belongs to the group to a specific time point is different for each virtual code generation device 100. Therefore, at least one of the detailed code generation functions uses the elapsed time from the time (or count) at which the virtual code generation device 100 belongs to the group to a specific time as a device identification value, and each virtual The virtual code generated by the code generating device 100 may be different. Through this, the virtual code verification means 20 may enable the discrimination of the virtual code generation device 100 only by receiving the virtual code without separately receiving data for distinguishing the user.

For example, in the case of a card (for example, a smart card or an app card) capable of changing a card number to which the virtual code generating device 100 is output, a specific card type of a specific card company is set as one group, A specific virtual code verification means 20 in the card company server is driven for the group. The first user requests card issuance to the first virtual code generating device 100 (that is, the first user's virtual code generating device 100) at a time elapsed by A time from when the virtual code verification means 20 is driven. And the second virtual code generation device 100 (that is, the second virtual code generation device 100) at the time when the second user has elapsed B (B is a value greater than A) time from when the virtual code verification means 20 is driven. )), The first virtual code generation device 100 and the second virtual code generation device 100 request the virtual code generation from the first user and the second user C (C is greater than B) Value) The length of time elapsed from the time of card issuance at time is always different. Accordingly, the detailed code generation function may prevent the same virtual card number from being generated at the same time by applying the length of time elapsed from the time the card is issued to each virtual code generation device as a variable.

In addition, since the length of time elapsed from the time when the specific virtual code generating device 100 belongs to a specific group continues to increase with time, the detailed code generated by the specific virtual code generating device 100 (for example, , The second code) does not generate the same value, but continues to generate different values.

In addition, as another specific embodiment of preventing duplicate generation of the virtual code, the first code is the first function within the virtual code verification means 20 so that the duplicated virtual code is not generated regardless of the user in the entire cycle. Set the code value corresponding to the point (or count) at which the virtual code generation request was made from among the codes matched for each count from the initial time point at which is driven, and the second code is always different at the same time point for each virtual code generating device 100. It can be set as a code value generated by reflecting the existing value (ie, device identification value), and the virtual code can be used as a code value in which the first code and the second code are combined. The first code is a different code value for each count, and the second code has a different code value for each virtual code generation device 100 at the same time, so that the virtual code combined with the first code and the second code is all virtual code. Different code values are output at all times with the generator 100.

In addition, in another embodiment, the virtual code generation function (or detailed code generation function) is applied to any one of a number of rules for listing M characters in ascending order. That is, the virtual code generation device 100 (that is, the virtual code generation means 10) can be applied by variously applying the rules for listing the M characters in ascending order to the detailed code generation function included in the virtual code generation function. . For example, the list rule for listing alphabetic capital letters in ascending order is: A, B, C, ... It can be in Z order, A, C, B,… , Z order. As the ordering rules in the virtual code generation function are changed, the order in which codes are matched in turn for each count is changed from the initial time when the virtual code generation function is started. The virtual code verification means 20 may store codes generated according to the same listing rule for each count, or include the same listing rule itself as a virtual code generation function. Therefore, it is possible to have different virtual code generation functions for each group, including different detailed code combining functions for each group, or different character list rules.

The virtual code providing unit 130 serves to output the virtual code to the virtual code verification device 200 to the outside. The virtual code providing unit 130 may include various configurations capable of providing the virtual code to the outside. The virtual code providing unit 130 includes a wireless communication module; Short-range communication module; IC chip; Magnetic field generating unit; It includes all or part of a display unit or the like.

The wireless Internet module refers to a module for wireless Internet access, and may be built in or external to the mobile terminal 100. Wireless Internet technology includes Wireless LAN (WLAN) (Wi-Fi), Wibro (Wireless broadband), Wimax (World Interoperability for Microwave Access), HSDPA (High Speed Downlink Packet Access), LTE (long term evolution), LTE-A (Long Term Evolution-Advanced) may be used.

The short-range communication module refers to a module for short-range communication. Bluetooth, Bluetooth, Low Energy (BLE), Beacon, Radio Frequency Identification (RFID), Near Field Communication (NFC), Infrared Data Association (IrDA), UWB (Ultra Wideband), ZigBee, or the like can be used.

The virtual code providing unit 130 may include a magnetic field generator or an IC chip when the virtual code generating device 100 corresponds to a card that delivers a virtual code (ie, a virtual card number) to a POS device. The magnetic field generating unit outputs card data in the form of a magnetic signal and transmits the card data to the card reader. The magnetic field generating unit may include at least one magnetic cell that forms a magnetic field through a current flow and outputs a card information magnetic signal. The magnetic field generating portion may be provided to be exposed on the upper or lower surface of the PCB plate along the long side adjacent to a particular long side of the PCB plate of the card.

The IC chip can be mounted on a PCB board to contact the terminals of the IC card reader to perform data exchange. That is, the IC chip transfers the virtual code generated by the virtual code generator 120 to the IC-type card reader.

The display unit includes a liquid crystal display, a thin film transistor-liquid crystal display, an organic light-emitting diode, a flexible display, and e-paper. It may include at least one.

The display unit visually outputs the virtual code generated by the virtual code generating unit 120 to the outside. Through this, the user of the virtual code generation device 100 can visually check the virtual code generated in real time, and directly input the virtual code visually confirmed in the virtual code verification means 20.

In addition, the user can transmit the virtual code displayed on the display unit through various paths such as a text message. Rather than transmitting the actual code, the virtual code verification means 20 transmits a virtual code (specifically, a code that is continuously changed and generated) to search for the actual code. Therefore, when a user sends a code through a text message or the like You can avoid worrying about the actual code leak.

3 is a configuration diagram of a virtual code verification device 200 according to an embodiment of the present invention.

3, the virtual code verification apparatus 200 according to another embodiment of the present invention, the virtual code receiving unit 210; Detailed code extraction unit 220; And an actual code search unit 230. The virtual code verification device 200 may be an electronic device or a server device. For example, the virtual code verification device 200 may correspond to an IOT device connected to a control device (that is, the virtual code generation device 100) that generates and transmits virtual code replacing the actual code. The IOT device searches for a storage location of the real code based on the virtual code, and can be operated when the real code is extracted from a specific storage location.

Further, for example, the virtual code verification device 200 may be a card company server that receives a virtual card number for a specific type of card of a specific card company owned by a specific user and searches for an actual card number to perform payment. Specifically, in the case of card payment, the virtual code verification device 200 receives the virtual code generated by the virtual code generation device 100 through the POS device and the PG company server.

The virtual code receiving unit 210 serves to receive the virtual code from the virtual code generating device 100. In one embodiment, the virtual code receiving unit 210 may receive a virtual code through the wireless communication from the virtual code generation device 100, including a wireless communication unit (for example, a wireless communication module or a short-range communication module). . Further, according to another embodiment, the virtual code receiving unit 210 may receive the virtual code generated by the virtual code generating device 100 through communication with another server.

In addition, in another embodiment, the virtual code receiving unit 210 may be a user input unit. That is, the virtual code receiving unit 210 may directly receive a virtual code visually output from the virtual code generating device 100 from the user. For example, if the virtual code generation device 100 is a device that generates a virtual card number and outputs it on a card surface (for example, a smart card), the user is visually displayed on the virtual code generation device 100. The code can be checked and directly input to the user input unit of the virtual code verification device 200.

Specifically, the virtual code generation device 100 includes a display unit in 16 digits of the card number that can be changed (for example, the digits excluding the last 6 digits and the last 6 digits to determine the card company and card type), and the virtual code When is generated, it prints a character in place of a mutable code. The user may input the unchanged code and the entire changed code as virtual codes to the user input unit (that is, the virtual code receiving unit 210) of the virtual code verification device 200.

The detailed code extraction unit 220 extracts a plurality of detailed codes included in the virtual code. The virtual code is generated by combining a plurality of detailed codes according to specific rules. The detailed code extraction unit 220 of the virtual code verification device 200 includes the same detailed code combination function as the virtual code generation device 100 of a specific group, and the detailed code extraction unit 220 applies the detailed code combination function Thus, a plurality of detailed codes can be extracted from the virtual code. For example, when the virtual code generation device 100 generates a virtual code in which two detailed codes (ie, first and second codes) are combined, the detailed code extraction unit 220 arranges characters in the virtual code The first code and the second code can be separated by applying the detailed code combining function.

The actual code search unit 230 searches the storage location of the actual code based on the plurality of detailed codes. Various methods may be applied as a method in which the actual code search unit 230 searches the actual code storage location based on each detailed code. The actual code search unit 230 may include a correlation between the detailed codes in order to search the storage location based on the plurality of detailed codes.

When the virtual code is composed of the first code and the second code, in one embodiment having a correlation between detailed codes, the actual code search unit 230 determines a search start point corresponding to the first code, and searches From the starting point, the point moved along the search path corresponding to the second code can be found as the storage location of the actual code. That is, the detailed code may include a first code for setting a start point of a search for a storage location and a second code for setting a search path from the start point to the storage location according to a specific search method.

Further, in another embodiment, as the virtual code generation means 10 (or virtual code generation device 100) provides new virtual codes for each unit count, the virtual code verification device 200 is configured to search for a storage location. The first code and the second code change each time the unit count elapses. The virtual code verification device 200 may set a search start point and a search path based on the first code and the second code that are changed for each count to search the storage location of the actual code.

In addition, in another embodiment, the actual code search unit 230 may include a storage location search algorithm to find the storage location of the actual code by using a plurality of detailed correlation codes. The storage location search algorithm is an algorithm that enables a storage location search when each detailed code included in the virtual code is applied. For example, if a first code for determining a search start point of a storage location from a virtual code and a second code for suggesting a storage location direction from the search start point are included, the storage location search algorithm corresponds to the first code. When the direction corresponding to the second code is indicated at the point, it is an algorithm that adjusts the storage location to match the actual code at the corresponding location. By using the storage location search algorithm, the virtual code verification device 200 can find the actual code storage location or a point matching the storage location even if the first and second codes included in the virtual code are changed. Various methods can be applied to the storage location search algorithm, and specific examples will be described later. However, the storage location search algorithm is not limited to the example described below.

For example, as described below, referring to FIG. 6, the storage location search algorithm is a k-angle (k is M ^N ) in which a cloud moves along a track in which M ^N codes corresponding to the first code are listed, and k-angle When the vertices of the knot move while corresponding to the point where the code is placed on the first code track, each vertex of the k-angle is matched with the actual code storage location, and the first code track (ie, the first track) and the k-gon The corresponding point may be a starting point for searching for a storage location corresponding to the first code. At this time, the actual code search unit 230 may apply a cloud movement to the k-angle so that the vertex of the k-angle is in contact with the point corresponding to the first code extracted from the detailed code extraction unit 220. Through this, the actual code search unit 230 is the angle corresponding to the second code at the position on the first track in contact with the k-angle (for example, a specific angle of 180 degrees divided into M ^N pieces toward the vertex of the k-angle) ), It is possible to search for a vertex of a k-gon, which is a storage location where a real code corresponding to a virtual code is stored.

Specifically, as shown in FIG. 6, the virtual code verification device 200 moves the k-angle to a cloud corresponding to the first code (ie, each vertex of the k-angle and each point on the track come in contact with each other in turn). ). Thereafter, the virtual code verification device 200 instructs an angular direction corresponding to the second code and searches for a vertex corresponding to the storage location. For example, since the virtual code generation means B has passed 2 counts after issuing the actual code, the virtual code generation means B generates the second code applying the 2 counts as a function value and provides it as the virtual code verification means. The virtual code verification means matches and stores the second code generated by the second function for each count at the angle from the point where the track meets the angle to the vertex at the point where the track touches (that is, the second code to which the n count is applied). As the cloud moves as much as n counts of, it is stored by matching the angle toward the n-th vertex where the cloud is moved). Therefore, the virtual code verification means applies the angle corresponding to the second code to the first code correspondence point to the actual code storage location. Search for the vertex of the corresponding k-gon.

In another embodiment, as shown in FIG. 4, the virtual code verification device 200 further includes a virtual code verification unit 240. The virtual code verification unit 240 serves to determine whether or not the virtual code received by the virtual code verification device 200 is authentic.

5 is a flowchart of a method for providing a virtual code according to an embodiment of the present invention.

Referring to Figure 5, the method for providing a virtual code according to an embodiment of the present invention, the virtual code verification means 20 receiving a virtual code from the virtual code generating means 10 (S200; virtual code receiving step) ; The virtual code verification means 20 extracting a plurality of detailed codes included in the virtual code (S400); And the virtual code verification means 20 searching for a storage location of the actual code based on a plurality of detailed codes (S1000; actual code search step). Hereinafter, detailed description of each step will be described. However, in the process of describing the virtual code generation device 100 and the virtual code verification device 200, detailed disclosure of the above-described contents will be omitted.

The virtual code verification means 20 receives the virtual code from the virtual code generation means 10 (S200; virtual code reception step). The virtual code is generated in the virtual code generation device 100 (or virtual code generation means 10) and provided to the virtual code verification means 20.

The virtual code generated by the virtual code generating means 10 may be composed of a plurality of detailed codes. In one embodiment, the virtual code may be generated by combining the first code and the second code. The first code and the second code are used to search for the location of the actual code in the virtual code verification means 20, respectively. For example, the first code is a code that sets the starting point of the actual code storage location search in the virtual code verification means 20, and the second code is a search path from the starting point to the storage location according to a specific search method. It can be a code to set.

The search method may be determined by a storage location search algorithm. A detailed description of the search method determination will be described in detail in the actual code search step (S1000) described later.

Further, in another embodiment, the virtual code generation function, when generating the first code or the second code of the N digits in M characters, different M ^N codes are sequentially changed for each unit count. It includes the first function or the second function provided by one code or second code. That is, the first function or the second function is a function for generating M ^N codes not to overlap as the count increases, and generates a specific one of the M ^N codes as the first code or the second code in the count corresponding to a specific time point. do. Through this, the virtual code generating means 10 does not duplicate the same first code or second code in the M ^N count (ie, the length of time corresponding to the M ^N counts) and generates new detailed codes for each unit count (ie, First code or second code) to generate a new virtual code for each unit count.

Specifically, the virtual code generation function uses M ^N codes as the first code or the second code by generating the first code or the second code of N digits in M characters. Each count is matched from the initial point at which the code generation function is driven. For example, when the unit count is set to 1 second, different M ^N codes are matched every second from the time when the detailed code generation function is first driven. In addition, the period of time using the specific detailed code generation function or the period of use of the virtual code generation apparatus 100 (for example, the validity period of the smart card generating the virtual card number) corresponds to the length of time corresponding to the M ^N count (eg For example, if 1 count is 1 second, if the length is set to a time length shorter than M ^N seconds), the same code is not duplicated during the use cycle of the first code or the second code. That is, when the count increases with time, when the user makes a virtual code generation request to the virtual code generation means 10 at a specific time, the virtual code generation device 100 matches the count corresponding to the specific time The generated code value can be generated as the first code or the second code.

Further, in another embodiment, at least one of the first code or the second code included in the virtual code is generated for each virtual code generation means 10 so that the same virtual code is not generated between users belonging to the same group at the same time. In can be generated by reflecting a value (ie, device identification value) that is always different at the same time. That is, when a virtual code issuance is requested from a plurality of virtual code generation means 10 belonging to a group at a specific time, each virtual code generation at each time point causes each virtual code generation means 10 to generate a different virtual code. Different first codes or second codes are generated by reflecting different values assigned to the means 10.

As an example, the device identification value is a starting point (for example, the virtual code verification means 20 operates a specific detailed code generation function) in which a specific virtual code generation means 10 is applied to a group to which a specific detailed code generation function is applied. It may be a time (or count) that has elapsed from the first time point when the specific code generation function starts to be applied to the specific virtual code generation device 100 after a specific time has elapsed. When a plurality of virtual code generating means 10 are included in one group, if the counts for setting the virtual code generating means 10 to belong to the group are not the same (that is, the virtual code generating means 10) If the group cannot be registered at the same time), the time elapsed from the point (or count) when the virtual code generation means 10 belongs to the group to a specific point in time is different for each virtual code generation device 100. do. For example, when a group participation request is simultaneously received from a plurality of virtual code generation means 10 (for example, when a request for issuing a specific card type of a specific card company is received at the same time), the virtual code verification means 20 The group participation request received from the plurality of virtual code generation means 10 at the same time may be assigned as an order according to a predetermined condition to process the request as a different count.

For example, when the virtual code is generated from the combination of the first code and the second code, the virtual code generation function may cause the second code to be generated based on the unit count elapsed from the time when the actual code is newly generated. .

Therefore, at least one of the detailed code generation functions uses the elapsed time from the time (or count) at which the virtual code generation device 100 belongs to the group to a specific time as the device identification value, and each virtual The virtual code generated by the code generating device 100 may be always different. Through this, the virtual code verification means 20 can be distinguished from the virtual code generation means 10 only by receiving the virtual code without separately receiving data for distinguishing the user.

In addition, since the length of time elapsed from the time when the specific virtual code generating device 100 belongs to a specific group continues to increase with time, the detailed code generated by the specific virtual code generating device 100 (for example, , The second code) does not generate the same value, but continues to generate different values.

In addition, in another embodiment, the first code is requested to generate a virtual code among codes matched for each count from the initial time at which the first function is driven so that duplicate virtual codes are not generated regardless of the user in the entire cycle. Set to a code value corresponding to a time point (or count), and the second code is a code value generated by reflecting a value (that is, a device identification value) that is always different at the same time point for each virtual code generating device 100 Set and use the virtual code as a code value in which the first code and the second code are combined. The first code has a different code value for each count, and the second code has a different code value for each virtual code generating device 100 at the same time, so that the virtual code combining the first code and the second code generates a virtual code. Different code values are output regardless of the device 100 and the viewpoint.

Further, in another embodiment, the virtual code generation function includes a detailed code combining function corresponding to a rule for arranging a plurality of detailed codes. That is, the virtual code generation function may have specific rules for arranging or arranging characters included in a plurality of detailed codes. Accordingly, in the case of the virtual code generation means 10 and the virtual code verification means 20 including the same virtual code generation function, the virtual code generation means 10 combines the characters included in the plurality of detailed codes into detailed code functions. Arranged according to, and the virtual code verification means 20 can separate individual detailed codes from the virtual codes using the same detailed code combining function.

In addition, in another embodiment, the virtual code generation function may be applied to any one of a number of rules for listing M characters in ascending order. That is, the virtual code generation function may be applied to various sorting rules for listing M characters in ascending order, and may be classified into different virtual code generation functions according to the applied sorting rules.

The virtual code verification means 20 receives the virtual codes generated by the virtual code generation means 10 in various ways. That is, various methods for providing virtual codes of the above-described virtual code generation device 100 may be applied.

The virtual code verification means 20 extracts a plurality of detailed codes included in the virtual code (S400). As the virtual code verification means 20 includes a virtual code generation function included in the virtual code generation means 10, a plurality of detailed codes are combined by applying the same rules (that is, detailed code combining functions). Extract the detailed code. That is, the detailed code combination function corresponds to a rule for arranging a plurality of detailed codes, and is included in the virtual code generation function.

Further, according to another embodiment, when the virtual code includes a fixed code for determining a group including the virtual code generating means 10, the detailed code extraction step (S400) extracts the fixed code within the virtual code. Extracting, and determining the group of the virtual code generation means based on the fixed code, and determines the virtual code generation function or the storage location search algorithm for the group. That is, when the virtual code generation function or the storage location search algorithm is applied differently for each group, the virtual code verification means 20 distinguishes the group based on the fixed code in the virtual code.

Also, the process of determining the virtual code generation function using the fixed code may be performed before the process of extracting a plurality of detailed codes. When the virtual code generation function is determined by the fixed code, the detailed code combination function included in the virtual code generation function is determined to extract a plurality of detailed codes.

To this end, the fixed code can be coupled to a fixed position in the virtual code (for example, a certain number of digits in the front of the virtual code) so that the virtual code verification means 20 can easily separate it without a separate function. have.

The virtual code verification means 20 searches the storage location of the actual code based on the plurality of detailed codes (S1000; actual code search step). The plurality of detailed codes have a correlation with each other, and the virtual code verification means 20 searches the actual code storage location based on the correlation between the detailed codes.

In addition, in one embodiment, a plurality of detailed codes in the virtual code are generated for each unit count, and the code generated is changed (for example, if the virtual code is composed of two detailed codes, the first code and the second code are for each unit count) Change), and the virtual code verification means 20 matches the changed first code and second code to the point matched with the actual code storage location so that even if the virtual code is changed for each unit count, the actual code storage location can be searched. Adjust it for each unit count to the desired position.

As an embodiment of the correlation between the detailed codes constituting the virtual code, when the virtual code is composed of a combination of the first code and the second code, the virtual code verification means 20 searches for the first code starting point (ie , Starting point of the search for the actual code storage location), and applying the second code as a path to move to the storage location from the search starting location. That is, when the virtual code normally generated for each unit count is received, the virtual code verification means 20 moves the search point moved from the starting point corresponding to the first code according to the search path corresponding to the second code to the actual code. It is determined as a storage location or a point matched to the storage location (for example, a storage space matched with a search point on a separate server).

In one embodiment, when the second code includes all information on the path from the search start point corresponding to the first code to the storage location, the virtual code verification means 20 starts the search corresponding to the first code From the point, according to the search path corresponding to the second code, a point matching the actual code storage location or the storage location can be found.

In another embodiment, the virtual code verification means 20 may include a storage location search algorithm that adjusts the storage location of the actual code per unit count in accordance with the virtual code. That is, the virtual code verification means 20 includes a storage location search algorithm that adjusts a search path to a point that matches the actual code storage location for each unit count. When the first code and the second code are changed for each unit count, the virtual code verification means 20 may adjust the storage location search algorithm in accordance with the changed first code and the second code. The storage location search algorithm may be implemented in various forms.

In one embodiment, as shown in FIG. 7, the storage location search algorithm may be a cloud movement as k vertices correspond to vertices at a point where k (k is M ^N ) codes are listed. . At this time, in the actual code search step (S1000), the virtual code verification means 20 clouds the k-angle to a point on the track corresponding to the first code in the virtual code received from the virtual code generation means 10. Moving step (S1010); Set a location corresponding to the first code as a starting point, and search for a storage location in a k-angle arrangement state or a location where the storage location is matched based on the second code according to the search method applied to the second code. Step (S1020; storage location search step); And extracting the actual code included in the storage location (S1030).

The virtual code verification means 20, as shown in FIG. 6, moves the k-angle to a point on the track corresponding to the first code in the virtual code received from the virtual code generation means 10 (S1010). The storage location search algorithm is a k-angle (k is M ^N ) that moves along the track where M ^N codes corresponding to the first code are listed, and the vertex of the k-angle is located at the point where the code is placed on the first code track. Move in response. At this time, the virtual code verification means 20 may apply a cloud movement (or cloud movement) to the k-angle so that the vertex of the k-angle is in contact with the point corresponding to the first code.

As shown in FIG. 6, the virtual code verification means 20 sets a position corresponding to the first code as a starting point, and arranges a k-angle based on a second code according to a search method applied to the second code. Search for a storage location in the state or a point matching the storage location (that is, a specific vertex of a k-gon) (S1020; storage location search step). The storage location is matched to each vertex of the k-gon. The point where the first code track (that is, the first track) and the k-angle correspond to the storage location search start point corresponding to the first code. The virtual code verification means 20 searches for a matching point of the storage location based on the second code at the search starting point.

Various methods can be applied as a method of searching a storage location in a k-angle based on the second code. As an example, the virtual code verification means 20 is a specific angle divided by 180 degrees M ^N pieces so as to face the vertex of the k-angle at a position corresponding to the second code at a position on the first track in contact with the k-angle ), It is possible to search for a vertex of a k-gon, which is a storage location where a real code corresponding to a virtual code is stored.

Further, as another example, in a state where the k-angle is in contact with the point corresponding to the first code on the first track, the virtual code verification means 20 is based on the center of the k-angle and the contact point on the first track, the entire center angle (ie , 360 degrees) into M ^N pieces, and match each angle to M ^N second codes. At this time, the direction of the line moving a specific number of unit angles (ie, 360 degrees / M ^N ) from the line connecting the center of the k-angle and the contact point on the first track becomes a specific vertex of the k-angle. Accordingly, when a second code corresponding to a specific angle is received, the virtual code verification means 20 may search for a vertex located in the corresponding angle direction.

Also, as another example, a specific digit of the second code may be used to determine the angle calculation direction. That is, when the second code is generated using N characters (N is a natural number), the angle measurement direction can be determined by one digit. For example, if the virtual code verification means 20 matches the second code to each angle by dividing the entire center angle (ie, 360 degrees) based on the center of the k-angle and the contact point on the first track, k From the line connecting the center of the square and the contact point on the first track, whether it is an angle measured in the left direction or an angle measured in the right direction can be determined as a value of one digit.

For example, in the storage location search algorithm, two different second codes may be assigned to one vertex according to the angle measurement direction at each vertex on the k-angle. That is, when reaching the inner corner of the vertex and when reaching the outer corner, the other second code is matched, and different actual codes can be connected. As another example, the storage location search algorithm is N-1 when the second code is generated using N characters (N is a natural number), and the total angle (eg, 360 degrees when divided based on the central angle). ) Can be matched for half of the number and the angle applied direction to reach each vertex can be determined using one digit.

The method of searching the storage location in the k-angle based on the second code is not limited to this, and the point where the point on the k-angle corresponding to the second code and the contact point on the first track is divided by a specific ratio is searched as the storage location. Various methods such as a method can be applied.

Thereafter, the virtual code verification means 20 extracts the actual code included in the storage location (S1030). That is, the virtual code verification means 20 finds a storage location corresponding to the vertex of the k-angle, and extracts the actual code in the storage location.

In addition, as shown in FIG. 8, in another embodiment, when a new actual code is requested from a specific virtual code generating means 10 at a specific count, the specific count is stored in a storage location corresponding to a specific vertex of a k-angle. And storing the actual code; further includes (S100; storing the actual code). The particular vertex is a tangent to the track at the particular count. When a specific time (or count) elapses after the virtual code verification means 20 drives the virtual code generation function and the storage location search algorithm, the virtual code verification means 20 is new from the specific virtual code generation means 10. Upon receiving the actual code issuance (that is, the request for inclusion for a specific group), the newly generated actual code is stored in the storage location matched to the vertex of the k-angle touched on the first track. Specifically, as the virtual code generation function and the storage location search algorithm are driven in the virtual code verification means 20, the k-angle is moved in a cloud so that the k-angle and the track-contacting position are moved by one code for each count. When a new real code is issued to the count, the vertex contacting the track at a specific count is determined as a point on the k-angle where the real code is stored.

For example, as shown in FIG. 6, the virtual code verification means actually executes the virtual code generation means A at the vertex of the k-angle that touched the track at time A as the actual code is issued for the virtual code generation means A at time A. Save the code. Thereafter, as the count elapses, the k-angle performs a cloud movement along the track. The storage position in which the actual code of the virtual code generating means A is stored is rotated by the rotation of the k-gon.

That is, after the actual code is stored at the vertex of the k-angle that touches the track, the k-angle is rotated as much as the n count has elapsed, and the point at which the actual code is stored is rotated by the number of n counts that have elapsed. Accordingly, when the second code is calculated by reflecting the number of unit counts elapsed from the count (that is, the point in time) at which the actual code was issued, the virtual code verification means 20 is actually executed at the time when the virtual code is generated through the second code. It is possible to calculate the point on the k-angle where the code is stored.

Specifically, the first code is a code value corresponding to the number of counts elapsed since the first time the specific virtual code generation function and the storage location search algorithm were driven in the virtual code verification means 20, and the second code is the specific virtual code generation In the case of a code value corresponding to the number of counts elapsed after issuing the actual code to the means 10, the virtual code verification means 20 requests the virtual code generation means 10 to generate the virtual code through the first code. The time point (for example, point C) is determined, and the vertex on the k-angle where the actual code is stored in the k-angle arrangement state of the corresponding point is identified through the second code. That is, the first code is used to determine a point on the track to be in a k-angle arrangement state in which a particular vertex of the k-angle can be searched, and the second code is arranged with a k-angle at a point on the track corresponding to the first code. After it is used, it is used to search for the vertices of the k-angle that match the actual storage location. Through this, after generating the virtual code in the virtual code generating means 10 is provided to the virtual code verification means 20, even if there is a delay time (delay time), the virtual code verification means 20 is the actual corresponding to the virtual code You can navigate through the code exactly.

In another embodiment, as shown in FIG. 9, the virtual code verification means 20 applies the inverse function of the first function or the second function to the first code or the second code to generate the virtual function normally. Further comprising a step (S500) of verifying whether the code corresponds. For example, the first code is a code value corresponding to the number of counts elapsed from the initial time when the specific virtual code generation function and the storage location search algorithm are driven in the virtual code verification means 20, and the second code is a specific virtual code. In the case of a code value corresponding to the number of counts that have elapsed since the actual code was issued to the generating means 10, the virtual code verification means 20 issues the actual code after driving the virtual code generation function when storing the actual code in the storage location. The time elapsed until the hour is also stored. The virtual code verification means 20 applies the inverse function of the first function to the first code in the virtual code to calculate the elapsed time T1 from when the virtual code generation function is driven to the time at which the virtual code is generated, and the second in the virtual code. The inverse function of the second function is applied to the code to calculate the elapsed time (T2) from when the actual code is issued to when the virtual code is generated. Then, the virtual code verification means 20 determines whether the difference between T1 and T2 corresponds to Ts and verifies the virtual code.

In another embodiment, as shown in FIG. 10, the first received code received from the virtual code generating means 10 and the first generated according to the first function generated by the virtual code verifying means 20 Comparing the generated code (S600); If the first received code is included in an error tolerance range from the first generated code, setting the first received code as a first code as the starting point (S700); And determining that the first received code is an abnormal code if it is out of an error tolerance range from the first generated code (S800). The virtual code generation means 10 and the virtual code verification means 20 pass the same unit count over time. However, an error exists between the virtual code generation means 10 and the timer included in the virtual code verification means 20, so the number of counts elapsed at the same time may be different. Therefore, a process for determining an abnormal code other than a normal virtual code is required while resolving the error caused by the timer. To this end, the virtual code verification means 20 is a first code generated from a specific count by a first function internally and a first code in the virtual code received from the virtual code generation means 10. 1 Compare the received code (S600), and if the number of counts differing between the first generated code and the first received code falls within the error tolerance range, it is determined as a normal code, and then the actual code search process is performed based on the first received code. Then, if the number of counts differing between the first generated code and the first received code exceeds the error tolerance range, it is determined as an abnormal code (S800).

In addition, in another embodiment, when the virtual code further includes a specific digit security code, the virtual code verification means is generated in the received security code and the virtual code verification means received from the virtual code generation means. And determining whether the generated security code matches or not and verifying the virtual code.

In the above, the method for providing virtual codes according to an embodiment of the present invention described above may be implemented as a program (or application) to be executed in combination with a computer that is hardware, and stored in a medium.

The above-described program is C, C ++, JAVA, machine language, etc., in which a processor (CPU) of the computer can be read through a device interface of the computer in order for the computer to read the program and execute the methods implemented as a program. It may include a code (Code) coded in the computer language of. Such code may include functional code related to a function defining functions required to execute the above methods, and control code related to an execution procedure necessary for the processor of the computer to execute the functions according to a predetermined procedure. can do. In addition, the code may further include a memory reference-related code as to which location (address address) of the computer's internal or external memory should be referred to additional information or media necessary for the computer's processor to perform the functions. have. Also, when the processor of the computer needs to communicate with any other computer or server in the remote to execute the functions, the code can be used to communicate with any other computer or server in the remote using the communication module of the computer. It may further include a communication-related code for whether to communicate, what information or media to transmit and receive during communication, and the like.

The storage medium refers to a medium that stores data semi-permanently and that can be read by a device, rather than a medium that stores data for a short moment, such as registers, caches, and memory. Specifically, examples of the medium to be stored include, but are not limited to, ROM, RAM, CD-ROM, magnetic tape, floppy disk, and optical data storage device. That is, the program may be stored in various recording media on various servers that the computer can access or various recording media on the user's computer. In addition, the medium may be distributed over a computer system connected through a network to store computer-readable codes in a distributed manner.

According to the present invention as described above, it has various effects as follows.

First, since virtual codes are newly generated for each unit count, and duplicate virtual codes do not appear within a predetermined period, the actual code is not leaked even when the virtual codes are leaked.

Second, since algorithms for generating virtual code and searching for real code need only be added to the virtual code generating device and the device using the actual code (for example, a financial company server, IOT device, etc.), the existing process using the actual code is maintained. You can. For example, if a smart card or an app card is provided by generating a virtual card number that is not duplicated, the POS device and the PG company server are maintained and the virtual card number is transferred to the card company server, and the card server server is assigned to the virtual card number. Payment can be performed by searching the corresponding actual card number. Through this, it is possible to minimize the portion to be changed in the existing process in order to increase security, and the user does not need to perform a separate step to improve security.

Third, there are various ways to implement the virtual code generation function, so different virtual code generation functions can be applied for each group and each application field.

The embodiments of the present invention have been described above with reference to the accompanying drawings, but a person skilled in the art to which the present invention pertains may implement the present invention in other specific forms without changing its technical spirit or essential features. You will understand. Therefore, it should be understood that the above-described embodiments are illustrative in all respects and not restrictive.

Claims (15)

A virtual code verification means receiving the virtual code from the virtual code generation means, wherein the virtual code is generated by combining a plurality of detailed codes according to specific rules;
The virtual code verification means extracting a plurality of detailed codes included in the virtual code; And
Includes; the virtual code verification means, the actual code search step of searching for a storage location of the actual code based on a plurality of detailed code;
The virtual code verification means and the virtual code generation means include the same virtual code generation function,
The above detailed code,
A first code for setting a start point of a search for a storage location; And
It includes; a second code for setting a search path from the starting point to the storage location according to a specific search method;
The first code and the second code are changed for each unit count,
The virtual code verification means,
It includes a storage location search algorithm for adjusting the storage location of the actual code to match the first code and the second code generated for each unit count,
When the virtual code normally generated for each unit count is received, a point moved according to a search path corresponding to the second code from the starting point corresponding to the first code is calculated as the storage location,
The unit count,
A method for providing a virtual code, which is set as a specific time interval and changes as the time interval elapses. According to claim 1,
The virtual code generation function,
When generating the first code or the second code of N (N is a natural number) digit with M (M is a natural number) characters,
And a first function or a second function for providing different M ^N codes as a first code or a second code that is sequentially changed for each unit count. According to claim 2,
The second code,
A method for providing a virtual code, which is generated based on a unit count elapsed from the time when the actual code for the virtual code generating means is newly generated. According to claim 1,
The actual code search step,
When the storage location search algorithm is k (k is M ^N ) on the track where the code is listed, k-gon is a cloud movement with the vertices corresponding to the point where each code is arranged,
Moving the k-angle to a point on the track corresponding to the first code in the virtual code received from the virtual code generating means;
The location corresponding to the first code is set as the search start point, and the storage location in the k-angle arrangement state is searched for based on the second code according to the search method applied to the second code. a storage location search step of matching each vertex of the k-gon; And
And extracting the actual code included in the storage location. According to claim 4,
When a new actual code is requested to be generated from a specific virtual code generating means, a real code is stored in a storage location corresponding to a specific vertex of a k-angle to the specific count, wherein the specific vertex is on the track at the specific count. A method of providing a virtual code, further comprising a step of storing an actual code that is touched. According to claim 1,
The virtual code generation function,
A method for providing a virtual code, comprising a detailed code combining function corresponding to a rule for arranging a plurality of detailed codes. According to claim 1,
The virtual code generation function includes a plurality of detailed code generation functions for generating each detailed code,
The detailed code generation function,
A specific sorting rule that lists M letters in ascending order is applied.
The character is to include at least one of uppercase alphabet, lowercase alphabet, numbers and special characters, virtual code providing method. According to claim 1,
The virtual code further includes a fixed code for determining a group including the virtual code generating means,
The detailed code extraction step,
Extracting the fixed code from the virtual code,
And determining the group of the virtual code generation means based on the fixed code, and determining the virtual code generation function or the storage location search algorithm for the group. According to claim 1,
The virtual code further includes a specific digit security code,
And the virtual code verification means determining whether the received security code received from the virtual code generation means matches the generated security code generated in the virtual code verification means to verify the virtual code. How to provide. The method of claim 9,
The security code is generated by using the unique identification value and creation time data of the virtual code generation means as function values,
The virtual code verification means receives and stores the unique identification value when generating the actual code for the virtual code generation means, the virtual code providing method. According to claim 2,
Further comprising the step of verifying that the virtual code verification means corresponds to the normally generated virtual code by applying the inverse function of the first function or the second function to the first code or the second code; Way. According to claim 1,
Comparing the first received code received from the virtual code generation means with the first generated code generated according to the first function generated by the virtual code verification means;
If the first received code is included in an error tolerance range from the first generated code, setting the first received code as a first code as the starting point; And
And determining that the first received code is an abnormal code if it is out of an error tolerance range from the first generated code. A virtual code providing program stored in a medium to execute the method of any one of claims 1 to 12 in combination with a computer that is hardware. A detail code generation unit that generates one or more detail codes;
A virtual code generation unit for generating the virtual code by combining the one or more detailed codes; And
Includes; a virtual code providing unit for outputting the virtual code to the outside to provide the virtual code verification device;
The virtual code is generated by combining a plurality of detailed codes according to specific rules,
The above detailed code,
A first code for setting a search start point of a storage location in the virtual code verification device; And
And a second code for setting a search path from the starting point to the storage location in the virtual code verification device according to a specific search method.
The first code and the second code are changed for each unit count,
The virtual code verification device,
It includes a storage location search algorithm for adjusting the storage location of the actual code to match the first code and the second code generated for each unit count,
When a virtual code normally generated for each unit count is received, a point moved according to a search path corresponding to the second code from the search start point corresponding to the first code is calculated as the storage location,
The unit count,
A virtual code generation device that is set to a specific time interval and changes as the time interval elapses. In the virtual code verification device for searching the actual code based on the virtual code,
A receiving unit that receives the virtual code from the virtual code generating device;
A detailed code extraction unit for extracting a plurality of detailed codes included in the virtual code; And
It includes; a real code search unit for searching the storage location of the real code based on a plurality of detailed code,
The virtual code verification device and the virtual code generation growth value include the same virtual code generation function,
The virtual code is generated by combining a plurality of detailed codes according to specific rules,
The above detailed code,
A first code for setting a search start point of a storage location search in the actual code search unit; And
And a second code for setting a search path from the starting point to the storage location in the actual code search unit according to a specific search method.
The actual code search unit,
And a storage location search algorithm that adjusts a storage location of the actual code to match the first code and the second code, which are changed and provided for each count in the virtual code generation device,
When a virtual code normally generated for each unit count is received, a point moved according to a search path corresponding to the second code from the search start point corresponding to the first code is calculated as the storage location,
The unit count is set to a specific time interval, and is changed as the time interval elapses, the virtual code verification device.

Images