KR20210143145A - Method and program for searching actual code based on virtual code - Google Patents

Abstract

The present invention provides a virtual code-based real code search method, which includes: a step of receiving, by the virtual code verification means, a virtual code generated based on a detailed code by the virtual code generation means (S200; a virtual code receiving step); a step of extracting, by the virtual code verification means, the detailed code from the virtual code (S400); and a step of the virtual code verification means searching for a real code based on the detailed code (S600; a real code search step).

Description

Real code search method and program based on virtual code {METHOD AND PROGRAM FOR SEARCHING ACTUAL CODE BASED ON VIRTUAL CODE}

The present invention relates to a virtual code providing system, a virtual code generating apparatus, a virtual code verification apparatus, a virtual code providing method, and a virtual code providing program, and in more detail, a virtual code generated without overlapping at each time point is generated and based on this It relates to a system, method, and program for searching a real code, an apparatus for generating non-overlapping virtual codes at each time point, and an apparatus for searching for a real code based thereon.

Code type data is used in many areas. In addition to card numbers and account numbers used for payment, IPIN numbers for user identification, resident registration numbers, etc. are code-type data.

However, many leaks occur in the process of using such code data. In the case of the card number, the actual card number is written on the surface of the card as it is, so it is visually leaked to others, and the card number is leaked as it is delivered to the POS device when making a payment using a magnet.

There have been many attempts to use the virtual code to prevent the actual code from being leaked, but data for identifying the user is 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 every hour and generated, but it is difficult to apply to various areas because a login procedure is required to determine the algorithm assigned to the user.

Accordingly, there is a need for an invention capable of searching for a real code based on a virtual code that changes in real time without providing identification information for a user or device corresponding to the real code.

Korea Patent Registration No. 10-1316466 (2013.10.01)

The present invention provides a virtual code providing system, a virtual code generating apparatus, a virtual code verification apparatus, a virtual code providing method, and a virtual code providing program that can search for real codes based on virtual codes without a separate procedure for identifying virtual code generating means would like to provide

In addition, the present invention provides a virtual code that is newly generated at unit count intervals without being duplicated within the entire cycle in all virtual code generating means. An object of the present invention is 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 virtual code-based real code search method according to an embodiment of the present invention, the virtual code verification means receives the virtual code generated based on the detailed code by the virtual code generation means, wherein the virtual code verification means extracting the detailed code from the virtual code and the virtual code verification means searching for the actual code based on the detailed code, wherein the detailed code is changed for each unit count set at a specific time interval.

In another embodiment, the detailed code is generated based on a device identification value, and the device identification value may be a value that is differently assigned to the virtual code generating means.

In another embodiment, the virtual code further includes a fixed code, and the virtual code verification means extracts the fixed code included in the received virtual code to determine the group including the virtual code generation means, A virtual code generation function or a search algorithm corresponding to the group may be determined.

In another embodiment, the virtual code includes a plurality of detailed codes generated by the virtual code generating means, and the virtual code verification means determines a search order based on the correlation between the plurality of detailed codes. and search for the actual code according to the determined search order.

Also, in another embodiment, the plurality of detailed codes includes a first code and a second code, the first code is used to search for a starting point of the actual code, and the second code is the starting point. It can be used to search the storage path of the actual code from

A virtual code-based real code search method according to another embodiment of the present invention includes the steps of: a virtual code generating means generating a detailed code; the virtual code generating means generating a virtual code based on the detailed code; and the virtual code generating means provides the virtual code to the outside, wherein the detailed code is used by the virtual code verification means to search for the actual code, and is changed for every unit count set at a specific time interval.

In another embodiment, the virtual code includes a plurality of detailed codes generated by the virtual code generating means, and the plurality of detailed codes includes a first code and a second code, and the first code may be used to search for a starting point of the actual code, and the second code may be used to search for a storage path of the actual code from the starting point.

A computer program according to another embodiment of the present invention is combined with hardware to execute the virtual code-based real code search method, and is stored in a computer-readable medium.

Virtual code verification apparatus according to another embodiment of the present invention, a virtual code receiving unit that receives a virtual code generated based on the detailed code by the virtual code generating means, extracting the detailed code included in the virtual code , a detailed code extraction unit, and an actual code search unit that searches for an actual code based on the detailed code, wherein the detailed code is changed for each unit count set at a specific time interval.

A virtual code generation apparatus according to another embodiment of the present invention includes a detailed code generator for generating a detailed code, a virtual code generator for generating a virtual code based on the detailed code, and a virtual code to the outside providing, a virtual code providing unit, wherein the detailed code is used by the virtual code verification means to search for the actual code, and is changed for every unit count set at a specific time interval.

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

First, a virtual code is newly created for each unit count, and since the overlapping virtual code does not appear within a predetermined period, it provides an effect that the actual code is not leaked even when the virtual code is leaked.

Second, since the algorithm for generating virtual code and searching for real code only needs to be added to the virtual code generating device and the device using the real code (eg, financial company server, IOT device, etc.), the existing process using the real code can be maintained as it is. can For example, if a virtual card number that is not duplicated on a smart card or an app card is generated and provided, the POS device and the PG company server are maintained as they are, and the virtual card number is transferred to the card company server, and the card server sends the virtual card number to the card company server. You can proceed with the payment by searching for the corresponding actual card number. Through this, it is possible to minimize the part that needs to be changed within the existing process to increase security, and the user does not need to perform a separate step for improving security.

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

