WO2020032344A1 - Procédé, appareil et système de vérification de code virtuel basé sur quelque chose de concret - Google Patents

Procédé, appareil et système de vérification de code virtuel basé sur quelque chose de concret Download PDF

Info

Publication number
WO2020032344A1
WO2020032344A1 PCT/KR2019/004719 KR2019004719W WO2020032344A1 WO 2020032344 A1 WO2020032344 A1 WO 2020032344A1 KR 2019004719 W KR2019004719 W KR 2019004719W WO 2020032344 A1 WO2020032344 A1 WO 2020032344A1
Authority
WO
WIPO (PCT)
Prior art keywords
code
virtual
virtual code
storage location
search algorithm
Prior art date
Application number
PCT/KR2019/004719
Other languages
English (en)
Korean (ko)
Inventor
유창훈
Original Assignee
주식회사 센스톤
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR1020190015769A external-priority patent/KR102143425B1/ko
Application filed by 주식회사 센스톤 filed Critical 주식회사 센스톤
Priority to EP19847407.4A priority Critical patent/EP3836061B1/fr
Publication of WO2020032344A1 publication Critical patent/WO2020032344A1/fr
Priority to US17/170,698 priority patent/US11995650B2/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists

Definitions

  • the present invention relates to a method, apparatus, and system for verifying a virtual code based on a sphere. More specifically, the virtual code is generated by using a virtual code generation function, and the actual code is applied to a virtual code by applying a different storage location search algorithm to each group.
  • the present invention relates to a method, an apparatus, and a system for verifying a virtual code based on a sphere.
  • Code form data is used in many areas.
  • IPIN number and social security number for user identification are code form data.
  • the present invention is a sphere-based virtual code verification method that can determine the group of the virtual code generation means through the fixed code included in the virtual code, and to search the actual code by applying the storage location search algorithm for the group to the virtual code, An apparatus, and system are provided.
  • the present invention is to provide a sphere-based virtual code verification method, apparatus, and system for providing virtual code that is newly generated at unit count intervals without being duplicated within the entire period in all the virtual code generating means.
  • a method of verifying a virtual code based on a virtual code wherein the virtual code verifying means receives the virtual code from the virtual code generating means, wherein the virtual code includes a fixed code and a plurality of detailed codes.
  • Virtual code receiving step A storage location search algorithm selection step of the virtual code verification means determining the group to which the virtual code generation means belongs through the fixed code, and selecting a storage location search algorithm for the group;
  • a detailed code extraction step of the virtual code verification means extracting the plurality of detailed codes included in the virtual code;
  • the detail code is extracted using a detail code combining function corresponding to the selected storage location search algorithm
  • the storage location search algorithm is generated for each group and included in the virtual code verification means
  • Each storage location search algorithm generated for each group has a cross-sectional shape
  • each storage location search algorithm is formed to form a three-dimensional figure
  • the virtual code verification means is the virtual code generation means.
  • the storage location search algorithm by extracting the cross section corresponding to the group to which the object belongs; Characterized in that the selection.
  • the three-dimensional figure is cut into parallel cross-sections, characterized in that consisting of a plurality of cutting planes of different sizes.
  • the three-dimensional figure is cut into a cross section passing through the center of the figure is characterized in that consisting of a plurality of cutting planes different in slope.
  • the detail code may include a first code for setting a start point of a storage location search; And a second code for setting a search path from the start point to the storage location according to a specific search method, wherein the first code and the second code are changed per unit count, and the unit count is specified. It is set to a time interval and changes as the time interval elapses.
  • the first code is generated based on a unit count that has elapsed from the time when the storage location search algorithm for the group to which the virtual code generation means belongs starts.
  • the starting point of the storage location search algorithm is determined by displaying an identification number of a cross section used for the corresponding storage location search algorithm in a count on the track where the storage location search algorithm starts to be driven. will be.
  • the second code is generated based on the unit count that has elapsed since the new generation of the actual code for the virtual code generating means.
  • the actual code search step wherein the storage location search algorithm corresponds to a vertex at a point where k-squares are arranged on a track in which k (k is M N ) codes are listed.
  • k-shaped cross sections of different sizes are formed to form a sphere.
  • an identification mark is provided at a vertex corresponding to the start point of the driving of the storage location search algorithm in the cross section of the k-angle used for the storage location search algorithm. As a result, the driving start time of the storage location search algorithm is determined.
  • the actual code when a new actual code generation is requested for a specific count from a specific virtual code generating means, the actual code is stored in a storage location corresponding to a specific vertex of a k-square at the specific count,
  • the vertex further comprises a step of storing the actual code, which is in contact with the track at the particular count.
  • the actual code search step may include: generating a virtual track in which a cross section corresponding to a storage location search algorithm for the group contacts, and searching for the actual code storage location.
  • the sphere-based virtual code verification program according to another embodiment of the present invention is combined with hardware to execute the above-described sphere-based virtual code verification method and stored in a medium.
  • a sphere-based virtual code verification apparatus includes a receiving unit for receiving a virtual code including a fixed code and a plurality of detailed codes from a virtual code generation device; A storage location search algorithm selection unit for determining a group to which the virtual code generation device belongs through the fixed code, and selecting a storage location search algorithm for the group; A detail code extracting unit extracting the plurality of detail codes included in the virtual code; And an actual code search unit for searching a storage location of an actual code by applying the storage location search algorithm to the extracted plurality of detailed codes, wherein the fixed code is generated by fixing a location in a virtual code.
  • the detail code is extracted by using a detail code combining function corresponding to the selected storage location search algorithm.
  • the storage location search algorithm is generated for each group and included in the virtual code verification means, and each storage generated for each group.
  • Each of the location search algorithms has a cross-sectional shape, and each of the storage location search algorithms is formed to form a three-dimensional figure.
  • the virtual code verification device is a section corresponding to a group to which the virtual code generation device belongs. Extracting from the three-dimensional figure to select the storage location search algorithm
  • the detailed code includes a first code and a second code, wherein the first code is generated based on a unit count that has elapsed from the time when the storage location search algorithm for the group to which the virtual code generator belongs is started. The second code is generated based on the unit count that has elapsed since the new generation of the actual code for the virtual code generation device.
  • the three-dimensional figure is cut into parallel cross-section is characterized in that consisting of a plurality of cutting planes of different sizes.
  • the three-dimensional figure is cut into a cross section passing through the center of the figure is characterized in that consisting of a plurality of cutting planes different in slope.
  • the process using the actual code remains intact.
  • the POS device and the PG company server are maintained as they are, and the virtual card number is transmitted to the card company server, and the card company server receives the virtual card number. You can proceed to payment by searching for the actual card number corresponding to. Through this, the part that needs to be changed in the existing process can be minimized to increase security, and the user does not have to perform a separate step for improving security.
  • the virtual code generation function may be implemented in various ways, and thus, different virtual code generation functions may be applied for each group and application field.
  • the group of the virtual code generating apparatus is determined through the fixed code included in the virtual code, and the storage location search algorithm for the group is applied to the virtual code to search for the actual code.
  • FIG. 1 is a block diagram of a virtual code providing system according to an embodiment of the present invention.
  • FIG. 2 is a block diagram of a virtual code generation apparatus according to an embodiment of the present invention.
  • 3 and 4 are configuration diagrams of a virtual code verification apparatus according to embodiments of the present invention.
  • FIG. 5 is a flowchart of a virtual code providing method according to an embodiment of the present invention.
  • 6A and 6B are exemplary diagrams for describing generating a storage location search algorithm for each group according to an embodiment of the present invention.
  • FIG. 7 is an exemplary diagram for explaining that a plurality of storage location search algorithms are driven at different points on a track according to an embodiment of the present invention.
  • FIG. 8 is an exemplary diagram of a storage location search algorithm for searching a real code storage location by moving a cloud of a k-square according to an embodiment of the present invention.
  • FIG. 9 is a flowchart of a virtual code providing method including an actual code searching process according to k-shaped cloud movement according to an embodiment of the present invention.
  • FIG. 10 is a flowchart of a virtual code providing method further comprising the step of issuing an actual code and storing the same in a storage location according to an embodiment of the present invention.
  • FIG. 11 is a flowchart of a virtual code providing method further comprising a virtual code verification process according to an embodiment of the present invention.
  • FIG. 12 is a flowchart of a virtual code providing method further comprising a process of determining whether an abnormal code of a virtual code is in accordance with an embodiment of the present invention.
  • FIG. 13 illustrates a computing device, in accordance with an embodiment of the present invention.
  • a component when referred to as being 'connected' or 'connected' to another component, the component may be directly connected to or connected to the other component, but in between It will be understood that may exist.
  • a component when referred to as 'directly connected' or 'directly connected' to another component, it should be understood that there is no other component in between.
  • 'letter' is a component constituting the code, and includes all or part of uppercase alphabet, lowercase alphabet, numbers, and special characters.
  • 'code' means a string in which characters are listed.
  • 'real code' means a code that is actually used.
  • the code is a card number
  • the actual code may be an actual card number issued to a card of a specific user at the card company.
  • 'virtual code' refers to a code that is temporarily generated to be connected to an actual code.
  • the virtual code may include a virtual card number and a virtual token.
  • the virtual card number and the virtual token are a card number that is temporarily generated to be linked to the actual card number, and is a code of a specific digit consisting of letters including numbers.
  • the 'detail code' means a part 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 refers to individual codes that are generated separately and constitute the virtual code.
  • the 'unit count' is a unit defined as being set as a specific time interval and changing as the time interval elapses. For example, one count may be set and used at a specific time interval (for example, 1.5 seconds).
  • the 'virtual code generation function' means a function used to generate virtual code.
  • 'smart card' refers to a card that can be output by changing the card number.
  • 'cloud movement' means a translational movement while the object rotates.
  • 'cloud movement' is to move while performing a rotational motion and a translational movement together, and means that each point of the rotating object moves while being in contact with the moving axis in turn.
  • FIG. 1 is a block diagram of a virtual code providing system according to an embodiment of the present invention.
  • a virtual code providing system includes a virtual code generating means 10 and a virtual code verifying means 20.
  • the virtual code generation means 10 serves to generate a virtual code including information that the virtual code verification means 20 can search for the actual code. That is, the virtual code generating means 10 generates the 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 generation means 10 may not store the actual code. Through this, the actual code may be prevented from leaking through the 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 the actual code based on the virtual code provided from the virtual code generation means 10.
  • the virtual code verifying means 20 stores the same virtual code generating function as the virtual code generating means 10 for searching for the actual code from the virtual code received from the virtual code generating means 10. A detailed description of the method in which the virtual code verification means 20 searches for the actual code based on the virtual code will be described later.
  • the virtual code verifying 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 the method for determining whether the virtual code verification means 20 is normal is 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 be directly input from the user to the virtual code generated by the virtual code generation means 10 provided to the user.
  • the virtual code verification means 20 may be received from another server that receives the virtual code from the virtual code generation means 10.
  • the virtual code generating means 10 is a payment card
  • the virtual code is a virtual card number replacing the actual card number
  • the virtual code verification means 20 is a card company server including a virtual code generating function.
  • the virtual code verification means 20 receives a virtual card number (ie, a virtual code) from a PG company server that has 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 instead of the actual card number from the virtual code generation means 10 using the existing payment process.
  • the virtual code when the virtual code is a virtual token, the virtual code generating means 10 is a virtual token generating means, and the virtual code verifying means 20 is a virtual token verifying means, the virtual token generating means is connected to a payment terminal.
  • the payment service server can receive the virtual token from the payment terminal and deliver it to the virtual token verification means.
  • the virtual token generating means transmits the virtual token to the payment service server through a program connected with the payment service server, and the payment service server may deliver the virtual token to the virtual token verification means.
  • the payment service server includes both a virtual token generating device or a store terminal device and a server of an operator connecting or assisting a payment service between the virtual token verification server or the financial company server.
  • the virtual code verification means 20 and the virtual code generation means 10 include the same virtual code generation function.
  • the virtual code verifying means 20 and the virtual code generating means 10 include the same virtual code generating function, the virtual code verifying means 20 generates a plurality of virtual codes in the virtual code generated by the virtual code generating means 10. The detail code can be extracted properly.
  • the virtual code verifying means 20 may verify whether the received virtual code is generated and received by the normal virtual code generating means 10. That is, the code received from the virtual code generation means 10 after the virtual code verification means 20 performs the generation of the code (that is, the virtual code or the specific detail code) under the same conditions as the virtual code generation means 10. (I.e., virtual code or specific subcode) can be performed to verify.
  • FIG. 2 is a block diagram of a virtual code generation device 100 according to another embodiment of the present invention.
  • the virtual code generating apparatus 100 includes a detailed code generating unit 110, a virtual code generating unit 120, and a virtual code providing unit 130. do.
  • a program corresponding to the virtual code generating means 10 is embedded or a program (or application) corresponding to the virtual code generating means 10 is installed. It may be a device.
  • the virtual code 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.
  • the virtual code generating apparatus 100 when the virtual code is a virtual card number, the virtual code generating apparatus 100 may be a mobile terminal in which an app card application corresponding to the virtual code generating means 10 is installed.
  • the virtual code generating apparatus 100 when the virtual code is a virtual authentication key for an Internet of Things (IOT) device, the virtual code generating apparatus 100 includes a control in which a program corresponding to the virtual code generating means 10 is 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 a server) in addition to the example described above.
  • the virtual code when the virtual code is a virtual token, the virtual code generating apparatus 100 may be a mobile terminal in which the virtual token generating program is embedded.
  • the virtual code generation unit 120 serves to generate a virtual code by combining a fixed code and one or more detailed codes.
  • the virtual code is generated by combining a fixed code and a plurality of detailed codes according to a specific rule.
  • the fixed code is an unchanged code for distinguishing the group of the virtual code generating means 10, and is fixedly located at the first position in the virtual code.
  • the virtual code generation function includes a rule for combining a plurality of detail codes (ie, a detail code combining function).
  • Various methods may be used as a method of generating one virtual code by combining a fixed code and a plurality of detailed codes.
  • the virtual code generation unit 120 generates a virtual code by alternately arranging the first N code and the second N code in the remaining digits except for the position of the fixed code. Can be.
  • the detail code combining function may be a function of combining the second code after the first code. As the detailed codes included in the virtual function increase, various detailed code combining functions may be generated.
  • the detail code generation unit 110 serves to generate one or more detail codes.
  • the virtual code generation function includes each detailed code generation function.
  • the virtual code generation function generates a plurality of detail codes using a plurality of detail code generation functions, and generates a virtual code using a detail code combining function that combines the plurality of detail codes.
  • the detail code generation unit 110 generates the first code and the second code, including the first function and the second function as the detail code generation function.
  • 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 the security
  • the second function for generating the first function and the second code may be included as a detailed code generation function, and may not include data on the correlation between the first code and the second code.
  • the virtual code may include a fixed code that is not changed to distinguish a group together with a plurality of detailed codes.
  • the virtual code verification means 20 may include a plurality of virtual code generation functions respectively corresponding to a plurality of groups.
  • the virtual code generation device 100 belongs to the group to which the corresponding virtual code generation device 100 belongs.
  • the actual code search must 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 each time the unit count has elapsed, the group to which the virtual code generating apparatus 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 the group.
  • the virtual code generation device 100 fixes the first six digits of the card number indicating the card company and the card type.
  • the virtual code verification means 20 may identify a specific card type of a specific card company to which the same virtual code generation function as that of the virtual code generation device 100 is applied.
  • the virtual code generation device 100 sets 6 digits corresponding to the date of birth among all 13 digits of the resident registration number as a fixed code. In addition, the remaining seven digits can be newly generated per 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 six digits of the fixed code.
  • the virtual code may further include a security code.
  • the virtual code includes a plurality of detail 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 the virtual code is normal.
  • the security code generation function generates a security code having a specific number of digits using the time data and the unique value of the virtual code generation means as a function value.
  • the virtual code verification means 20 receives the intrinsic value of the virtual code generation apparatus 100 (for example, the inherent value of the chip in the smart card or the intrinsic value of the smart phone installed with the app card) when the actual code is issued. It can be saved together in the storage location of the code or in a separate storage space connected to the storage location of the actual code.
  • the virtual code generation device 100 generates the virtual code combined with the security code and provides the virtual code to the virtual code verification means 20, the virtual code verification means 20 receives the time data for which the virtual code is generated based on the detailed code.
  • the virtual code verification means 20 matches the security code (ie, reception security code) received from the virtual code generation device 100 with the security code (that is, generation security code) calculated through the security code generation function stored therein. Determine if you do.
  • the virtual code verifying means 20 determines that the virtual code is normal and receives the actual security code when the received security code matches the generated security code.
  • the security code is a card security number.
  • the virtual code generation device 100 generates a three-digit or four-digit security code corresponding to the card security number using the security code generation function, and when the security code is input as the card security number when the card is used, the virtual code
  • the verification means 20 performs a process of verifying the security code.
  • the security code generation function may generate a code having a different l digit (l is a natural number) for each count and may be applied together as a function value. That is, the security code generation function may include a random code generation function of l digits.
  • the first code and the second code play a respective role for searching the storage location where the actual code is stored.
  • the first code sets the start point of the storage location search
  • the second code sets the search path from the start 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 generating apparatus 100, the virtual code verifying means 20 according to the search path corresponding to the second code from the search start point corresponding to the first code. The moving point is judged as the storage location of actual code.
  • a detailed method of searching for a storage location based on the first code and the second code constituting the virtual code will be described later.
  • the first code and the second code may be equally added by the OTP code randomly generated from the time point at which the actual code is issued or the time point at which the virtual code generation is requested in the virtual code generation apparatus 100. . Specifically, when the OTP code is reflected based on the time when the actual code is generated, the first code is counted from the time when the storage location search algorithm starts to be driven (that is, the start time of driving) to the time when the actual code is issued. The OTP code randomly assigned at a specific time point is added to the count value, and the second code may be the OTP code value itself.
  • the first code counts from the point at which the storage location search algorithm starts to be driven (ie, the start point of driving) to the point at which the virtual code is generated.
  • the second code may be a count value added as much as the OTP code to the count from the actual code issuing point to the virtual code generation request point.
  • the virtual code verifying means 20 extracts the OTP codes reflected in the first code and the second code and compares them with the OTP values by the same OTP function in the virtual code verifying means 20. ) Can be used to verify that the virtual code generated in the past is not used.
  • the detail code generation unit 110 In one embodiment of the method in which the detail code generation unit 110 generates the detailed code, the detail code generation unit 110 generates a new detailed code for each unit count, and accordingly, the virtual code generation device 100 generates a unit count. Create a new virtual code every time. Newly generated virtual codes per unit count are not duplicated.
  • the detail code generation unit 110 not only generates a virtual code newly 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 includes users belonging to a specific group. It is set not to duplicate.
  • the detailed code generation function included in the virtual code generation function is M N pieces.
  • a code can be generated as a first code or a second code, and each code is matched for each count from the initial time at which the detail 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 detail code generation function is initially driven.
  • a period using a specific detail code generation function or a period of use of the virtual code generation device 100 corresponds to the M N count (for example, for example, when one count is 1 second, when the length of time is shorter than M N seconds), the first code or the second code is not duplicated with the same code during the use period. That is, when the count increases as time passes, when the user requests a virtual code generation request to the virtual code generation apparatus 100 at a specific time point, the virtual code generation device 100 matches the count corresponding to the specific time point.
  • the code value can be generated as a first code or a second code.
  • an embodiment of the present invention provides a function for generating a first code or a second code when the use period of the virtual code generating apparatus 100 elapses (that is, the first code). Function or the second function) or the matching relationship between the first code and the second code, so as to generate a virtual code different from the previous use cycle.
  • the virtual code generator 100 May apply a virtual code generation function that generates a virtual code different from the previous cycle to the new cycle, as the order in which the first code or the second code appears differs from the previous cycle.
  • the virtual code generating apparatus 100 may prevent 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 (that is, 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 second function is not included among the matching relationships included in the previous use period in all counts of the new use period. That is, the virtual code generation function of the new usage cycle that does not generate the virtual code overlapping with the previous usage cycle is applied by adjusting or updating the virtual code generation function after the usage cycle that can apply M N codes once. Can be.
  • the virtual code generation means 10 and the virtual code verification means 20 may store a rule for updating the virtual code generation function. That is, the virtual code generating means 10 and the virtual code verifying means 20 may store an order or rule for applying a plurality of first functions and second functions to each use cycle.
  • any one of the first code or the second code included in the virtual code 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 (that is, a device identification value) that always exists differently at the same time at least for each virtual code generating device 100.
  • the device identification value is a time when the virtual code generation device 100 specific to the group to which the specific detail code generation function is applied (for example, the specific detail code generation function within the virtual code verification means 20).
  • the time may be a time (or count) elapsed from the time when the detailed code generation function starts to be applied to a specific virtual code generation device 100.
  • the counts for setting the virtual code generating apparatus 100 to belong to the group are not the same (that is, the virtual code generating apparatus 100 corresponds to the corresponding group). If it cannot be belonged to the group at the same time), the elapsed time from the time point (or count) from which the virtual code generation device 100 belongs to the group to the specific time point is different for each virtual code generation device 100.
  • At least one of the detailed code generation functions uses the elapsed time from the time point (or count) from which the virtual code generation device 100 belongs to the group to the specific time point as the device identification value, and each virtual time point for each virtual time point.
  • the virtual code generated by the code generation device 100 may be different.
  • the virtual code verification means 20 can be distinguished from the virtual code generation device 100 only by receiving the virtual code without separately receiving data for distinguishing the user.
  • the virtual code generation device 100 is a card (for example, a smart card or an app card) that can change the output card number, 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 that group.
  • a card issuance request is made to the first virtual code generation device 100 (that is, the virtual code generation device 100 of the first user) at the time when the first user has elapsed A hours from the time of driving the virtual code verification means 20.
  • the second virtual code generating device 100 that is, the virtual code generating device of the second user
  • the second user passes by the time B (B is greater than A) from the time when the virtual code verification means 20 is driven.
  • the detail code generation function may be configured to apply the time length elapsed from the time point at which the card is issued to each virtual code generation device 100 as a variable, so that the same virtual card number is not generated at the same time point.
  • the detailed code generated by the specific virtual code generation apparatus 100 (for example, the second code) is not generated with the same value but is continuously generated with a different value.
  • the first code is a first function in the virtual code verification means 20 so that the duplicated virtual code is not generated regardless of the user in the entire cycle. Is set to a code value corresponding to a time point (or a count) for which virtual code generation is requested among the codes matched for each count from the initial time point at which the second time is driven, and the second code is always different at the same time point for each virtual code generating apparatus 100. It is set to a code value generated by reflecting the existing value (that is, the device identification value), the virtual code may be used as a code value combined with the first code and the second code.
  • the first code has a different code value for each count
  • 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 has all virtual codes.
  • the output device 100 outputs a different code value at every time point.
  • any one of a plurality of listing rules for arranging M characters in ascending order is applied to the virtual code generating function (or detailed code generating function). That is, the virtual code generating apparatus 100 (that is, the virtual code generating means 10) may apply various rules for arranging M characters in ascending order to the detailed code generating function included in the virtual code generating function.
  • an ordering rule that lists the uppercase alphabetic characters in ascending order may be in the order of A, B, C, ..., Z in the general order, or in the order of A, C, B, ..., Z. have.
  • the ordering rules change in the virtual code generation function, the order in which codes are matched in turn is changed from the initial point when the virtual code generation function is driven.
  • the virtual code verification means 20 may make codes generated according to the same enumeration rule match each count, or may store the same enumeration rule itself in the virtual code generation function. Therefore, the virtual code generation function for each group may include different subcode combining functions or different character ordering rules, and thus have different virtual code generation functions for each group.
  • the virtual code providing unit 130 serves to output the virtual code to the external to provide the virtual code verification apparatus 200.
  • the virtual code providing unit 130 may include various configurations that can provide the virtual code to the outside.
  • the virtual code providing unit 130 includes all or part of a wireless communication module, a short range communication module, an IC chip, a magnetic field generating unit, and a display unit.
  • the wireless internet module refers to a module for wireless Internet access. It may be built in or external to the terminal 100.
  • Wireless Internet technologies include Wireless LAN (Wi-Fi), Wireless broadband (Wibro), World Interoperability for Microwave Access (Wimax), High Speed Downlink Packet Access (HSDPA), long term evolution (LTE), LTE-A Long Term Evolution-Advanced and the like can be used.
  • the short range communication module refers to a module for short range communication.
  • Short range communication technology Bluetooth, Bluetooth Low Energy (BLE), Beacon, Radio Frequency Identification (RFID), Near Field Communication (NFC), Infrared Data Association (IrDA) , UWB (Ultra Wideband), ZigBee, etc. may be used.
  • RFID Radio Frequency Identification
  • NFC Near Field Communication
  • IrDA Infrared Data Association
  • UWB Ultra Wideband
  • ZigBee ZigBee, etc.
  • the virtual code providing unit 130 may include a magnetic field generating unit or an IC chip when the virtual code generating apparatus 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 one or more magnetic cells that form a magnetic field through current flow and output card information magnetic signals.
  • the magnetic field generating unit may be provided to be exposed to the upper or lower surface of the PCB board along the long side adjacent to a specific long side of the PCB plate of the card.
  • the IC chip is mounted in the PCB board to exchange data by contacting the terminal of the IC type card reader. That is, the IC chip transfers the virtual code generated by the virtual code generation unit 120 to the card reader of the IC method.
  • the display unit includes a liquid crystal display, a thin film transistor-liquid crystal display, an organic light-emitting diode, a flexible display, and an electronic paper. It may also include at least one.
  • the display unit visually outputs the virtual code generated by the virtual code generation unit 120 to the outside.
  • the user of the virtual code generation device 100 can visually check the virtual code generated in real time, and can directly input the virtual code visually confirmed to the virtual code verification means (20).
  • the user may transmit the virtual code displayed on the display through various paths such as a text message. Since the actual code is not transmitted, but the virtual code (specifically, a code that is continuously changed and generated) for searching for the actual code is transmitted from the virtual code verification means 20, when the user transmits the code through a text message or the like. You don't have to worry about actual code leaks.
  • FIG. 3 is a block diagram of a virtual code verification apparatus 200 according to an embodiment of the present invention.
  • the virtual code verification apparatus 200 according to another embodiment of the present invention, the virtual code receiving unit 210, storage location search algorithm selection unit 220, detailed code extraction unit 230, And an actual code search unit 240.
  • the virtual code verification apparatus 200 may be an electronic device or a server device.
  • the virtual code verification device 200 may be 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 the storage location of the actual code based on the virtual code, and can be driven when the actual code is extracted from the specific storage location.
  • 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 and then searches for the actual card number to make a 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 receiver 210 serves to receive a virtual code including a fixed code and a plurality of detailed codes from the virtual code generation device 100.
  • the virtual code receiver 210 may include a wireless communication unit (for example, a wireless communication module or a short-range communication module) to receive the virtual code from the virtual code generating apparatus 100 through wireless communication.
  • the virtual code receiver 210 may receive the virtual code generated by the virtual code generation device 100 through communication with another server.
  • the virtual code receiver 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 apparatus 100 from a user. For example, if the virtual code generation 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 visually display the virtual code generation device 100. The code may be checked and directly input to the user input unit of the virtual code verification apparatus 200.
  • the virtual code generating apparatus 100 has a display unit at the number of digits that can be changed (for example, the first 6 digits (fixed code) and the last digit except for the card company and the card type) among 16 digits of the card number.
  • a virtual code is generated, a character is output in place of a changeable code.
  • the user may input the unchanged code and the entire changed code into virtual codes and input them to the user input unit (ie, the virtual code receiver 210) of the virtual code verification apparatus 200.
  • the storage location search algorithm selecting unit 220 determines a group to which the virtual code generation apparatus 100 belongs through the fixed code, and selects a storage location search algorithm for the group from a plurality of storage location search algorithms. In this case, since the fixed code is located at a fixed position in the virtual code, for example, the first six digits of the virtual code, the storage location search algorithm selecting unit 220 may extract the fixed code from the received virtual code. Thereafter, the storage location search algorithm selection unit 220 may identify the group of the virtual code generation apparatus 100 through the extracted fixed code. In addition, the storage location search algorithm is generated for each group and included in the virtual code verification apparatus 200. That is, the virtual code verification apparatus 200 includes a plurality of storage location search algorithms, so that the storage location search algorithm for the group to which the virtual code generation device 200 belongs may be determined among the plurality of storage location search algorithms.
  • the storage location search algorithm selecting unit 220 is included in the virtual code. Based on the fixed code, a cross section corresponding to the matching storage location search algorithm can be searched. Specifically, as shown in FIG. 6A, a three-dimensional figure including a plurality of storage location search algorithms generates a k-square having similarity when cut into a flat cross section, and the plurality of cross sections are matched to a specific fixed code. That is, the storage location search algorithm selection unit 220 selects a specific cross section of the three-dimensional figure matched to the fixed code separated at a specific position (for example, the first six digits) in the virtual code.
  • each of the storage location search algorithms generated for each group forms a cross-section having a different size, and thus, each storage location search algorithm gathers to form a three-dimensional figure.
  • the device 200 selects a storage location search algorithm by extracting a cross section corresponding to a group to which the virtual code generation device 100 belongs from a three-dimensional figure. For example, if the storage location search algorithm is a circular cross section, a plurality of circular cross sections are gathered to form a sphere, and the virtual code verification apparatus 200 generates a virtual code from a plurality of circular cross sections forming a sphere.
  • the storage location search algorithm for the group to which the device 100 belongs may be selected.
  • a plurality of cross sections passing through a center and passing through a straight line parallel to the direction in which the three-dimensional figure moves may be matched to each storage location search algorithm.
  • the plurality of cross-sections may be the same circle, only the degree of inclination is different.
  • the virtual code verification means searches for a specific section in the three-dimensional diagram by the storage location search algorithm selection unit 220, a detailed method of searching for the actual code based on the plurality of detailed codes will be described later.
  • the detail code extracting unit 230 extracts a plurality of detail 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 230 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 230 uses the detailed code combining function. It is possible to extract a plurality of detailed codes 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 detail code extracting unit 230 is a character array of the virtual code. The first code and the second code can be separated by using the detail code combining function.
  • each virtual code is a combination of detailed codes according to different rules (that is, each virtual code is a different detailed code). Since the plurality of detail codes are combined by the combining function), the detail code extracting unit 230 stores the detail code combining function corresponding to the fixed code or the storage location search algorithm corresponding thereto. For example, the virtual code verification apparatus 200 selects a storage location search algorithm (for example, a specific cross section in a three-dimensional diagram used for the storage location search algorithm) based on the fixed code in the virtual code, and then extracts the detailed code. The plurality of detailed codes are extracted from the virtual code except the fixed code using the detailed code combining function stored by matching the fixed code by the unit 230.
  • a storage location search algorithm for example, a specific cross section in a three-dimensional diagram used for the storage location search algorithm
  • the actual code search unit 240 searches for a storage location of the actual code based on the plurality of detailed codes. Various methods may be used as the actual code search unit 240 to search the actual code storage location based on each detailed code.
  • the actual code search unit 240 may include correlations between the detailed codes in order to search the storage location based on the plurality of detailed codes.
  • the actual code search unit 240 determines a search start point corresponding to the first code, and The moving point from the search starting point according to the search path corresponding to the second code can be found as the storage location of the actual code.
  • the detail code may include a first code for setting a start point of a storage location search and a second code for setting a search path from the start point to the storage location according to a specific search method.
  • the virtual code generating means 10 (or the virtual code generating device 100) provides a new virtual code for each unit count
  • the first code and the second code for searching for a storage location are added. Changes after each unit count has elapsed.
  • the virtual code verification apparatus 200 may search the storage location of the actual code by setting a search start point and a search path based on the first code and the second code which change for each count.
  • the actual code search unit 240 may use a storage location search algorithm to find a storage location of the actual code using a plurality of detailed codes having a correlation.
  • the storage location search algorithm is an algorithm that enables the storage location search when each detailed code included in the virtual code is used. For example, if the virtual code includes a first code for determining a search start point of a storage location and a second code for indicating a storage location direction from the search start point, the storage location search algorithm corresponds to the first code. When a direction corresponding to the second code is indicated at a point, the algorithm adjusts the storage location to which the actual code matches.
  • the virtual code verification apparatus 200 may find a point matching the actual code storage location or the storage location even if the first code and the second code included in the virtual code are changed.
  • the storage location search algorithm can be applied in various ways, specific examples of which will be described later. However, the storage location search algorithm is not limited to the example described below.
  • 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 are listed, and the vertex of the k-angle is the first code.
  • each vertex of the k-square is matched with the actual code storage location, and the point where the first code track (ie, the first track) and the k-square correspond to the first It may be a storage location search start point corresponding to the code.
  • the actual code searcher 240 may apply a cloud movement to the k-square so that the vertex of the k-square is in contact with the point corresponding to the first code extracted by the detail code extractor 230.
  • the actual code searcher 240 divides the angle corresponding to the second code from the position on the first track where the k-square is in contact with the second code (for example, a specific angle obtained by dividing 180 degrees into M N to face the vertex of the k-square). ), It is possible to search for the vertex of the k-square that is a storage location where the actual code corresponding to the virtual code is stored.
  • the virtual code verification apparatus 200 moves the k-square to a point corresponding to the first code while moving the k-square (ie, each vertex of the k-square and each point on the track in turn). ) Thereafter, the virtual code verification apparatus 200 searches for a vertex corresponding to the storage location by indicating an angular direction corresponding to the second code. For example, since two counts have elapsed since the actual code is issued, the virtual code generating means B generates a second code applying two counts as a function value and provides the second code 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 an angle toward the vertex at the point where the k-square and the track contact each other (that is, the second code to which n counts are applied is stored). Since the cloud is moved by n counts of the cloud, the virtual code verification means applies an angle corresponding to the second code to the first code corresponding point to the actual code storage location. Find the vertex of the corresponding k-square.
  • the virtual code verification device 200 selects a storage location search algorithm.
  • the section selected by the unit 220 it is necessary to determine the time point at which the storage location search algorithm corresponding to the driving starts. That is, each storage location search algorithm in the virtual code verification apparatus 200 may start to be used from a different point of time, and thus a reference point of a path for searching a storage location using a plurality of detailed codes (for example, search start). The reference point reflecting the first code value may be different to determine the point. Therefore, in order to use the individual storage location search algorithms matched to the respective sections in one solid figure, the initial time point at which the storage location search algorithms of the respective sections are driven must be identified.
  • the virtual code verification apparatus 200 determines the time point at which each storage location search algorithm in the three-dimensional diagram is driven in various ways.
  • the virtual code verification apparatus 200 displays the identification number of each section on the count (or time point) at which the storage location search algorithm of each section starts to be driven on the track on which the three-dimensional figure is clouded.
  • the virtual code verification apparatus 200 selects a specific cross section using a fixed code in the virtual code, searches the identification number of the cross section on a track, and determines a driving start time of the storage location search algorithm using the cross section. .
  • the virtual code verification apparatus 200 provides an identification mark at a vertex corresponding to a driving start point of the storage location search algorithm in a k-shaped cross section, which is a specific cross-section used for the storage location search algorithm. Identify the starting point.
  • the actual code search unit 240 grasps a specific virtual card number driving start point, and then uses a selected cross section (ie, a k-square or a circle corresponding to a fixed code) in a three-dimensional figure, and then records the actual code according to a plurality of detailed codes on the track. To navigate to the stored location. For example, when any one of the parallel cross sections is selected and used as shown in FIG. 6A, and the plurality of detailed codes include the first code and the second code, the actual code search unit 240 contacts the selected cross section.
  • a selected cross section ie, a k-square or a circle corresponding to a fixed code
  • a track is generated, a search code is determined by applying a first code (for example, a cross section moves by a count corresponding to the first code) to the identified driving start point, and a cross section is applied by applying a second code. Find the actual code storage location (ie, k-square or circle).
  • the actual code when a plurality of cross-sections passing through the center of the three-dimensional figure and a straight line parallel to the direction in which the three-dimensional figure moves on the track is used for the storage location search algorithm, the actual code
  • the searcher 240 generates a virtual track in contact with the selected cross section, applies a first code to the identified driving start point (for example, the cross section moves by a count corresponding to the first code), and then starts the search point. Then, the second code is applied to search the actual code storage location on the cross section (that is, the k-square or the circle).
  • the first code and the second code may be equally added as the OTP code randomly generated from the time when the actual code is issued by the virtual code generation device or the time when the virtual code generation is requested. Specifically, when the OTP code is reflected based on the time when the actual code is generated, the first code is counted from the time when the storage location search algorithm starts to be driven (that is, the start time of driving) to the time when the actual code is issued. The OTP code randomly assigned at a specific time point is added to the count value, and the second code may be the OTP code value itself.
  • the first code counts from the point at which the storage location search algorithm starts to be driven (ie, the start point of driving) to the point at which the virtual code is generated.
  • the second code may be a count value added as much as the OTP code to the count from the actual code issuing point to the virtual code generation request point.
  • the virtual code verifying means extracts the OTP codes reflected in the first code and the second code and compares the OTP values by the same OTP function in the virtual code verifying means. You can verify that virtual code is not used.
  • the virtual code verification apparatus 200 may further include a virtual code verification unit 250.
  • the virtual code verification unit 250 serves to determine the authenticity of the virtual code received by the virtual code verification apparatus 200.
  • FIG. 5 is a flowchart of a virtual code providing method according to an embodiment of the present invention.
  • the virtual code verification means 20 receives the virtual code from the virtual code generating means 10 (S200; virtual code receiving step) ; Determining, by the virtual code verification means, the group to which the virtual code generation means belongs, and selecting a storage location search algorithm for the group (S300; storage location search algorithm selection step); Extracting, by the virtual code verification means, the plurality of detailed codes included in the virtual code (S400; detailed code extraction step); And searching the storage location of the actual code by applying the storage location search algorithm to the plurality of detailed codes extracted by the virtual code verification means (S1000; actual code search step).
  • S300 storage location search algorithm selection step
  • S400 detailed code extraction step
  • searching the storage location of the actual code by applying the storage location search algorithm to the plurality of detailed codes extracted by the virtual code verification means (S1000; actual code search step).
  • the virtual code verifying 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 function in the virtual code generating means 10 may be composed of a fixed code and a plurality of detailed codes.
  • the virtual code may be generated by combining the first code and the second code.
  • the first code and the second code are used by the virtual code verification means 20 to search for the location of the actual code, respectively.
  • the first code is a code for setting a starting point of the actual code storage location search by the virtual code verification means 20
  • the second code is a search from the start point to the storage location according to a specific search method. It can be code that sets the path.
  • the storage location search algorithm selection unit 220 is the fixed code in the virtual code. Extracts and determines a group of the virtual code generation means based on the fixed code, and determines a storage location search algorithm for the group from a plurality of storage location search algorithms (S300).
  • the virtual code verification means 20 is a virtual code generation means ( Distinguishing the group of the virtual code generating means 10 based on the fixed code in the virtual code received from 10), and a storage location searching algorithm for the group of the virtual code generating means 10 among a plurality of storage location searching algorithms. Determine.
  • the virtual code verification apparatus 200 is matched based on a fixed code included in the virtual code.
  • the section corresponding to the storage location search algorithm can be searched.
  • the three-dimensional figure containing a plurality of storage location search algorithm is to create a k-square that is similar when the cut to a flat cross-section, the plurality of cross-sections stored for a specific fixed code Matches the location search algorithm.
  • a plurality of cross sections passing through a center and passing through a straight line parallel to the direction in which the three-dimensional figure moves may be matched to each storage location search algorithm.
  • the plurality of cross-sections may be the same circle only different in the degree of inclination.
  • the search method of the actual code can be determined. Detailed description of the search method is described in detail in the actual code search step (S1000) to be described later.
  • the virtual code generation function is generated when the first code or the second code of N digits is formed by M characters on a track in which different M N (M and N are natural numbers) codes are listed. 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 per unit count. That is, the first function or the second function is a function for generating M N codes so that they do not overlap as the count increases, and generates a specific one of the M N codes as the first code or the second code at a count corresponding to a specific time point. do.
  • the virtual code generating means 10 does not generate the same first code or the second code repeatedly in the M N count (that is, the time length corresponding to the M N counts), and generates new detail codes (that is, every unit count). , First code or second code) to generate a new virtual code for each unit count.
  • the virtual code generation function when using the M N code as the first code or the second code by generating the first code or the second code of N digits with M characters, each code is detailed Each count is matched from the initial time when the code generation function is driven. For example, if the unit count is set to 1 second, the virtual code generation function matches different M N codes every second from the time when the sub-code generation function is initially driven.
  • a period using a specific detail code generation function or a period of use of the virtual code generation device 100 corresponds to the M N count (for example, for example, when one count is 1 second, when the length of time is shorter than M N seconds), the first code or the second code is not duplicated with the same code during the use period. That is, when the count increases as time passes, when the user requests the virtual code generation means 10 to generate the virtual code at a specific point in time, the virtual code generation device 100 matches the count corresponding to the specific point in time.
  • the code value can be generated as a first code or a second code.
  • At least one of the first code and the second code included in the virtual code may not be generated between users belonging to the same group at the same time.
  • Different first codes or second codes are generated by reflecting values assigned differently to the generating means 10.
  • the device identification value is a starting point (eg, the specific code generation function is driven within the virtual code verification means 20) including the virtual code generation means 10 specific to the group to which the specific detail code generation function is applied.
  • the specific code generation device 100 may be a time (or count) elapsed from the time when the detailed code generation function starts to be applied.
  • the virtual code verification means 20 May assign the group participation requests simultaneously received from the plurality of virtual code generation means 10 according to a predetermined condition, and process them as if the requests came in different counts.
  • the virtual code generation function may generate the second code based on the unit count that has elapsed since the new generation of the actual code.
  • At least one of the detailed code generation functions uses the elapsed time from the time point (or count) from which the virtual code generation device 100 belongs to the group to the specific time point as the device identification value, and each virtual time point for each virtual time point.
  • the virtual code generated by the code generation device 100 can always be different.
  • the virtual code verification means 20 can be distinguished from the virtual code generating means 10 only by receiving the virtual code without separately receiving data for distinguishing the user.
  • the detailed code generated by the specific virtual code generation apparatus 100 (for example, the second code) is not generated with the same value but is continuously generated with a different value.
  • the first code is requested to generate a virtual code from among codes matched for each count from an initial time at which the first function is driven so that duplicate virtual codes are not generated regardless of a user in the entire period.
  • the second code is a code value generated by reflecting a value (that is, device identification value) that always exists differently at the same time for each virtual code generating device 100.
  • 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 generation device 100 at the same time, so that the virtual code combined with the first code and the second code generates a virtual code.
  • the device 100 outputs a different code value regardless of the viewpoint.
  • the virtual code generation function includes a detail code combining function corresponding to a rule for arranging a plurality of detail codes. That is, the virtual code generation function may have a specific rule for arranging or arranging characters included in the plurality of detail codes. Accordingly, in the case of the virtual code generating means 10 and the virtual code verifying means 20 including the same virtual code generating function, the virtual code generating means 10 subcodes the characters included in the plurality of detailed codes.
  • the virtual code verification means 20 can separate individual detail codes from the virtual code using the same detail code combining function.
  • any one of a plurality of listing rules for arranging M characters in ascending order may be applied to the virtual code generation function. That is, the virtual code generation function may be subject to various ordering rules for arranging M characters in ascending order, and the virtual code generation function may be classified into different virtual code generation functions according to the applicable ordering rules.
  • the virtual code verifying means 20 receives the virtual code generated by the virtual code generating means 10 in various ways. That is, various virtual code providing methods of the above-described virtual code generating apparatus 100 may be used.
  • the virtual code verification means 20 extracts a plurality of detailed codes included in the virtual code (S400).
  • the virtual code verifying means 20 includes the virtual code generating function included in the virtual code generating means 10, the plurality of detailed codes are identically used by using the same rule that combines a plurality of detailed codes (that is, a detailed code combining function). Extract the detail code. That is, the detail code combining function corresponds to a rule for arranging a plurality of detail codes and is included in the virtual code generation function.
  • the virtual code verification means 20 may extract a plurality of detailed codes from the virtual code by using the same detailed code combining function as the virtual code generation means 10 of the specific group. For example, when the virtual code generating means 10 generates a virtual code in which two detailed codes (that is, a first code and a second code) are combined using the detail code combining function, the virtual code verification means 20 ) Can separate the first code and the second code from the character array of the virtual code using the detail code combining function.
  • the virtual code verification means 20 when the virtual code verification means 20 includes a plurality of storage location search algorithms, since each virtual code is a combination of detailed codes according to different rules (that is, each virtual code is a different detailed code). Since the plurality of detailed codes are combined by the combining function), the virtual code verification means 20 stores the detailed code combining function corresponding to the fixed code or the corresponding storage location search algorithm. For example, the virtual code verification apparatus 200 selects a storage location search algorithm (for example, a specific cross section in a three-dimensional diagram utilized for the storage location search algorithm) based on the fixed code in the virtual code, and then attaches the fixed code to the fixed code. A plurality of detail codes are extracted from the virtual code except the fixed code using the matched and stored detail code combining function.
  • a storage location search algorithm for example, a specific cross section in a three-dimensional diagram utilized for the storage location search algorithm
  • the virtual code verification means 20 searches the storage location of the actual code by applying the storage location search algorithm to 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 for the actual code storage location based on the correlation between the detailed codes.
  • a code generated for each unit count is changed (for example, when the virtual code consists of two detailed codes, the first code and the second code are unit The first code and the second code are changed to match the actual code storage location so that the virtual code verification means 20 can search the actual code storage location even if the virtual code is changed per unit count. Adjust per unit count to the position corresponding to the code.
  • the virtual code verification means 20 searches for the first code (i.e. And a second code is used as a path to move from the search start point to the storage location. That is, when the virtual code generated normally for each unit count is received, the virtual code verification means 20 moves the search point moved from the start point corresponding to the first code according to the search path corresponding to the second code, the actual code. It is determined as a storage location or a location matched with the storage location (for example, a storage space matched with a search point on a separate server).
  • 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, the actual code storage location or the point matching the storage location can be found.
  • the virtual code verification means 20 may include a storage location search algorithm that adjusts the storage location of the actual code according to the virtual code per unit count. That is, the virtual code verification means 20 includes a storage location search algorithm for adjusting the search path to the point matched to 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 according to the changed first code and the second code.
  • the storage location search algorithm may be implemented in various forms.
  • 6A and 6B are exemplary diagrams for explaining generation of a different storage location search algorithm for each group according to an embodiment of the present invention.
  • FIG. 7 is an exemplary diagram for explaining that a plurality of storage location search algorithms are driven at different points on a track according to an embodiment of the present invention.
  • one solid figure is cut into a plurality of parallel planes to generate k-shaped cross sections of different sizes, and the storage location search algorithm for different groups in each cross section. Matches.
  • one sphere is cut into a plurality of planes passing through the center of the sphere, creating cross sections of the same size but different slopes, and each cross section for a different group.
  • the storage location search algorithm is applied.
  • the virtual code verifying means 20 uses a three-dimensional diagram including a plurality of cross sections used for a plurality of storage location search algorithms. It is necessary to know when the corresponding storage location search algorithm starts to operate. That is, each storage location search algorithm in the virtual code verification apparatus 200 may start to be used from a different point of time, and thus a reference point of a path for searching a storage location using a plurality of detailed codes (for example, search start). The reference point reflecting the first code value may be different to determine the point. Therefore, in order to use an individual storage location search algorithm matched to each cross section in one stereoscopic figure, an initial time point at which the storage location search algorithm of each cross section is driven must be known.
  • a plurality of storage location search algorithms having different driving points on the track are driven. That is, the first storage position search algorithm matching the single cross section generated by cutting the three-dimensional figure moving on the track is generated, and the driving start time point S1 is stored in the first storage location search algorithm, and the cloud on the track is stored. The second storage position search algorithm matching with another cross section generated by cutting the moving solid figure is generated, and the driving start time point S2 is stored in the second storage position search algorithm.
  • the track is a list of different M N codes (where M and N are natural numbers).
  • the start time of driving is indicated by the identification number of each section in the count (or time point) at which the storage location search algorithm of each section on the track starts to be driven, or a k-square used for the storage location search algorithm.
  • the identification mark can be identified by providing an identification mark at a vertex corresponding to the driving start point of the cross section.
  • the first storage position search algorithm and the second storage position search algorithm are driven at different times on a track having M N counts.
  • the driving time point [S1] of the first storage position search algorithm corresponds to the point of time that three counts have elapsed on the track
  • the driving time point [S2] of the second storage position search algorithm corresponds to the time point of six counts on the track. Therefore, the code corresponding to 'M N- 3 count' is stored in the first storage location search algorithm as the driving start time point S1, and the code corresponding to 'M N- 6 count' is stored in the second storage location search algorithm. It is stored as the driving start time point S2.
  • the virtual track that cross-section corresponding to each storage location search algorithm is cloud-moving is generated and the virtual code verification means 20 searches for a real code using a specific storage location search algorithm, the corresponding storage location search algorithm
  • the cloud moving virtual track can be used to navigate to the actual code storage location.
  • FIG. 8 is an exemplary diagram of a storage location search algorithm for searching a real code storage location by moving a cloud of a k-square according to an embodiment of the present invention.
  • 9 is a flowchart of a virtual code providing method including a process of searching for an actual code according to k-shaped cloud movement according to an embodiment of the present invention.
  • 10 is a flowchart of a virtual code providing method further comprising the step of issuing an actual code and storing the same in a storage location according to an embodiment of the present invention.
  • 11 is a flowchart of a virtual code providing method further comprising a virtual code verification process according to an embodiment of the present invention.
  • 12 is a flowchart of a virtual code providing method further comprising a process of determining whether an abnormal code of a virtual code is in accordance with an embodiment of the present invention.
  • the actual code search unit 240 of the virtual code verification apparatus 200 grasps the starting point of a specific virtual card number driving, and then uses a selected cross section (that is, a k-square or a circle corresponding to the fixed code) in the three-dimensional figure on the track. The location where the actual code is stored is searched according to a plurality of detailed codes. For example, when any one of the parallel cross sections is selected and used as shown in FIG. 6A, and the plurality of detailed codes include the first code and the second code, the actual code search unit 240 contacts the selected cross section.
  • a track is generated, a search code is determined by applying a first code (for example, a cross section moves by a count corresponding to the first code) to the identified driving start point, and a cross section is applied by applying a second code. Find the actual code storage location (ie, k-square or circle).
  • the actual code when a plurality of cross-sections passing through the center of the three-dimensional figure and a straight line parallel to the direction in which the three-dimensional figure moves on the track is used for the storage location search algorithm, the actual code
  • the searcher 240 generates a virtual track in contact with the selected cross section, applies a first code to the identified driving start point (for example, the cross section moves by a count corresponding to the first code), and then starts the search point. Then, the second code is applied to search the actual code storage location on the cross section (that is, the k-square or the circle).
  • the storage location search algorithm may be cloud moving while a vertex corresponds to a point where each code is disposed on a track in which k (k is M N ) codes are listed.
  • the storage location search algorithm is a vertex at the point where each code is placed on a virtual track where k (k is M N- (number of elapsed counts when the storage location search algorithm starts running)). This may correspond to cloud movement.
  • the actual code search step (S1000), the virtual code verification means 20 cloud the k-square to the point on the track corresponding to the first code in the virtual code received from the virtual code generation means 10 Moving (S1010); Set a position corresponding to the first code as a starting point, and search for a storage position or a matching position of the storage position in a k-square arrangement based on a second code according to a search method applied to the second code.
  • the virtual code verification means 20 moves the k-square 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 k-shaped (k is M N ), which is clouded along the track of M N codes corresponding to the first code, 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.
  • the virtual code verification means 20 may apply a cloud movement to the k-square so that the vertex of the k-square in contact with the point corresponding to the first code.
  • the virtual code verification means 20 sets a position corresponding to the first code as a starting point, and arranges the k-square on the basis of the second code according to a search method applied to the second code.
  • the storage location search step is performed. The storage location is matched to each vertex of the k-square. The point where the first code track (that is, the first track) and the k-square 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.
  • the first code may be generated based on a unit count that has elapsed from the time when the storage location search algorithm for the group to which the virtual code generation means belongs, and the second code is the virtual code generation.
  • the actual code for the means may be generated based on the unit count that has elapsed from the time of newly generating the actual code.
  • the virtual code verification means 20 is a specific angle obtained by dividing 180 degrees into M N so as to face an angle corresponding to the second code (for example, to the vertex of the k-square in a position on the first track where the k-square is in contact). ), It is possible to search for the vertex of the k-square that is a storage location where the actual code corresponding to the virtual code is stored.
  • the virtual code verification means 20 is based on the center of the k-square and the contact point on the first track. , 360 degrees) is divided into M N pieces, and each angle is matched with M N second codes. At this time, the direction of the line that moves a certain number of unit angles (that is, 360 degrees / M N ) from the line connecting the center of the k-square and the contact point on the first track is a specific vertex of the k-square. Therefore, 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.
  • a specific place of the second code may be used to determine the angle calculation direction. That is, when the second code is generated through N characters (N is a natural number), the angle measurement direction may be determined by one digit.
  • the virtual code verifying means 20 divides the entire center angle (ie, 360 degrees) based on the center of the k-square and the contact point on the first track to match the second code with each angle, k. The angle measured in the left direction or the right direction from the line connecting the center of the rectangle and the contact point on the first track may be determined as a value of one digit.
  • the storage location search algorithm may assign two second codes different according to the angle measurement direction to each vertex on the k-square. That is, the second second code is matched when one vertex reaches the inner cabinet and reaches the outer corner, and different actual codes may be connected.
  • the storage location search algorithm is 360 degrees when dividing the total angle (for example, based on the center angle) into N-1 when the second code is generated using N characters (N is a natural number). We can match about half of) and use one digit to determine the angle application direction to reach each vertex.
  • the method of searching for a storage location in the k-square based on the second code is not limited thereto. Various methods may be applied, such as a method of searching for a storage location by dividing the point on the k-square corresponding to the second code and the contact point on the first track by a specific ratio.
  • 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-square, and extracts the actual code in the storage location.
  • the storage location corresponding to a specific vertex of a k-square at the specific count is requested.
  • the step of storing the actual code may be further included (S100; actual code storage step). The particular vertex is in contact with the track at the particular count.
  • the newly generated actual code is stored in a storage location matched to the vertex of the k-square contacted on the first track.
  • the k-squares are cloud-moved so that the k-squares and the track contact positions move by one code for each count.
  • the virtual code verifying means issues the actual code for the virtual code generating means A at the time A, and thus the actual code of the virtual code generating means A at the vertex of the k-square that is in contact with the track at the time A. Save the code. Then, as the count elapses, the k-square performs cloud movement along the track. Rotation of the k-squares causes the storage location in which the actual code of the virtual code generating means A is stored to rotate.
  • the virtual code verification means 20 actually generates the virtual code at the time when the virtual code is generated through the second code.
  • the point on the k-squares where the code is stored can be calculated.
  • the first code is a code value corresponding to the number of counts elapsed from the first time when the specific storage location search algorithm is driven in the virtual code verification means 20, and the second code is assigned to the specific virtual code generation means 10. If the code value corresponds to the number of elapsed counts after the actual code is issued, the virtual code verification means 20 requests the virtual code generation from the virtual code generation means 10 through the first code (for example, , C point) and the vertex on the k-square in which the actual code is stored in the k-square arrangement state at that time through the second code.
  • the first code for example, , C point
  • the first code is used to determine a point on the track that results in a k-square arrangement where the particular vertex of the k-angle can be searched, and the second code is placed on the track on the track corresponding to the first code. Then used to find the vertices on the k-squares that match the actual code storage location.
  • the virtual code is generated by the virtual code generating means 10 and provided to the virtual code verifying means 20. Even if there is a delay time, the virtual code verifying means 20 corresponds to the virtual code. You can search the actual code exactly.
  • the virtual code verification means 20 uses the inverse function of the first function or the second function to generate the virtual code in which the first code or the second code is normally generated. Verifying whether the code corresponds (S500); may be further included.
  • the first code is a code value corresponding to the number of counts elapsed from the first time when a specific storage location search algorithm is driven in the virtual code verifying means 20, and the second code is the specific virtual code generating means 10.
  • the virtual code verification means 20 elapses until the actual code issuing after driving the storage location search algorithm when storing the actual code in the storage location. Save Ts together.
  • the virtual code verifying means 20 calculates an elapsed time T1 from the time of driving the virtual code generation function to the time of generating the virtual code by applying the inverse function of the first function to the first code in the virtual code, 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 until the virtual code is generated. Thereafter, the virtual code verification means 20 verifies whether the difference between T1 and T2 corresponds to Ts and verifies the virtual code.
  • a first received code received from the virtual code generation means 10 and a first function generated according to the first function generated by the virtual code verification means 20 Comparing the generation code (S600); Setting the first reception code as a first code for the start point when the first reception code is within an error tolerance range from the first generation code (S700); And determining that the first receiving code is an abnormal code when the first receiving code is out of an error tolerance range from the first generating code (S800).
  • the same unit count passes as time passes. However, there may be an error between the timer included in the virtual code generation means 10 and the virtual code verification means 20, so that the number of counts elapsed at the same time may be different.
  • the virtual code verifying means 20 has a first code which is a first code generated at a specific count by a first function therein and a first code which is a first code in the virtual code received from the virtual code generating means 10. Comparing the first receiving code (S600), if the number of counts that differs between the first generating code and the first receiving code is within an error tolerance range, it is determined as a normal code and the actual code search process is performed based on the first receiving code. If the number of counts that differs between the first generation code and the first reception code exceeds an error tolerance, it is determined as an abnormal code (S800).
  • the virtual code verifying means is generated in the received security code received from the virtual code generating means and the virtual code verifying means. Verifying the virtual code by determining whether the generated security code matches; may be further included.
  • the virtual code providing method according to an embodiment of the present invention described above may be implemented as a program (or an application) and stored in a medium to be executed in combination with a computer which is hardware.
  • the above-described program may include C, C ++, JAVA, machine language, etc. which can be read by the computer's processor (CPU) through the computer's device interface in order for the computer to read the program and execute the methods implemented as the program.
  • Code may be coded in the computer language of. Such code may include functional code associated with a function or the like that defines the necessary functions for executing the methods, and includes control procedure related control code necessary for the processor of the computer to execute the predetermined procedure. can do.
  • the code may further include memory reference code for additional information or media required for the computer's processor to execute the functions at which location (address address) of the computer's internal or external memory should be referenced. have.
  • the code may be used to communicate with any other computer or server remotely using the communication module of the computer. It may further include a communication related code for whether to communicate, what information or media should be transmitted and received during communication.
  • the stored medium refers to a medium that stores data semi-permanently and can be read by a device, not a medium that stores data for a short time such as a register, a cache, a memory, and the like.
  • examples of the storage medium include, but are not limited to, a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
  • the program may be stored in various recording media on various servers to which the computer can access or various recording media on the computer of the user.
  • the medium may also be distributed over network coupled computer systems so that the computer readable code is stored in a distributed fashion.
  • virtual code is newly generated for each unit count, and since duplicate virtual codes do not appear within a predetermined period, the actual code may not be leaked even when the virtual code is leaked.
  • the process using the actual code remains intact.
  • 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 company server is assigned to the virtual card number.
  • the payment can be made by searching for the corresponding actual card number.
  • the virtual code generation function may be implemented in various ways, and thus, different virtual code generation functions may be applied for each group and application field.
  • the computing device TN100 of FIG. 13 may be a device described herein (eg, a virtual code generation device 100, a virtual code verification device 200, a device for a virtual code providing system, etc.).
  • the computing device TN100 may include at least one processor TN110, a transceiver device TN120, and a memory TN130.
  • the computing device TN100 may further include a storage device TN140, an input interface device TN150, an output interface device TN160, and the like.
  • Components included in the computing device TN100 may be connected by a bus TN170 to communicate with each other.
  • the processor TN110 may execute a program command stored in at least one of the memory TN130 and the storage device TN140.
  • the processor TN110 may refer to a central processing unit (CPU), a graphics processing unit (GPU), or a dedicated processor on which methods according to an embodiment of the present invention are performed.
  • the processor TN110 may be configured to implement the procedures, functions, methods, and the like described with respect to embodiments of the present invention.
  • the processor TN110 may control each component of the computing device TN100.
  • Each of the memory TN130 and the storage device TN140 may store various information related to an operation of the processor TN110.
  • Each of the memory TN130 and the storage device TN140 may be configured of at least one of a volatile storage medium and a nonvolatile storage medium.
  • the memory TN130 may be configured as at least one of a read only memory (ROM) and a random access memory (RAM).
  • the transceiver TN120 may transmit or receive a wired signal or a wireless signal.
  • the transceiver TN120 may be connected to a network to perform communication.
  • the embodiment of the present invention is not implemented only through the apparatus and / or method described so far, but may be implemented through a program that realizes a function corresponding to the configuration of the embodiment of the present invention or a recording medium on which the program is recorded.
  • Such implementations can be readily implemented by those skilled in the art from the description of the above-described embodiments.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Processing Or Creating Images (AREA)