1 is a block 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 block diagrams of a virtual code verification apparatus 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 an actual code storage location through a k-shaped cloud movement according to an embodiment of the present invention.
7 is a flowchart of a virtual code providing method including a real code search process according to a k-shaped cloud movement according to an embodiment of the present invention.
8 is a flowchart of a method for providing a virtual code further comprising the step of issuing and storing a real code in a storage location according to an embodiment of the present invention.
9 is a flowchart of a virtual code providing method further including a virtual code verification process according to an embodiment of the present invention.
10 is a flowchart of a virtual code providing method further including a process of determining whether a virtual code is an abnormal code 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 of achieving them will become apparent with reference to the embodiments described below in detail in conjunction with the accompanying drawings. However, the present invention is not limited to the embodiments published below, but can be implemented in various different forms, and only these embodiments make the publication of the present invention complete, and common knowledge in the art to which the present invention pertains It is provided to fully inform those who have the scope of the invention, and the present invention is only defined by the scope of the claims. Like reference numerals refer to like elements throughout.

Unless otherwise defined, all terms (including technical and scientific terms) used herein may be used with the meaning commonly understood by those of ordinary skill in the art to which the present invention belongs. In addition, terms defined in a commonly used dictionary are not to be interpreted ideally or excessively unless clearly defined in particular.

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

In the present specification, 'character' is a component constituting a code, and includes all or part of uppercase letters, lowercase letters, numbers, and special characters.

In this specification, 'code' means a character string in which characters are listed.

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

In this specification, 'virtual code' means a code temporarily generated to be connected to an actual code.

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

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

In the present specification, a 'virtual code generation function' refers to a function used to generate a virtual code.

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

As used herein, the term 'moving the cloud' means performing a translational motion while the object rotates. That is, 'moving the cloud' means moving while performing both a rotational motion and a translational motion, and it means that each point of the rotating object moves while being in contact with the moving axis in turn.

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

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

Referring to FIG. 1 , a virtual code providing system according to an embodiment of the present invention includes a virtual code generating unit 10 and a virtual code verifying unit 20 .

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

The virtual code verification means 20 serves to search for an actual code based on the virtual code provided from the virtual code generating 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 an actual code from the virtual code received from the virtual code generation means 10 . A detailed description of a method in which the virtual code verification means 20 searches for a real 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 a code normally generated by the virtual code generating means 10 . A detailed description of a method in which 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 generating means 10 through various methods. In one embodiment, the virtual code verification means 20 may receive the virtual code from the virtual code generating means 10 through wireless communication. Also, in another embodiment, the virtual code verification means 20 may directly receive a virtual code generated by the virtual code generating means 10 and provided to the user from the user.

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

Also, 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 unit 20 and the virtual code generation unit 10 include the same virtual code generation function, the virtual code verification unit 20 includes a plurality of detailed codes in the virtual code generated by the virtual code generation unit 10 . can be properly extracted. Also, 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, after the virtual code verification means 20 generates a code (ie, a virtual code or a specific detailed code) under the same conditions as the virtual code generation means 10 , the code received by the virtual code generation means 10 (that is, , virtual code, or specific detailed code), verification can be performed according to the view.

2 is a block diagram of a virtual code generating apparatus 100 according to another embodiment of the present invention.

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

The virtual code generating apparatus 100 according to the 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 apparatus 100 may be a smart card in which a program corresponding to the virtual code generating means 10 is embedded. Also, 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 apparatus 100 controls a program corresponding to the virtual code generating means 10 is embedded. It may be a device (eg, a remote control). The virtual code generating apparatus 100 may be applied to various cases in which it is necessary to generate and transmit a virtual code to another apparatus (eg, another device or server) other than the above-described examples.

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

Various methods may be applied as a method of generating one 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 an N-digit first code and an N-digit second code. Also, as another example, the detailed code combining function may be a function of combining the second code after the first code. As the number of detailed codes included in the virtual function increases, various detailed code combining functions may be created.

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 generating function generates a plurality of detailed codes using a plurality of detailed code generating functions, and generates a virtual code using a detailed code combining function that combines the plurality of detailed codes.

In an embodiment, the detailed code generation unit 110 includes the first function and the second function 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 generating apparatus 100 generates the first code to increase security. The first function and the second function for generating the second code may be included as the detailed code generating function, and data on the correlation between the first code and the second code may not be included.

Also, according to another embodiment, the virtual code may include an unaltered fixed code for distinguishing a group together with a plurality of detailed codes. The virtual code verification means 20 may include several virtual code generating functions respectively corresponding to several groups, and when a virtual code is received from the virtual code generating apparatus 100, the virtual code generating apparatus 100 belongs to the group. 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 newly generated whenever the unit count elapses, it is impossible to determine the group to which the virtual code generating apparatus 100 belongs without separate information. Accordingly, the virtual code generating apparatus 100 includes a non-changeable fixed code for identifying a group.

For example, when the real code is a real card number and a virtual code generating function is provided for each card type of a specific card company, the virtual code generating device 100 fixes the first 6 digits indicating the card company and card type among the card number Using the code, the virtual code verification means 20 can identify a specific card type of a specific card company to which the same virtual code generating function as that of the virtual code generating device 100 is applied.

In addition, for example, if the resident registration number is a real code and people having the same date of birth are determined as the same group, the virtual code generating device 100 sets 6 digits corresponding to the date of birth among all 13 digits of the resident registration number as a fixed code, , 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 the 6-digit fixed code.