Abstract

L'invention concerne un procédé et un système de vérification de code virtuel basé sur quelque chose de concret. Un procédé de vérification de code virtuel basé sur quelque chose de concret comprend : une étape de réception de code virtuel consistant à recevoir un code virtuel d'un moyen de génération de code virtuel par un moyen de vérification de code virtuel, le code virtuel comprenant un code fixe et de multiples codes détaillés ; une étape de sélection d'algorithme de recherche de position de stockage consistant à déterminer un groupe auquel appartient le moyen de génération de code virtuel, à travers le code fixe et à sélectionner un algorithme de recherche de position de stockage pour le groupe, par le moyen de vérification de code virtuel ; une étape d'extraction de code détaillé consistant à extraire les multiples codes détaillés inclus dans le code virtuel par le moyen de vérification de code virtuel ; et une étape de recherche de code réel consistant à appliquer l'algorithme de recherche de position de stockage aux multiples codes détaillés extraits de façon à rechercher la position de stockage d'un code réel, par le moyen de vérification de code virtuel.
PCT/KR2019/004719 2018-08-09 2019-04-18 Procédé, appareil et système de vérification de code virtuel basé sur quelque chose de concret WO2020032344A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19847407.4A EP3836061B1 (fr) 2018-08-09 2019-04-18 Procédé et système pour la vérification d'un code virtuel basé sur une sphère
US17/170,698 US11995650B2 (en) 2018-08-09 2021-02-08 Method, device and system for verifying virtual code based on sphere

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR10-2018-0093349 2018-08-09
KR20180093349 2018-08-09
KR1020190015769A KR102143425B1 (ko) 2018-08-09 2019-02-11 구체 기반의 가상코드 검증 방법 및 시스템
KR10-2019-0015769 2019-02-11

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/170,698 Continuation US11995650B2 (en) 2018-08-09 2021-02-08 Method, device and system for verifying virtual code based on sphere