Also, 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 generates a security code of a specific number of digits by using time data and a unique value of the virtual code generation means as a function value.

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

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

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

In addition, as an embodiment, when the virtual code is generated by a combination according to a specific rule of the first code and the second code, the first code and the second code play a respective role for searching a storage location in which the actual code is stored. can be done For example, the first code sets a starting point of searching for a storage location, and the second code sets a search path from the starting point to the storage location according to a specific search method. That is, when the virtual code normally generated for each unit count is provided from the virtual code generating apparatus 100, the virtual code verification means 20 according to the search path corresponding to the second code from the search start point corresponding to the first code. The moved point is determined as the actual code storage location. 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 a new detailed code for each unit count, and accordingly, the virtual code generation apparatus 100 generates a unit count. Generates a new virtual code every time. A newly generated virtual code for each unit count is not duplicated. Specifically, the detailed code generating unit 110, the newly generated virtual code for each unit count is not duplicated for a predetermined period for a specific user or a specific virtual code generating apparatus 100, as well as between users belonging to a specific group. It is set not to be duplicated.

As a specific embodiment for preventing duplicate generation of virtual codes, when generating the N-digit first code or the second code with M characters, the detailed code generation function included in the virtual code generation function is M ^N A code may be generated as a first code or a second code, and each code is matched for each count from an initial time point 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 generating function is first driven. Then, the period of using a specific detailed code generating function or the period of use of the virtual code generating device 100 (eg, the validity period of the smart card for generating the virtual card number) is ^{a time length corresponding to the M N} count (for example, For example, when 1 count is 1 second, if it ^{is set to a time length shorter than M N} seconds), the same code is not repeatedly generated during the use period of the first code or the second code. That is, when the count increases as time passes, when a user requests the virtual code generation apparatus 100 to generate a virtual code at a specific time, the virtual code generation apparatus 100 matches the count corresponding to the specific time. The converted code value may be generated as the first code or the second code.

As another specific embodiment of preventing duplicate generation of virtual codes, when the usage period of the virtual code generating apparatus 100 elapses, a function (ie, a first function or a second function) that generates a first code or a second code ) or change the matching relationship between the first code and the second code to generate 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 and the first code generating function or the second code generating function is changed, the virtual code generating apparatus 100 ) may apply a virtual code generation function that generates a virtual code different from the previous cycle to the new usage cycle as the order in which the first code or the second code appears is different from the previous usage cycle. In addition, the virtual code generating apparatus 100 prevents the same code as the virtual code used in the previous use period from appearing as a virtual code of each count in the new use period (that is, the first code and the second 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 two functions is not included in the matching relationship included in the previous use period in all counts of the new use period). That is, ^{after the use cycle in which M N} codes can be applied once has elapsed, the virtual code generation function of the new usage cycle that does not generate a virtual code overlapping with the previous usage cycle is applied by adjusting or updating the virtual code generation function. can

In this case, the virtual code generating means 10 and the virtual code verifying means 20 may store a rule for updating the virtual code generating function. That is, the virtual code generating means 10 and the virtual code verifying means 20 may store the order or rules for applying the plurality of first and second functions to each use period.

In addition, as another specific embodiment of preventing duplicate generation of virtual codes, any one of the first code or the second code included in the virtual code is not generated at the same time even between users belonging to the same group. At least, the virtual code generating apparatus 100 may be generated by reflecting a value (ie, a device identification value) that is always different at the same point in time. In one embodiment, the device identification value is a time point at which a specific virtual code generating device 100 is included in a group to which a specific detailed code generating function is applied (eg, a specific detailed code generating function in the virtual code verification means 20 ) It may be the elapsed time (or the number of counts) from the time when the detailed code generation function is started to be applied to the specific virtual code generating apparatus 100 after a specific time has elapsed from the initial point of operation. When a plurality of virtual code generating apparatuses 100 are included in one group, if the count for setting the virtual code generating apparatus 100 to belong to a corresponding group is not the same (that is, the virtual code generating apparatus 100 is When it is impossible to simultaneously belong to the corresponding group), the elapsed time from the point in time (or count) at which the virtual code generating apparatus 100 belongs to the group to a specific time is different for each virtual code generating apparatus 100 . Accordingly, at least one of the detailed code generation functions uses the elapsed time from the point in time (or count) when the virtual code generation device 100 belongs to the group to a specific point in time as a device identification value, The virtual codes generated by the code generating apparatus 100 may be different. Through this, the virtual code verification means 20 can distinguish the virtual code generating apparatus 100 only by receiving the virtual code without separately receiving data for distinguishing the user.

For example, when the virtual code generating device 100 is a card that can change the output card number (eg, a smart card or an app card), 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 from the first virtual code generating apparatus 100 (ie, the virtual code generating apparatus 100 of the first user) at a time point A when the first user drives the virtual code verification means 20 . and the second virtual code generating device 100 (that is, the second virtual code generating device 100 )), when a card issuance is requested, the first virtual code generating apparatus 100 and the second virtual code generating apparatus 100 send the virtual code generation request from the first and second users to C (C is greater than B). Value), the length of time elapsed from the time of card issuance is always different. Accordingly, the detailed code generation function can prevent the same virtual card number from being generated at the same time by applying the length of time elapsed from the time when the card is issued to each virtual code generating apparatus 100 as a variable.

In addition, since the length of time elapsed from the point in time when the specific virtual code generating device 100 belongs to a specific group continues to increase as time passes, the detailed code (eg, the specific virtual code generating device 100 ) is generated. , the second code) does not generate the same value, but continues to generate different values.

In addition, as another specific embodiment for preventing duplicated generation of virtual codes, the first code is a first function in the virtual code verification means 20 so that a duplicate virtual code is not generated regardless of the user in the entire cycle. is set to a code value corresponding to the time (or count) at which the virtual code generation request is made among codes matched for each count from the initial time when It is possible to set a code value generated by reflecting a value (ie, a device identification value) that exists in a common manner, 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 apparatus 100 at the same time. Different code values are output at all times from the generation device 100 .

In addition, in another embodiment, the virtual code generating function (or detailed code generating function), any one of a plurality of arranging rules for arranging M characters in an ascending order is applied. That is, the virtual code generating apparatus 100 (that is, the virtual code generating means 10) can variously apply the rules for arranging M characters in ascending order to the detailed code generating function included in the virtual code generating function. . For example, a list rule that lists uppercase letters of the alphabet in ascending order is A, B, C,… , can be in the order of Z, A, C, B,… , may be in the Z order. As the listing rules are different in the virtual code generation function, the order in which the codes are matched for each count is changed from the initial time when the virtual code generation function is driven. The virtual code verification means 20 may store codes generated according to the same enumeration rule that match each count or include the same enumeration rule itself in the virtual code generation function. Accordingly, the virtual code generating function for each group may include a different detailed code combining function or a different character sequencing rule to have a different virtual code generating function for each group.

The virtual code providing unit 130 serves to output the virtual code to the outside in order to provide it to the virtual code verification apparatus 200 . The virtual code providing unit 130 may include various components capable of providing a virtual code to the outside. The virtual code providing unit 130 includes a wireless communication module; short-distance communication module; IC chip; magnetic field generator; All or part of the display unit and the like are included.

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 technologies include WLAN (Wireless LAN) (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-distance communication module refers to a module for short-distance communication. Short range communication technologies include Bluetooth, BLE (Bluetooth Low Energy), Beacon, RFID (Radio Frequency Identification), NFC (Near Field Communication), Infrared Data Association (IrDA), Ultra Wideband (UWB), ZigBee, etc. may be used.

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

The IC chip can be mounted in the PCB board to perform data exchange by contacting the terminal of the IC card reader. That is, the IC chip transfers the virtual code generated by the virtual code generator 120 to the IC card reader.

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

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

In addition, the user may transmit the virtual code displayed on the display unit through various paths such as a text message. Instead of transmitting the actual code, the virtual code verification means 20 delivers a virtual code (specifically, a code that is continuously changed and generated) that can search for the actual code, so when the user transmits the code through a text message, You can avoid worrying about leaking the actual code.

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

Referring to FIG. 3 , a virtual code verification apparatus 200 according to another embodiment of the present invention includes a virtual code receiving unit 210 ; Detailed code extraction unit 220; and a real code search unit 230 . The virtual code verification apparatus 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 (ie, the virtual code generating device 100 ) that generates and transmits a virtual code replacing the real code. The IOT device searches the storage location of the actual code based on the virtual code and can be driven when the actual code is extracted from a specific storage location.

Also, for example, the virtual code verification apparatus 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, searches for an actual card number, and performs payment. Specifically, in the case of card payment, the virtual code verification device 200 receives the virtual code generated by the virtual code generating device 100 through the POS device and the PG company server.

The virtual code receiving unit 210 serves to receive a virtual code from the virtual code generating apparatus 100 . In an embodiment, the virtual code receiving unit 210 may include a wireless communication unit (eg, a wireless communication module or a short-range communication module) to receive a virtual code from the virtual code generating apparatus 100 through wireless communication. . Also, in another embodiment, the virtual code receiving unit 210 may receive the virtual code generated by the virtual code generating apparatus 100 through communication with another server.

Also, according to 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 the virtual code visually output from the virtual code generating apparatus 100 from the user. For example, if the virtual code generating device 100 is a device (eg, a smart card) that generates a virtual card number and outputs it on the card surface, the user may use the virtual code generated device 100 visually displayed on the virtual code generating device 100 . The code may be checked and directly input to the user input unit of the virtual code verification apparatus 200 .

Specifically, the virtual code generating apparatus 100 is provided with a display unit in the number of changeable digits (eg, excluding the first 6 digits and the last digit for determining the card company and card type) among 16 digits of the card number, and the virtual code When is created, a character is printed in place of the changeable code. The user may input the unchanged code and the entire changed code as virtual codes into the user input unit (ie, the virtual code receiving unit 210 ) of the virtual code verification apparatus 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 a specific rule. The detailed code extracting unit 220 of the virtual code verification apparatus 200 includes the same detailed code combining function as the virtual code generating apparatus 100 of a specific group, and the detailed code extracting unit 220 applies the detailed code combining function Thus, a plurality of detailed codes can be extracted from the virtual code. For example, when the virtual code generating apparatus 100 generates a virtual code in which two detailed codes (that is, a first code and a second code) are combined, the detailed code extracting unit 220 is a character array of the virtual code It is possible to separate the first code and the second code by applying the detailed code combining function in .

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

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

In addition, in another embodiment, as the virtual code generating means 10 (or the virtual code generating apparatus 100 ) provides a new virtual code for each unit count, the virtual code verification apparatus 200 is configured to search for a storage location. The first code and the second code are changed each time the unit count elapses. The virtual code verification apparatus 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.

Also, as another embodiment, the real code search unit 230 may include a storage location search algorithm to find the storage location of the actual code using a plurality of detailed codes having correlations. The storage location search algorithm is an algorithm that makes it possible to search for a storage location when each detailed code included in the virtual code is applied. For example, when a first code for determining a search start point of a storage location from the 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. It is an algorithm that adjusts so that when a direction corresponding to the second code is indicated at a point, a storage location that matches the actual code is placed at the corresponding location. As the storage location search algorithm is used, the virtual code verification apparatus 200 may find the actual code storage location or a point matching the storage location even if the first code and the second code included in the virtual code are changed. Various methods may 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 later.

For example, as will be described later, referring to FIG. 6 , the storage location search algorithm is a k-shaped (k is M ^{N ) that moves along a track in which M N} codes corresponding to the first code are listed, and the k-shaped When the vertices of are moved while corresponding to the points at which the codes are arranged on the first code track, each vertex of the k-shaped is matched with the actual code storage location, and the first code track (ie, the first track) and the k-shaped are The corresponding point may be a storage location search start point corresponding to the first code. At this time, the actual code search unit 230 may apply the rolling movement of the k-shaped so that the vertex of the k-shaped is in contact with the point corresponding to the first code extracted by the detailed code extracting unit 220 . Through this, the actual code search unit 230 performs an angle corresponding to the second code at a position on the first track where the k-gon is in contact (eg, a specific angle obtained by dividing ^{180 degrees into M N pieces to face the vertex of the k-gon).} ), it is possible to search for the vertex of the k-gon, which is a storage location where the real code corresponding to the virtual code is stored.