Publications (1)

Publication Number Publication Date
WO2020032344A1 true WO2020032344A1 (fr) 2020-02-13

Family

ID=69414221

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2019/004719 WO2020032344A1 (fr) 2018-08-09 2019-04-18 Procédé, appareil et système de vérification de code virtuel basé sur quelque chose de concret

Country Status (1)

Country Link
WO (1) WO2020032344A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113966591A (zh) * 2020-02-24 2022-01-21 森斯通株式会社 利用虚拟代码的使用者设定信息认证方法、程序以及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150072955A (ko) * 2013-12-20 2015-06-30 주식회사 씽크풀 카드를 이용한 결제방법, 이를 위한 디지털 시스템, 및 결제측 시스템
KR101587414B1 (ko) * 2015-04-02 2016-01-21 주식회사 다날 일회용 신용카드 번호 기반의 결제 보조 장치 및 방법
KR20160036471A (ko) * 2014-08-27 2016-04-04 유한회사 실릭스 오티피 기반의 가상 번호 결제 방법, 컴퓨터 판독가능한 기록매체 및 시스템
KR20160119296A (ko) * 2015-04-02 2016-10-13 현대오토에버 주식회사 일회용 카드번호를 이용하여 결제서비스를 제공하는 방법 및 결제시스템
KR101751894B1 (ko) * 2015-12-29 2017-07-03 한국정보통신주식회사 결제 단말 장치 및 일회용 카드 코드를 이용한 결제 처리 방법

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150072955A (ko) * 2013-12-20 2015-06-30 주식회사 씽크풀 카드를 이용한 결제방법, 이를 위한 디지털 시스템, 및 결제측 시스템
KR20160036471A (ko) * 2014-08-27 2016-04-04 유한회사 실릭스 오티피 기반의 가상 번호 결제 방법, 컴퓨터 판독가능한 기록매체 및 시스템
KR101587414B1 (ko) * 2015-04-02 2016-01-21 주식회사 다날 일회용 신용카드 번호 기반의 결제 보조 장치 및 방법
KR20160119296A (ko) * 2015-04-02 2016-10-13 현대오토에버 주식회사 일회용 카드번호를 이용하여 결제서비스를 제공하는 방법 및 결제시스템
KR101751894B1 (ko) * 2015-12-29 2017-07-03 한국정보통신주식회사 결제 단말 장치 및 일회용 카드 코드를 이용한 결제 처리 방법

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113966591A (zh) * 2020-02-24 2022-01-21 森斯通株式会社 利用虚拟代码的使用者设定信息认证方法、程序以及装置
CN113966591B (zh) * 2020-02-24 2023-09-19 森斯通株式会社 利用虚拟代码的使用者设定信息认证方法、记录介质以及装置