Specifically, as shown in FIG. 6 , the virtual code verification device 200 moves the k-shaped to a point corresponding to the first code while rolling (ie, each vertex of the k-shaped and each point on the track in turn contacting each other). ) do. Thereafter, the virtual code verification apparatus 200 searches for a vertex corresponding to the storage location by indicating the angular direction corresponding to the second code. For example, since two counts have elapsed since the virtual code generating means B is issued the real code, the virtual code generating means B generates a second code to which the two counts are applied as a function value and provides it to 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 k-gon and the track are in contact with each vertex (that is, the second code to which the n-count is applied is stored in the k-gonal) As the cloud moves by n counts of , it is stored by matching the angle toward the nth vertex where the cloud is moved), so the virtual code verification means applies the angle corresponding to the second code to the first code corresponding point to the actual code storage location Find the vertices of the corresponding k-gon.

In another embodiment, as shown in FIG. 4 , the virtual code verification apparatus 200 further includes a virtual code verification unit 240 . The virtual code verification unit 240 serves to determine the authenticity of the virtual code received by the virtual code verification apparatus 200 .

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

Referring to FIG. 5 , in the method for providing a virtual code according to an embodiment of the present invention, the virtual code verification means 20 receives a virtual code from the virtual code generating means 10 (S200; virtual code reception step) ; extracting, by the virtual code verification means 20, a plurality of detailed codes included in the virtual code (S400); and searching, by the virtual code verification means 20, a storage location of the real code based on a plurality of detailed codes (S1000; real code search step). Hereinafter, detailed description of each step is described. However, in the process of explaining the virtual code generating apparatus 100 and the virtual code verifying apparatus 200, a detailed disclosure of the above-described contents will be omitted.

The virtual code verification means 20 receives the virtual code from the virtual code generating means 10 (S200; virtual code receiving step). The virtual code is generated by the virtual code generating apparatus 100 (or the virtual code generating means 10 ) and provided to the virtual code verifying means 20 .

The virtual code generated by the virtual code generating means 10 may be composed of a plurality of detailed codes. In an embodiment, the virtual code may be generated by combining the first code and the second code. The first code and the second code are respectively used to search the location of the real code in the virtual code verification means 20 . For example, the first code is a code for setting a starting point of searching for a real code storage location 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 may be a code that sets

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

In addition, in another embodiment, the virtual code generating function, when generating the N-digit first code or the second code with M characters, converts different M ^N codes sequentially for each unit count. The first function or the second function provided as the first code or the second code is included. That is, the first function or the second function is ^{a function that generates M N} codes non-overlapping as the count increases, and generates a ^{specific one of M N} codes as the first code or the second code at a count corresponding to a specific time point. do. Through this, the virtual code generating means 10 ^{does not repeatedly generate the same first code or second code within M N} counts (that is, ^{a time length corresponding to M N} counts), and a new detailed code (ie, a new detailed code for each unit count) first code or second code) to generate a new virtual code for each unit count.

Specifically, the virtual code generation function generates the N-digit first code or the second code with M characters. When using M ^N codes as the first code or the second code, each code is detailed It matches for each count from the initial time when 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 generating function is first driven. Then, the period of using a specific detailed code generating function or the period of use of the virtual code generating device 100 (eg, the validity period of the smart card for generating the virtual card number) is ^{a time length corresponding to the M N} count (for example, For example, when 1 count is 1 second, if it ^{is set to a time length shorter than M N} seconds), the same code is not repeatedly generated during the use period of the first code or the second code. That is, when the count increases as time passes, when the user requests the virtual code generating means 10 to generate a virtual code at a specific time, the virtual code generating apparatus 100 matches the count corresponding to the specific time. The converted code value may be generated as the first code or the second code.