Similar Documents

Publication Publication Date Title
WO2020032321A1 (fr) Système de fourniture de transaction financière reposant sur un code virtuel, dispositif de génération de code virtuel, dispositif de vérification de code virtuel, procédé de fourniture de transaction financière reposant sur un code virtuel et programme de fourniture de transaction financière reposant sur un code virtuel
WO2020032482A1 (fr) Procédé et système de fourniture de transaction financière au moyen d'une carte vide
WO2019031644A1 (fr) Système de fourniture de transaction financière basé sur un numéro de carte virtuelle, dispositif de génération de numéro de carte virtuelle et dispositif de vérification de numéro de carte virtuelle, procédé de fourniture de transaction financière basé sur un numéro de carte virtuelle et programme de fourniture de transaction financière basé sur un numéro de carte virtuelle
WO2019031627A1 (fr) Système de fourniture de code virtuel, dispositif de génération de code virtuel, dispositif de vérification de code virtuel, procédé de fourniture de code virtuel et programme de fourniture de code virtuel
WO2017003051A1 (fr) Dispositif électronique et procédé de génération de code aléatoire et unique
WO2016018083A1 (fr) Dispositif vestimentaire et son procédé de fonctionnement
WO2020032498A1 (fr) Procédé et système d'authentification d'utilisateur faisant appel à un code d'authentification virtuel
WO2016129838A1 (fr) Dispositif électronique et son procédé de traitement d'informations sécurisées
EP3403371A1 (fr) Dispositif électronique d'authentification basée sur des données biométriques et procédé associé
WO2018190650A1 (fr) Dispositif électronique et procédé par lequel un dispositif électronique transmet et reçoit des informations d'authentification
WO2017039036A1 (fr) Dispositif terminal et procédé d'exécution d'authentification d'utilisateur au moyen de données biométriques
WO2020032344A1 (fr) Procédé, appareil et système de vérification de code virtuel basé sur quelque chose de concret
WO2017183830A1 (fr) Procédé et appareil de renforcement de la sécurité pour la reconnaissance d'iris, par enregistrement et appariement répartis de modèles d'iris
WO2019031716A2 (fr) Système de fourniture de règlement basé sur un jeton virtuel, appareil de génération de jeton virtuel, serveur de vérification de jeton virtuel, procédé de fourniture de règlement basé sur un jeton virtuel, et programme de fourniture de règlement basé sur un jeton virtuel
WO2019139421A1 (fr) Dispositif de terminal d'utilisateur, dispositif électronique, système le comprenant et son procédé de commande
WO2018199576A1 (fr) Procédé et appareil permettant d'effectuer une authentification sur la base d'informations biométriques
WO2020071693A1 (fr) Dispositif électronique, serveur, et procédé d'authentification de signature utilisant ledit dispositif
WO2020032504A1 (fr) Procédé et système de vote et de comptage basés sur un code de vote virtuel
WO2021040444A1 (fr) Système de transaction basé sur un code virtuel, procédé et programme
WO2020162739A1 (fr) Procédé, programme et appareil pour identifier un dispositif à l'aide d'un code virtuel sur la base d'une valeur unique de puce
WO2021040359A1 (fr) Procédé et système de gestion de visiteurs et système mettant en œuvre un code qr
WO2021040358A2 (fr) Procédé d'authentification d'un utilisateur au moyen d'un code virtuel pour authentification et système associé
WO2023167569A1 (fr) Appareil et procédé pour fournir un service de vente de code d'identification dynamique
WO2023167525A1 (fr) Appareil de commande industrielle pour effectuer une authentification basée sur un code d'authentification dynamique, et procédé l'utilisant
WO2017071448A1 (fr) Procédé d'enregistrement de réseau mobile, dispositif associé et système

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19847407

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019847407

Country of ref document: EP

Effective date: 20210309