In addition, in another embodiment, at least one of the first code or the second code included in the virtual code is each virtual code generating means 10 so that the same virtual code is not generated at the same time even between users belonging to the same group. may be generated by reflecting a value (ie, a device identification value) that is always different at the same point in time. That is, when virtual code issuance is requested from a plurality of virtual code generating means 10 belonging to one group at a specific time, each virtual code is generated at each time so that each virtual code generating means 10 generates a different virtual code. A different first code or a different second code is generated by reflecting the differently assigned values to the means 10 .

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

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 generate the second code based on the unit count that has elapsed from the time when the real code is newly generated. .

Accordingly, at least one of the detailed code generation functions uses the elapsed time from the point in time (or count) when the virtual code generation device 100 belongs to the group to a specific point in time as the device identification value, The virtual code generated by the code generating apparatus 100 may always be different. Through this, the virtual code verification means 20 can distinguish the virtual code generating 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 point in time when the specific virtual code generating device 100 belongs to a specific group continues to increase as time passes, the detailed code (eg, the specific virtual code generating device 100 ) is generated. , the second code) does not generate the same value, but continues to generate different values.

In addition, as another embodiment, in order to prevent duplicate virtual codes from being generated regardless of the user in the entire cycle, the first code is a virtual code generation requested from among the codes matched for each count from the initial time when the first function is driven. A code value corresponding to the time point (or count) is set, and the second code is a code value generated by reflecting a value (that is, device identification value) that is always different at the same time point for each virtual code generating device 100 set, and the virtual code may be used 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 apparatus 100 at the same point in time. Different code values are output regardless of the device 100 and the time point.

Also, 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 a specific rule for arranging or arranging characters included in a plurality of detailed codes. Accordingly, in the case of the virtual code generating means 10 and the virtual code verification means 20 including the same virtual code generating function, the virtual code generating means 10 converts the characters included in the plurality of detailed codes into the detailed code combining function. , and the virtual code verification means 20 can separate the individual detailed codes from the virtual codes using the same detailed code combining function.

In addition, in another embodiment, the virtual code generation function, any one of a plurality of arranging rules for arranging M characters in an ascending order may be applied. That is, the virtual code generating function may be applied to various enumeration rules for arranging M characters in ascending order, and may be classified into different virtual code generating functions according to the applied enumeration rule.

The virtual code verification means 20 receives the virtual code generated by the virtual code generation means 10 in various ways. That is, various virtual code providing methods of the above-described virtual code generating apparatus 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 the virtual code generation function included in the virtual code generation means 10, the rule (ie, the detailed code combining function) that has combined a plurality of detailed codes is equally applied to a plurality of Extract the detail 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.

In addition, in 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) is performed by extracting the fixed code from the virtual code. and the group of the virtual code generating means is determined based on the fixed code, and the virtual code generating function or the storage location search algorithm for the group is determined. That is, when the virtual code generating function or the storage location search algorithm is applied differently to each group, the virtual code verification means 20 distinguishes the groups 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 generating function is determined by the fixed code, the detailed code combining function included in the virtual code generating function is determined so that a plurality of detailed codes can be extracted.

To this end, the fixed code may be coupled to a fixed position in the virtual code (for example, a specific 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 real code based on the plurality of detailed codes (S1000; real code search step). The plurality of detailed codes have a correlation with each other, and the virtual code verification means 20 searches for an actual code storage location based on the correlation between the detailed codes.

In addition, according to an embodiment, in the plurality of detailed codes in the virtual code, the code generated for each unit count is changed (eg, when the virtual code consists of two detailed codes, the first code and the second code are changed for each unit count) may be changed), and the virtual code verification means 20 matches the point matched with the real code storage location to the changed first code and second code so that the actual code storage location can be searched even if the virtual code is changed for each unit count. The position is adjusted for each unit count.

As an embodiment of the correlation between detailed codes constituting the virtual code, when the virtual code is a combination of the first code and the second code, the virtual code verification means 20 searches the first code at the search start point (that is, . That is, when the virtual code normally generated for each unit count is received, the virtual code verification means 20 moves the search point from the start point corresponding to the first code along the search path corresponding to the second code to the actual code. It is determined as a storage location or a point matching the storage location (eg, a storage space matching the 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. According to the search path corresponding to the second code from the point, it is possible to find the actual code storage location or a point matching the storage location.

In another embodiment, the virtual code verification means 20 may include a storage location search algorithm that adjusts the storage location of the real code to match the virtual code for each unit count. That is, the virtual code verification means 20 includes a storage location search algorithm that adjusts a search path to a point matching 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 to match 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 moving a cloud while a vertex corresponds to a point where each code is disposed on a track ^{where k (k is M N ) codes are listed.} . At this time, in the real code search step ( S1000 ), the virtual code verification means 20 rolls the k-corner to a point on the track corresponding to the first code in the virtual code received from the virtual code generation means 10 . moving (S1010); A location corresponding to the first code is set as a starting point, and a storage location in a k-shaped arrangement state or a point where the storage location is matched is searched 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).

As shown in FIG. 6 , the virtual code verification unit 20 moves the k-shaped to a point on the track corresponding to the first code in the virtual code received from the virtual code generation unit 10 ( S1010 ). The storage location search algorithm is a k polygon (k is M ^{N ) that moves along a track in which M N} codes corresponding to the first code are listed, and the vertex of the k square 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 rolling movement (or rolling movement) to the k-shaped so that the vertex of the k-shaped is in contact with the point corresponding to the first code.

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

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

Also, as another example, in a state in which the k-corner is in contact with a point corresponding to the first code on the first track, the virtual code verification means 20 determines the total central angle (that is, based on the center of the k-shaped and the contact point on the first track) , 360 degrees) is ^{divided into M N} pieces, and each angle ^{is matched 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-gon and the contact point on the first track becomes a specific vertex of the k-gon. Accordingly, when the 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 with one digit. For example, the virtual code verification means 20 divides the entire central angle (that is, 360 degrees) based on the contact point on the first track and the center of the k-shaped rectangle to match the second code to each angle, k From the line connecting the center of the square and the contact point on the first track, it is possible to determine whether the angle is measured in the left direction or the angle measured in the right direction 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 an angle measurement direction at each vertex of the k-shaped shape. That is, when one vertex is reached by an interior angle and when an exterior angle is reached, it is matched with another second code, and a different actual code can be connected. As another example, the storage location search algorithm generates N-1 total angles (for example, 360 degrees when dividing based on the central angle when generating the second code using N characters (N is a natural number)) ) and using 1 digit to determine the angle application direction to reach each vertex.

The method of searching the storage location in the k-gon based on the second code is not limited thereto, and a point dividing the point on the k-shaped corresponding to the second code and the contact point on the first track by a specific ratio is searched as the storage location. Various methods such as a method may be applied.

After that, 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 the storage location corresponding to the vertex of the k-shaped, and extracts the actual code in the storage location.

In addition, as in FIG. 8 , in another embodiment, when a new real code generation is requested for a specific count from a specific virtual code generating means 10, the specific count is stored in a storage location corresponding to a specific vertex of a k-corner. Storing the actual code; further includes (S100; actual code storage step). The particular vertex is the tangent on the track at the particular count. When a specific time point (or count) has elapsed after the virtual code verification means 20 drives the virtual code generating function and the storage location search algorithm, the virtual code verification means 20 receives new information from the specific virtual code generating means 10 . Upon receipt of the issuance of the actual code (that is, the request for inclusion for a specific group), the newly generated actual code is stored in a storage location matched to the vertex of the k-shaped adjacent to 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-gon moves in a cloud so that the position where the track meets the k-gon by one code for each count moves, When the issuance of a new real code is requested for the count, the vertex in contact with the track at a specific count is determined as the point on the k-shaped where the real code is stored.

For example, as shown in Fig. 6, the virtual code verification means issues the real code to the virtual code generating means A at the time A, so that the actual code of the virtual code generating means A is placed at the vertex of the k-shaped that came into contact with the track at the point A. Save the code. Then, as the count elapses, the k-gon performs a rolling motion along the track. The storage location in which the actual code of the virtual code generating means A is stored is rotated by the rotation of the k-shaped.

That is, after the actual code is stored at the vertex of the k-gon in contact with the track, the k-gon rotates as much as n counts have elapsed, and the point where 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 at which the real code is issued (that is, the time point), the virtual code verification means 20 performs the actual code at the time point when the virtual code is generated through the second code. It is possible to calculate a point on the k-gon where the code is stored.

Specifically, the first code is a code value corresponding to the number of counts elapsed from the initial time point when a specific virtual code generation function and a storage location search algorithm are driven in the virtual code verification means 20, and the second code generates a specific virtual code In the case of a code value corresponding to the number of counts elapsed after issuing the real code to the means 10, the virtual code verification means 20 requests the virtual code generation from the virtual code generating means 10 through the first code. The point of view (eg, point C) is identified, and the vertex of the k-gon in which the actual code is stored in the arrangement state of the k-gon at the point in time is identified through the second code. That is, the first code is used to determine a point on the track that allows a specific vertex of the k-gon to be searched for in a k-gonal arrangement state, and the second code is used to determine a point on the track corresponding to the first code where the k-gon is arranged. It is used to search for the vertices on the k-shaped that match the actual code storage location after being done. Through this, the virtual code generating means 10 generates a virtual code and then it is provided to the virtual code verifying means 20, and even if there is a delay time, the virtual code verifying means 20 is a real code corresponding to the virtual code. You can navigate the code exactly.

In another embodiment, as in FIG. 9 , the virtual code verification means 20 applies the first code or the second code to the inverse function of the first function or the second function, and the virtual code is normally generated. It further includes; verifying whether the code corresponds to the step (S500). For example, the first code is a code value corresponding to the number of counts elapsed from the initial time point when a specific virtual code generating function and a 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 elapsed after issuing the real code to the generating means 10, the virtual code verification means 20 issues the real code after driving the virtual code generating function when storing the real code in the storage location The elapsed time (Ts) is stored together. 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 the time of driving the virtual code generating function to the time of generating the virtual code, and the second in the virtual code By applying the inverse function of the second function to the code, the elapsed time (T2) from the issuance of the actual code to the generation of the virtual code is calculated. Thereafter, the virtual code verification means 20 verifies the virtual code by determining whether the difference between T1 and T2 corresponds to Ts.

In addition, 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 codes (S600); setting the first reception code as a first code using the first reception code as the starting point when the first reception code is included within an tolerance range from the first generation code (S700); and determining that the first reception code is an abnormal code when it is outside the tolerance range from the first generation code (S800). In the virtual code generating means 10 and the virtual code verifying means 20, the same unit count elapses as time passes. However, since there is an error between the timer included in the virtual code generating means 10 and the virtual code verifying means 20, the number of counts elapsed at the same time may be different. Therefore, a process for determining an abnormal code rather than a normal virtual code is required while eliminating the error caused by the timer. To this end, the virtual code verification means 20 includes a first generation code that is a first code generated at a specific count by a first function inside, and a first code that is a first code in the virtual code received from the virtual code generation means 10 . Compare 1 received code (S600), and if the number of counts that differ between the first generated code and the first received code falls within the tolerance range, it is determined as a normal code, and then the actual code search process is performed based on the first received code. and (S700), if the number of counts different between the first generation code and the first reception code exceeds the allowable error range, it is determined as an abnormal code (S800).

Further, in another embodiment, when the virtual code further includes a security code of a specific number, the virtual code verification means generates the received security code received from the virtual code generating means and the virtual code verification means generated in the virtual code verification means. It further includes; verifying the virtual code by determining whether the generated security code matches.

The virtual code providing method 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, which is hardware, and stored in a medium.

The above-described program is C, C++, JAVA, machine language, etc. that a processor (CPU) of the computer can 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 code (Code) coded in the computer language of Such code may include functional code related to functions defining functions necessary for executing the methods, etc. can do. In addition, the code may further include additional information necessary for the processor of the computer to execute the functions or code related to memory reference for which location (address address) in the internal or external memory of the computer to be referenced. have. In addition, when the processor of the computer needs to communicate with any other computer or server located remotely in order to execute the above functions, the code uses the communication module of the computer to determine how to communicate with any other computer or server remotely. It may further include a communication-related code for whether to communicate and what information or media to transmit and receive during communication.

The storage medium is not a medium that stores data for a short moment, such as a register, a cache, a memory, etc., but a medium that stores data semi-permanently and can be read by a device. Specifically, examples of the storage medium 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 accessible by the computer or in various recording media on the computer of the user. In addition, the medium may be distributed in a computer system connected by a network, and a computer readable code may be stored in a distributed manner.

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

First, a virtual code is newly created for each unit count, and since the overlapping virtual code does not appear within a predetermined period, it provides an effect that the actual code is not leaked even when the virtual code is leaked.

Second, since the algorithm for generating virtual code and searching for real code only needs to be added to the virtual code generating device and the device using the real code (eg, financial company server, IOT device, etc.), the existing process using the real code can be maintained as it is. can For example, if a virtual card number that is not duplicated on a smart card or an app card is generated and provided, the POS device and the PG company server are maintained as they are, and the virtual card number is transferred to the card company server, and the card server sends the virtual card number to the card company server. You can proceed with the payment by searching for the corresponding actual card number. Through this, it is possible to minimize the part that needs to be changed within the existing process to increase security, and the user does not need to perform a separate step for improving security.

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

As mentioned above, although embodiments of the present invention have been described with reference to the accompanying drawings, those skilled in the art to which the present invention pertains can realize that the present invention can be embodied in other specific forms without changing its technical spirit or essential features. you will be able to understand Therefore, it should be understood that the embodiments described above are illustrative in all respects and not restrictive.

Claims (10)

receiving, by the virtual code verification unit, the virtual code generated based on the detailed code by the virtual code generating unit;
extracting, by the virtual code verification means, a detailed code from the virtual code; and
Including, by the virtual code verification means, searching for a real code based on the detailed code;
The detailed code is to be changed for every unit count set at a specific time interval,
A virtual code-based real code search method. According to claim 1,
The detailed code is generated based on the device identification value,
The device identification value is a value assigned differently to the virtual code generating means,
A virtual code-based real code search method. According to claim 1,
The virtual code further includes a fixed code,
The virtual code verification means extracts a fixed code included in the received virtual code, determines the group including the virtual code generation means, and determines a virtual code generation function or a search algorithm corresponding to the group,
A virtual code-based real code search method. According to claim 1,
The virtual code includes a plurality of detailed codes generated by the virtual code generating means,
The virtual code verification means determines a search order based on the correlation between the plurality of detailed codes, and searches the real code according to the determined search order,
A virtual code-based real code search method. 5. The method of claim 4,
The plurality of detailed codes include a first code and a second code,
The first code is used to search for a starting point of the actual code,
The second code is used to search the storage path of the actual code from the starting point,
A virtual code-based real code search method. generating, by the virtual code generating means, a detailed code;
generating, by the virtual code generating means, a virtual code based on the detailed code; and
and providing, by the virtual code generating means, the virtual code to the outside;
The detailed code is used for the virtual code verification means to search for the actual code, and is changed for every unit count set at a specific time interval,
A virtual code-based real code search method. 7. The method of claim 6,
The virtual code includes a plurality of detailed codes generated by the virtual code generating means,
The plurality of detailed codes include a first code and a second code,
The first code is used to search for a starting point of the actual code,
The second code is used to search the storage path of the actual code from the starting point,
A virtual code-based real code search method. A computer program stored in a computer-readable recording medium in combination with a computer as hardware to execute the virtual code-based real code search method of any one of claims 1 to 7. a virtual code receiving unit for receiving the virtual code generated based on the detailed code by the virtual code generating means;
a detailed code extraction unit for extracting the detailed code included in the virtual code; and
Including; a real code search unit that searches for an actual code based on the detailed code,
The detailed code is to be changed for every unit count set at a specific time interval,
Virtual code verification device. a detailed code generation unit that generates a detailed code;
a virtual code generator for generating a virtual code based on the detailed code; and
and a virtual code providing unit that provides the virtual code to the outside.
The detailed code is used for the virtual code verification means to search for the actual code, and is changed for every unit count set at a specific time interval,
Virtual code generator.

Images