KR20190118414A - Method and apparatus for generating cryptographic key using biometric information - Google Patents

Abstract

According to the present invention, provided is a cryptographic key generation method using biometric information, which comprises the steps of: obtaining a biometric image of scanning a predetermined portion of a user; obtaining a recognition template representing a biometric characteristic of the user from the biometric image; dividing the recognition template into a plurality of areas, and determining an identification value corresponding to the recognition template based on information on the biometric characteristic in the divided areas; and applying the identification value to a first hash function to calculate a hash value and generating the calculated hash value as a private key of the user used for digital signatures.

Description

Method and apparatus for generating cryptographic key using biometric information {Method and apparatus for generating cryptographic key using biometric information}

A method and apparatus for generating an encryption key using biometric information are provided.

To enable commerce in non-face-to-face online, it must be possible to identify the other party's identity, sign documents, and so on. Handwritten signatures for paper documents and signatures with seals are difficult to use in the Internet environment.

Electronic signature means an electronic form of information attached or logically coupled to an electronic document to indicate that the signer has signed the electronic document. Digital signatures enable the signing of electronic documents using cryptographic authentication. The signer's private key is required to accept the signer's digital signature.

There is a need for a method of generating an encryption key using biometric information to reduce the possibility of loss, theft, or forgery of the signer's private key.

We want to improve the security of the private key of the user who is likely to be lost, stolen or forged.

We want to prevent the loss, theft, and forgery of private keys required for transactions of blockchain-based cryptocurrencies.

According to one side, the step of acquiring a biological image scanned a predetermined portion of the user; Obtaining a recognition template representing a biometric characteristic of the user from the biometric image; Dividing the recognition template into a plurality of areas, and determining an identification value corresponding to the recognition template based on biometric characteristic information in the divided areas; And generating a hash value by applying the identification value to a first hash function, and generating the calculated hash value as the private key of the user used for digital signature. Is provided.

According to another aspect, a computer-readable recording medium having a program for executing an encryption key generation method using biometric information on a computer is provided.

According to one side, a method for controlling an operation of an electronic wallet for managing cryptocurrency in an electronic device, the method comprising: executing an electronic wallet of a first user; Acquiring a biological image of scanning a predetermined portion of the first user; Obtaining a recognition template indicating biometric characteristic information of the first user from the biometric image; Calculating a hash value by applying an identification value corresponding to the recognition template to a first hash function, and generating the calculated hash value as the private key of the first user; And a node of a network of a blockchain that digitally signs the first transaction information of the cryptocurrency between the first user and the second user with the private key of the first user and distributes and manages the ledger that recorded the transaction for the cryptocurrency. A method is provided, comprising transmitting to a network.

According to the other side, the communication device; Sensor devices; A processor; User interface devices; And a memory configured to store instructions executable by the processor, wherein the processor executes the instructions to execute an electronic wallet of a first user and to display the biometric image from which a predetermined portion of the first user is scanned. Obtaining a recognition template indicating biometric characteristic information of the first user from the biometric image, applying an identification value corresponding to the recognition template to a first hash function, and calculating a hash value; Generate a calculated hash value with the private key of the first user, digitally sign the first transaction information of the cryptocurrency between the first user and the second user with the private key of the first user, and the digitally signed first The transaction information is presented as a node of a blockchain network that distributes and manages ledgers that record transactions for the cryptocurrency. An electronic device for transmitting via a communication device is provided.

According to yet another aspect, there is provided a computer-readable recording medium having recorded thereon a program for causing a computer to execute a method for controlling an operation of an electronic wallet that manages cryptocurrency in an electronic device.

By generating a private key for digital signature using biometric information of the user, the security of the private key can be enhanced.

By using the private key generated from the user's biometric information as the private key required for the transaction of the blockchain-based cryptocurrency, the security of the transaction can be enhanced.

The present disclosure can be easily understood by the following detailed description and the accompanying drawings in which reference numerals refer to structural elements.
FIG. 1 is a conceptual diagram illustrating a method of transacting a blockchain-based cryptocurrency by digitally signing transaction information with a private key generated from a user's biometric information in an electronic device.
2 is a flowchart illustrating a method of generating an encryption key using biometric information of a user by a processor in an electronic device, according to an embodiment.
3 is a diagram for describing a process of generating, by a processor, a private key of a user using fingerprint information of a user when a fingerprint of the user is scanned, according to an exemplary embodiment.
4 is a flowchart illustrating a method of generating reference templates by dividing a predetermined part by a biometric feature by a processor in an electronic device according to an embodiment.
5 is a diagram for describing a process of generating, by the processor, reference templates by using a scanned fingerprint image of each of a plurality of users, according to an embodiment.
6 is a diagram for describing a process of generating a private key of a user by applying a global identification value corresponding to a recognition template to a hash function, according to an exemplary embodiment.
7 is a diagram for describing a process of generating a private key of a user by repeatedly applying the entire identification value corresponding to a recognition template to a hash function twice, according to an exemplary embodiment.
8 is a diagram for describing a process of generating, by a processor, a private key of a user by sequentially applying identification values of a plurality of regions in a recognition template to a hash function, according to an embodiment.
9 is a diagram for describing a process of generating a private key of a user by applying an identification value of each of a plurality of regions in a recognition template to a hash function hierarchically according to an embodiment.
FIG. 10 is a flowchart illustrating an operation of an electronic device for trading a blockchain-based cryptocurrency by digitally signing transaction information with a private key generated from biometric information of a first user.
11 is a flowchart illustrating an operation of a node on a network of a blockchain for distributing and managing ledgers recording transactions for cryptocurrencies, according to an embodiment.
FIG. 12 is a diagram for describing a process of propagating a transaction of a valid cryptocurrency on a blockchain network to nodes on a blockchain network and recording the blockchain in a blockchain according to an embodiment.
FIG. 13 is a diagram for describing a process of transmitting digitally signed transaction information to a node on a network of a blockchain in an electronic device according to an embodiment.
14 is a diagram for describing a process of validating transaction information at a node on a network of a blockchain, according to an exemplary embodiment.
15 is a block diagram illustrating a structure of a block and a blockchain according to an embodiment.
16 is a block diagram illustrating a configuration of an electronic device according to an embodiment.

Hereinafter, various embodiments will be described in detail with reference to the accompanying drawings. The embodiments described below may be embodied in various different forms. In order to more clearly describe the features of the embodiments, detailed descriptions of matters well known to those skilled in the art to which the following embodiments belong will be omitted.

On the other hand, when a certain configuration is "connected" with another configuration in the present specification, this includes not only 'directly connected', but also 'connected between the other configuration in the middle'. In addition, when one configuration "includes" another configuration, this means that, unless specifically stated otherwise, it may further include other configurations other than the other configuration.

In addition, terms including ordinal numbers such as 'first' or 'second' as used herein may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.

As used herein, "biological feature" may mean a unique feature obtained from the body of an individual user. In addition, "biometric information" may refer to information including lifetime invariant and unique biometric characteristics of each user.

In the present specification, "template" is characteristic information obtained by analyzing and extracting biological characteristics by performing algorithm processing on a biological image, and may mean unique biological characteristic information of a user.

In the present specification, “recognition template” may refer to biometric characteristic information extracted from a user at the time of authentication for user authentication.

As used herein, "reference template" may refer to a template that is referred to to determine certain biometric features of a recognition template. "Reference template" may also mean a template that represents a given biometric characteristic. "Reference value of a reference template" may mean a unique value indicating a reference template.

In this specification, "reference templates" may refer to a set of reference templates. "Reference templates" may refer to templates classified by classifying biometric feature information of a plurality of users by biometric features.

As used herein, the term "hash function" may refer to a function that converts any type of data into a fixed length number regardless of the length of the input data. The hash function may calculate a hash value using bits and bytes constituting the input data.

As used herein, the term "electronic wallet" may refer to a means of storing a value in an electronic device in an electronic manner to enable a transaction online or offline without exchanging physical currency. In addition, "e-wallet" is a kind of electronic payment system used in electronic commerce, it may mean a software that can store money value in the memory or virtual account of the electronic device and use it as a wallet while paying for e-commerce. have.

In the present specification, "cryptocurrency" may mean a digital currency designed to be possible as an exchange means using an encryption method. In addition, "Cryptocurrency" can use cryptographic methods to secure transactions, control the creation of additional units, and authorize the transfer of assets.

In the present specification, a "blockchain" refers to a distributed P2P (ledger) of a ledger (learner) that utilizes a software component composed of algorithms in which blocks connected in order negotiate transaction information using encryption and security techniques to secure and maintain integrity. Peer to Peer) system. Here, the distributed P2P system may be a special type of distributed system. In addition, a P2P system allows all nodes of a network to provide resources (processing capacity, storage space, data or network bandwidth, etc.) to each other without coordination of a central node. In addition, "blockchain" may refer to a distributed ledger technology in which the ledger recording the transaction information is distributed to the P2P network, not the central server of a specific institution, to jointly record and manage the nodes in the network.

In the present specification, "electronic device" may refer to a device that operates by receiving electrical energy. For example, the electronic device may be a smartphone, a tablet PC, a PC, a TV, a smart TV, a mobile phone, a personal digital assistant, a laptop, a non-mobile computing device, or the like, but is not limited thereto.

In the present specification, "node" may mean a component within a network of a blockchain. For example, the node may be a special-purpose computer, a general-purpose computer, a supercomputer, a mainframe computer, a personal computer, a smartphone, a tablet PC. Etc., but is not limited thereto.

1 is a conceptual diagram illustrating a method of transacting a blockchain-based cryptocurrency by digitally signing transaction information with a private key generated as biometric information of a user in an electronic device according to an embodiment.

The electronic device 10 may execute the electronic wallet of the first user who manages the cryptocurrency according to the input of the first user. The electronic device 10 may perform a transaction of a cryptocurrency based on the first transaction information used by the first user to transfer a predetermined cryptocurrency to the second user.

The electronic device 10 uses the nodes 20, 20-2, 20-3, 20-4, and 20-on the network of the blockchain to record details of the transfer of a predetermined cryptocurrency by the first user to the second user. 5) the first transaction information may be transmitted to the first node 20. In detail, the electronic device 10 may transmit a digitally signed cipher text and first transaction information to the first node 20 using the first user's private key. In addition, the electronic device 10 may transmit the public key of the first user to the first node 20. The electronic device 10-2 held by the second user may receive a message in which a predetermined cryptocurrency is deposited from the first user.

Here, the private key and the public key of the first user may be generated based on the biometric information of the first user. The processor 15 in the electronic device 10 may obtain biometric information of the first user. The processor 15 may apply the identification value representing the biometric information of the first user to the hash function to generate the calculated hash value as the private key of the first user. In addition, the processor 15 may apply the private key of the first user to the hash function to generate the calculated hash value as the public key of the first user. A method of generating a private key using biometric information of a user will be described in detail with reference to FIGS. 2 to 9.

Meanwhile, the first node 20 may verify the validity of the first transaction information by using the public key of the first user. If the first transaction information is valid, the first node 20 may add the first transaction information to the candidate block. The first node 20 may add a candidate block to the blockchain as a valid block by performing proof of work on the candidate block.

2 is a flowchart illustrating a method of generating an encryption key using biometric information of a user by a processor in an electronic device, according to an embodiment.

In operation S210, the processor 15 may acquire a biometric image in which a predetermined portion of the user is scanned. Here, the predetermined part may be a part of the user's body part, and may be a part from which the user's unique biometric characteristic may be extracted. For example, the predetermined part may be a user's hand, eye, blood vessel, face, and the like, but is not limited thereto. In addition, the biometric image in which the predetermined region is scanned may be a fingerprint image, an iris image, a vein image, or a face image.

The processor 15 may acquire a biometric image of a user from a sensor device provided in the electronic device 10. In addition, the processor 15 may obtain a biological image of the user from an external sensor device.

In operation S220, the processor 15 may obtain a recognition template representing the biometric characteristic of the user from the biometric image. The processor 15 may acquire the recognition template including the biometric characteristic information of the user by processing the biometric image according to a predetermined algorithm.

In operation S230, the processor 15 may divide the recognition template into a plurality of areas, and determine an identification value corresponding to the recognition template based on the biometric characteristic information in the divided areas. Here, the identification value is a value for distinguishing the recognition template and may be expressed by at least one of numbers, letters, and symbols. Therefore, if the recognition templates are different, the identification values are also different.

The processor 15 may determine a reference template that matches each of the divided regions based on the biometric characteristic information in the divided regions. The processor 15 may assign a reference value of the reference template as an identification value to each of the divided regions.

In detail, the processor 15 may detect at least one feature point and at least one feature line used to recognize a biometric feature of a predetermined region in the divided regions. Since at least one feature point and at least one feature line in the predetermined region are different for each user, the information obtained from the at least one feature point and the at least one feature line may represent unique information. The processor 15 may acquire the biometric characteristic information of the predetermined region based on at least one of the position, the number, the distribution of the at least one feature point, the direction of the at least one feature line, and the pattern. The processor 15 may determine a reference template that matches each of the divided regions based on the biometric characteristic information in the divided regions and the information of the reference templates.

Here, the reference templates may each represent a biometric characteristic of a predetermined site. The first reference template may be a template representing the first biometric characteristic of the predetermined site, and the second reference template may be a template representing the second biological feature of the predetermined site. Also, the information of the reference templates may include information of a reference value indicating the reference template, but is not limited thereto.

In operation S240, the processor 15 may calculate the hash value by applying the identification value to the first hash function. The processor 15 may generate the calculated hash value as a user's private key used for digital signature. The processor 15 may increase the security of the private key by generating a private key for digital signature using the biometric information of the user.

For example, the processor 15 may list the identification values assigned to each of the divided regions on a predetermined basis to obtain the entire identification value. The processor 15 may calculate the first hash value by applying the entire identification value to the first hash function. The processor 15 may generate the calculated first hash value as a private key of the user. In FIG. 6, the process of generating the private key of the user by applying the entire identification value corresponding to the recognition template to the hash function will be described in detail.

For another example, the processor 15 may calculate the first hash value by applying the entire identification value obtained by combining the identification values assigned to each of the divided regions to the first hash function. The processor 15 may calculate the second hash value by applying the calculated first hash value to the first hash function. The processor 15 may generate the second hash value as the private key of the user. In FIG. 7, a process of generating a private key of a user by repeatedly applying the entire identification value corresponding to the recognition template to the hash function twice in FIG. 7 is described in detail.

In another example, the processor 15 may calculate a first hash value by applying a first reference value allocated to a first region among a plurality of regions (N, N is 2 or more) to a first hash function. have. The processor 15 may calculate the second hash value by applying the first hash value and the second reference value allocated to the second area among the plurality of areas to the first hash function. Similarly, the processor 15 applies the n-th reference value and the n-th reference value allocated to the n-th area of the plurality of areas to the first hash function to calculate the n-th hash value, where n = 3 The Nth hash value may be finally calculated by repeating n = N sequentially by increasing the values by 1 sequentially. The processor 15 may generate the N-th hash value as the private key of the user. In FIG. 8, a process of generating a private key of a user by sequentially applying identification values of each of the plurality of regions in the recognition template to a hash function will be described in detail with reference to FIG. 8.

In another example, the processor 15 may apply the nth reference value assigned to the nth region among the plurality of N regions, where N is two or more, to the first hash function to apply the nth hash value of the first layer. The process of calculating n may be repeatedly performed from n = 1 to n = N sequentially. The processor 15 may calculate hash values of the N first layers. Here, the hash value of the first layer is a value calculated by applying the first hash function once.

The processor 15 may combine two hash values of the first layer and apply the two hash values to the first hash function. As a result, the processor 15 may calculate hash values of the second layer. Here, when a hash value of one first layer is left as a result of grouping hash values of the first layer by two, the hash value of the remaining first layer is combined with the hash value of the second layer, and the first hash function is added to the first hash function. By being applied, the processor 15 may be calculated as a hash value of the third layer.

Similarly, the processor 15 combines two hash values of the n-1 layer by two to apply the first hash function to calculate the hash value of the n layer. If N is even, the highest layer is an N / 2 layer, and if N is odd, the highest layer may be repeated until the number of hash values of (N + 1) / 2 layers) is one. When the number of hash values of the highest layer is one, the processor 15 may generate the hash value of the highest layer as the private key of the user. In FIG. 9, a process of generating a private key of a user by applying an identification value of each of a plurality of regions in a recognition template hierarchically to a hash function will be described in detail with reference to FIG. 9.

The processor 15 may generate the hash value calculated by applying the user's private key to the first hash function, as the user's public key. The processor 15 may transmit the public key of the user to a node on the network of the blockchain that distributes and manages the ledger recording the transaction for the cryptocurrency.

By using the private key generated from the user's biometric information as the private key required for the transaction of the blockchain-based cryptocurrency, the security of the transaction can be enhanced.

3 is a diagram for describing a process of generating, by a processor, a private key of a user using fingerprint information of a user when a fingerprint of the user is scanned, according to an exemplary embodiment.

Referring to 310 of FIG. 3, the processor 15 may acquire a fingerprint image from which a user's fingerprint is scanned. The sensor device may acquire a fingerprint image and scan the fingerprint of the user and transmit the fingerprint image to the processor 15. The processor 15 may generate a fingerprint recognition template by processing the fingerprint image according to a predetermined algorithm. Here, the predetermined algorithm may be an algorithm for smoothing, binarization, and thinning an image, but is not limited thereto.

Referring to 320 of FIG. 3, the processor 15 may divide the fingerprint recognition template into a plurality of regions. As illustrated at 320 in FIG. 3, the processor 15 may evenly divide the fingerprint recognition template into nine regions 321, 322, 323, 324, 325, 326, 327, 328, and 329.

Referring to 330 of FIG. 3, the processor 15 is divided based on the biometric characteristic information of the divided regions 321, 322, 323, 324, 325, 326, 327, 328, and 329 in the fingerprint recognition template. A reference template matching each of the regions 321, 322, 323, 324, 325, 326, 327, 328, 329 may be determined.

The feature information of the fingerprint may be determined based on the feature point of the fingerprint and the feature line of the fingerprint, but is not limited thereto. The feature point of the fingerprint may be determined based on at least one of a ridge, a valley, an endpoint, a branch point, a center point, a lower center point, and a delta in the fingerprint.

The processor 15 is matched to the divided region of the recognition template among the reference templates based on the fingerprint characteristic information of each of the divided regions 321, 322, 323, 324, 325, 326, 327, 328, and 329. The predetermined reference template can be determined. Here, the reference templates may be templates representing each of the fingerprint features. Details related to the reference template will be described in detail with reference to FIGS. 4 and 5.

As illustrated at 330 of FIG. 3, the processor 15 may divide the divided regions based on fingerprint feature information of each of the divided regions 321, 322, 323, 324, 325, 326, 327, 328, and 329. Reference templates 331, 332, 333, 334, 335, 336, 337, 338, and 339 that match each of the fields 321, 322, 323, 324, 325, 326, 327, 328, and 329 may be determined. For example, the processor 15 may determine the first reference template 331 matching the first area 321 based on the feature point of the fingerprint of the first area 321 and the feature line of the fingerprint.

Referring to 340 of FIG. 3, each of the reference templates 331, 332, 333, 334, 335, 336, 337, 338, and 339 may be assigned a reference value indicating the template. Here, the reference value is an intrinsic value representing the reference template. Thus, different reference templates result in different reference values. The processor 15 may, in each of the divided regions 321, 322, 323, 324, 325, 326, 327, 328, 329 in the fingerprint recognition template, reference templates 331, 332, 333, 334, 335, 336, 337, 338, and 339 may be assigned as identification values. For example, the processor 15 may allocate “9”, which is a reference value of the first reference template 331, to the first area 321 as an identification value. In addition, the processor 15 may allocate a reference value of “5” as the identification value of the second reference template 332 to the second area 322.

As shown at 340 of FIG. 3, the processor 15 may identify the identification values 9, 5, 3, 3, 3, 3, 325, 327, 327, 328, 329 in the divided regions 321, 322, 323, 324, 325, 326, 327, 328, and 329 of the recognition template. 1, 7, 3, 4, 2, 8, 6) can be assigned.

Referring to 350 of FIG. 3, the processor 15 may list the identification values assigned to each of the divided regions with a predetermined criterion to obtain the entire identification value 951734286. In addition, the processor 15 may list the identification values assigned to each of the regions in any order to obtain the entire identification value.

4 is a flowchart illustrating a method of generating reference templates by dividing a predetermined part by a biometric feature by a processor in an electronic device according to an embodiment.

In operation S410, the processor 15 may acquire a plurality of templates by processing a plurality of biological images including a predetermined portion according to a predetermined algorithm. Here, the predetermined portion may be a user's fingerprint, vein, iris retina, face, and the like, but is not limited thereto.

In operation S420, the processor 15 may classify the plurality of templates according to a criterion for classifying the biometric features of the predetermined region.

For example, when the plurality of templates are fingerprint templates, the processor 15 may select the plurality of templates based on at least one of the position, number, distribution, and direction of the ridge indicating the feature line of the fingerprint, and the pattern. Each biometric characteristic information may be obtained and classified by biometric characteristics. Here, the feature point may correspond to one of a goal, an end point, a branch point, a center point, a lower center point, and a delta, but is not limited thereto.

In another example, when the plurality of templates are vein templates, the processor 15 may obtain information about the vein distribution or the vein pattern based on the position and the direction of the blood vessel representing the vein. The processor 15 may classify the plurality of templates according to the vein distribution or the vein pattern.

For another example, when the plurality of templates are iris templates, the processor 15 may obtain contrast pattern information based on the contrast information of the iris. The processor 15 may classify the plurality of templates according to the light and dark patterns of the iris.

In operation S430, the processor 15 may generate a representative template for each classified group to obtain reference templates.

For example, the processor 15 may generate a representative template representing the group by calculating an average value between the templates in the classified group. As another example, the processor 15 may generate a representative template representing a group by detecting a value in which a distribution of values constituting the template is concentrated in the classified group.

The processor 15 may obtain the representative templates generated for each group as reference templates.

5 is a diagram for describing a process of generating, by the processor, reference templates by using a scanned fingerprint image of each of a plurality of users, according to an embodiment.

Referring to 510 of FIG. 5, the processor 15 may obtain fingerprint images of a plurality of users and process fingerprint images according to a predetermined algorithm to obtain fingerprint templates. Here, the predetermined algorithm may be an algorithm for smoothing, binarizing, and thinning an image, but is not limited thereto.

Referring to 520 of FIG. 5, the processor 15 may divide each of the fingerprint templates into a preset size. As shown in FIG. 5, the fingerprint template may be divided into nine regions of the same size.

Referring to 530 of FIG. 5, in the divided area of each of the fingerprint templates, the processor 15 may be configured based on at least one of a pattern, a direction of the ridges representing the location, number, distribution, and feature of the fingerprint. Characteristic information of the fingerprint can be obtained. The processor 15 may group the divided regions of each of the fingerprint templates based on the feature information of the fingerprint. For example, the processor 15 may classify the templates 531 of the area having the first characteristic information of the fingerprint into a first group. The processor 15 may generate a first reference template 541 representing the first group based on the distribution of the feature points and the feature line direction in the templates 531 of the area having the first feature information of the fingerprint. . In addition, the processor 15 may assign a reference value 551 (eg, reference value: 1) indicating the first reference template 541. Similarly, the processor 15 may classify templates of the area having the n th characteristic information of the fingerprint into an n th group. The processor 15 may generate the n th reference template representing the n th group based on the distribution of the feature points and the feature line direction in the templates of the area having the n th feature information of the fingerprint.

5 shows a process in which the processor 15 generates nine types of reference templates by classifying the characteristic information of the fingerprint into nine pieces. The processor 15 may generate a reference template that represents each of the nine types of templates based on the distribution of the feature points and the feature line direction of the templates classified into each of the nine types. In addition, the processor 15 may assign a reference value indicating the reference template to each of the nine reference templates.

The reference value shown in FIG. 5 is given for convenience of description and other numbers, letters, and symbols may be given. In addition, in FIG. 5, the fingerprint template is divided into 3 × 3, but may be divided into any number n × n. In addition, the type or number of types of reference templates may be preset by the user. In addition, when the biometric information is fingerprint information, the reference template may be obtained based on the left fingerprint information and the right fingerprint information. In addition, the processor 15 may determine the type of the reference template in detail by considering the left fingerprint information and the right fingerprint information. In this case, the number of types of reference templates may be larger than the number of types of reference templates determined by considering only one piece of fingerprint information.

6 is a diagram for describing a process of generating a private key of a user by applying a global identification value corresponding to a recognition template to a hash function, according to an exemplary embodiment.

Referring to 610 of FIG. 6, the processor 15 may assign a reference value of the reference template as an identification value to each of the divided regions of the recognition template. For example, the processor 15 may assign a reference value "9" of the first reference template matching the first region to the first region.

The processor 15 may list the assigned identification values on a predetermined basis to obtain a premise identification value. Referring to 620 of FIG. 6, the processor 15 may list identification values assigned to each of the divided regions with a predetermined criterion to obtain “951734286” which is the entire identification value of the recognition template.

Referring to 630 of FIG. 6, the processor 15 may calculate “AI39D03N6” as a hash value by applying “951734286”, which is the entire identification value, to the first hash function. The processor 15 may generate the calculated hash value "AI39D03N6" as the user's private key.

7 is a diagram for describing a process of generating a private key of a user by repeatedly applying the entire identification value corresponding to a recognition template to a hash function twice, according to an exemplary embodiment.

Referring to 710 of FIG. 7, the processor 15 may allocate a reference value of the reference template as an identification value to each of the divided regions of the recognition template. Referring to 720 of FIG. 7, the processor 15 may list identification values assigned to each of the divided regions with a predetermined criterion to obtain “951734286” which is the entire identification value of the recognition template. Referring to 730 of FIG. 7, the processor 15 may calculate “AI39D03N6” as a hash value by applying the entire identification value “951734286” to the first hash function.

Referring to 740 of FIG. 7, the processor 15 may apply “AI39D03N6”, which is the calculated hash value, to the first hash function to calculate “EROMX301Q” as a hash value. The processor 15 may generate the calculated hash value "EROMX301Q" as the user's private key.

8 is a diagram for describing a process of generating, by a processor, a private key of a user by sequentially applying identification values of each of a plurality of regions in a recognition template to a hash function, according to an embodiment.

Referring to 810 of FIG. 8, the processor 15 may allocate a reference value of the reference template as an identification value to each of the divided regions of the recognition template.

Referring to 820 of FIG. 8, the processor 15 may calculate “ADIOO8321” which is the first hash value 821 by applying the identification value “9” of the first region to the first hash function. The processor 15 may calculate “EIOQCLAI9”, which is the second hash value 822, by applying “ADIOO8321”, which is the first hash value 821 and the identification value “5” of the second area, to the first hash function. . That is, the processor 15 performs a first process of calculating an n-th hash value by applying an n-th hash value and an n-th reference value assigned to an n-th area among a plurality of areas to the first hash function. can do. The processor 15 may repeatedly perform the first process from n = 2 to n = N by sequentially increasing 1 by one. The processor 15 performs a first process to calculate "EIEROCO1M" as the third hash value 823, calculate "903CJKAOE" as the fourth hash value 824, and to the fifth hash value 825. "D3LCL1CL1" is calculated, "EOWPCLQ76" is calculated from the sixth hash value 826, "KCO9358RH" is calculated from the seventh hash value 827, and "DIFLWIOD9" is calculated from the eighth hash value 828. The "UEXBOU541" can be calculated from the ninth hash value 829.

The processor 15 may generate “UEXBOU541”, which is the ninth hash value 829 calculated last, as a user's private key.

9 is a diagram for describing a process of generating a private key of a user by applying an identification value of each of a plurality of regions in a recognition template to a hash function hierarchically according to an embodiment.

Referring to 910 of FIG. 9, the processor 15 may assign a reference value of the reference template as an identification value to each of the divided regions of the recognition template.

Referring to 920 of FIG. 9, the processor 15 may calculate the hash values 921 of the first layer by applying an identification value assigned to each of the plurality of nine regions to the first hash function. The processor 15 may combine the two hash values 921 of the first layer and apply the two hash values 921 to the first hash function to calculate the hash values 922 of the second layer. Here, the hash value "CKDI9034N" of the hash values 921 of the first layer may be used to calculate hash values of the next layer because there is no pair of hash values. The processor 15 may combine the two hash values 922 of the second layer and apply the two hash values 922 to the first hash function to calculate the hash values 923 of the third layer. The processor 15 may calculate the hash value 924 of the fourth layer by combining the hash value “CIVN5781Q” among the hash values of the third layer and the hash value “CKDI9034N” of the first layer to apply to the first hash function. have. The processor 15 combines the "ICOEK90C1" hash value 924 of the fourth layer and the hash value "UWKCI1239" among the hash values of the third layer and applies it to the first hash function to apply the hash value 925 of the fifth layer. Can be calculated. The processor 15 may generate "MXCUE45I0", which is the hash value 925 of the fifth layer, as the private key of the user.

In FIG. 9, for convenience of description, hash values are combined and applied to the first hash function in the order of the listed hash values, but hash values may be combined and applied to the first hash function in any order.

FIG. 10 is a flowchart illustrating an operation of an electronic device for trading a blockchain-based cryptocurrency by digitally signing transaction information with a private key generated from biometric information of a first user.

In operation S1010, the electronic device 10 may execute an electronic wallet of the first user.

In operation S1020, the electronic device 10 may acquire a biometric image in which a predetermined portion of the first user is scanned.

In operation S1030, the electronic device 10 may obtain a recognition template indicating biometric characteristic information of the first user from the biometric image.

In operation S1040, the electronic device 10 may calculate a hash value by applying an identification value corresponding to the recognition template to the first hash function. The electronic device 10 may generate the calculated hash value as the private key of the first user.

The electronic device 10 may determine an identification value corresponding to the recognition template. In detail, the electronic device 10 may divide the recognition template into a plurality of areas. The electronic device 10 may determine a reference template that matches each of the divided regions based on the biometric characteristic information in the divided regions. The electronic device 10 may determine the identification value corresponding to the recognition template by allocating the reference value of the reference template as the identification value to each of the divided regions.

In addition, the electronic device 10 may detect at least one feature point and at least one feature line that are used to recognize a biometric feature of a predetermined region in the divided regions. The electronic device 10 may acquire the biometric characteristic information of the predetermined region based on at least one of a position, a number, a distribution chart of the at least one feature point, and a direction and a pattern of the at least one feature line. The electronic device 10 may determine a reference template matching each of the divided regions based on the biometric characteristic information in the divided regions and the information of the reference templates.

A method of generating the private key of the first user by the electronic device 10 will now be described. For example, the electronic device 10 may list the identification values assigned to each of the divided regions according to a predetermined criterion to obtain the entire identification value. The electronic device 10 may apply the entire identification value to the first hash function to calculate the first hash value and generate the calculated first hash value as the private key of the first user.

As another example, the electronic device 10 may calculate the first hash value by applying the entire identification value obtained by combining the identification values allocated to each of the divided regions to the first hash function. The electronic device 10 may calculate the second hash value by applying the first hash value to the first hash function. The electronic device 10 may generate the second hash value as the private key of the first user.

As another example, the electronic device 10 may calculate a first hash value by applying a first reference value allocated to a first area among a plurality of areas (N, N is 2 or more) to a first hash function. Can be. The electronic device 10 may calculate the second hash value by applying the first hash value and the second reference value allocated to the second area among the plurality of areas to the first hash function. Similarly, the electronic device 10 applies a n-th reference value and an n-th reference value allocated to an n-th area among the plurality of areas to the first hash function to calculate an n-th hash value. The Nth hash value may be finally calculated by repeating n = N by sequentially increasing the value 1 by 3. The electronic device 10 may generate the Nth hash value as the private key of the first user.

As another example, the electronic device 10 may apply the nth reference value assigned to the nth area among the plurality of N areas, where N is two or more, to the first hash function to apply the nth hash of the first layer. The process of calculating the value may be repeatedly performed from n = 1 to n = N sequentially. The electronic device 10 may calculate hash values of the N first layers. Here, the hash value of the first layer is a value calculated by applying the first hash function once.

The electronic device 10 may combine two hash values of the first layer and apply the two hash values to the first hash function. As a result, the electronic device 10 may calculate hash values of the second layer. Here, when a hash value of one first layer is left as a result of grouping hash values of the first layer by two, the hash value of the remaining first layer is combined with the hash value of the second layer, and the first hash function is added to the first hash function. By being applied, the electronic device 10 may be calculated as a hash value of the third layer.

Similarly, the electronic device 10 combines two hash values of the n-1 layer by two to apply the first hash function to calculate a hash value of the n layer, and sequentially increases the number of hash values of the n layer by 1 from n = 3. (If N is even, the highest layer is N / 2 layer, and if N is odd, the highest layer is (N + 1) / 2 layer) and may be repeated until the number of hash values is one. If the number of hash values of the highest layer is one, the electronic device 10 may generate the hash value of the highest layer as the private key of the first user.

In addition, the electronic device 10 may generate a hash value calculated by applying the private key of the first user to the first hash function as the public key of the first user.

In operation S1050, the electronic device 10 digitally signs the first transaction information of the cryptocurrency between the first user and the second user with the private key of the first user, and distributes and manages the ledger recording the transaction for the cryptocurrency. It can send to nodes on the network of the chain.

In detail, the electronic device 10 may generate the hash value corresponding to the first transaction information by applying the first transaction information to the second hash function. The electronic device 10 may generate a first cipher text indicating a digital signature of the first transaction information by encrypting a hash value corresponding to the first transaction information with the private key of the first user. The electronic device 10 may transmit the first cipher text together with the first transaction information to the node.

In addition, the electronic device 10 may transmit the public key of the first user to a node on the network of the blockchain.

In addition, the electronic device 10 may obtain first transaction information of a cryptocurrency between the first user and the second user. The electronic device 10 may perform a transaction of cryptocurrency between the electronic wallet of the first user and the electronic wallet of the second user according to the first transaction information.

11 is a flowchart illustrating an operation of a node on a network of a blockchain for distributing and managing ledgers recording transactions for cryptocurrencies, according to an embodiment.

In operation S1110, the node 20 may receive the public key of the first user from the electronic device 10 of the first user.

In operation S1120, the node 20 may receive, from the electronic device 10 of the first user, first transaction information of a cryptocurrency traded between the first user and the second user. Here, the first transaction information may include information for the first user to transfer a predetermined amount of cryptocurrency to the second user. In addition, the node 20 may receive a first cipher text in which the first transaction information is digitally signed with the first user's private key.

In operation S1130, the node 20 may verify the validity of the first transaction information based on the first transaction information received from the electronic device 10 of the first user. In detail, the node 20 may generate a first hash value corresponding to the first transaction information by applying a second hash function to the first transaction information. The node 20 can then decrypt the first cipher text using the public key of the first user to generate a second hash value. The node 20 may verify the validity of the first transaction information based on the comparison result of the first hash value and the second hash value.

In operation S1140, if the first transaction information is valid, the node 20 may perform an operation according to operation S1150. On the other hand, if the first transaction information is not valid, the node 20 may discard the first transaction information.

In operation S1150, the node 20 may transmit the first transaction information to another node 20 on the network of the blockchain. In addition, the node 20 may add the first transaction information to the candidate block of the block that may be connected to the blockchain.

In operation S1160, the node 20 may perform proof of work on the candidate block and add the candidate block as a valid block to the blockchain.

FIG. 12 is a diagram for describing a process of propagating a transaction of a valid cryptocurrency on a blockchain network to nodes on a blockchain network and recording the blockchain in a blockchain according to an embodiment.

Referring to FIG. 12, the electronic device 10 may execute an electronic wallet of a first user. The electronic device 10 may transfer the cryptocurrency 3,500,000 cache to the electronic wallet of the second user based on the first transaction information indicating the information that the first user has transferred the cryptocurrency 3,500,000 cache to the second user. The electronic device 10 may encrypt the first transaction information and transmit the encrypted first transaction information to the first node 20 on the network of the blockchain. Here, the electronic device 10 may encrypt the first transaction information with the private key of the first user obtained from the biometric information of the first user. An operation in which the electronic device 10 encrypts the first transaction information and transmits the first transaction information to the first node 20 will be described in detail with reference to FIG. 13.

The first node 20 may decrypt the encrypted first transaction information with the public key of the first user, and verify 1210 whether the first transaction information is valid based on the decrypted result. Here, the public key of the first user is a value calculated by applying the private key of the first user obtained from the biometric information of the first user to the hash function. An operation of verifying the validity of the first transaction information by the first node 20 will be described in detail with reference to FIG. 14.

As a result of validating the first transaction information, if the first transaction information is not valid, the first node 20 may discard the first transaction information.

As a result of verifying validity of the first transaction information, if the first transaction information is valid, the first node 20 may transmit the first transaction information to the second node 20-2 on the network of the blockchain. In addition, the first node 20 may record, in the candidate block 1220, first transaction information 1221 indicating information in which the first user transfers a cryptocurrency 3,500,000 cache to the second user. When predetermined transaction information is recorded in the candidate block 1220, the first node 20 may generate a valid block by performing proof of work on the candidate block 1220. In addition, when the validity of the first transaction information is verified in the second node 20-2, the second node 20-2 adds the first transaction information to the candidate block 1220, and adds the candidate transaction to the candidate block 1220. Proof of work can be performed to generate a valid block. The third node 20-3 and the fourth node 20-4 may operate similarly to the second node 20-2.

Referring to the process of generating a valid block in the first node 20 and adding it to the blockchain, the first node 20 may calculate the root of the Merkle tree for predetermined transaction information. The first node 20 may generate a hash reference that points to the previous block header in view of the block to be added to the blockchain. The first node 20 may acquire a difficulty level required for proof of work or constraint of a block to be added to the blockchain. The first node 20 may check whether the value of the block hash generated by applying the hash function to the root of the Merkle tree, a hash reference indicating the previous block header, the difficulty, the data and the nonce of the timestamp satisfies the constraint. . The first node 20 may perform proof of work on the candidate block 1220 by acquiring a nonce value that satisfies the constraint while increasing the nonce by 0 to 1. The first node 20 may add the candidate block 1220 as a valid block to the blockchain. In addition, the first node 20 may transmit a valid block to other nodes 20-2, 20-3, 20-4, etc. on the network of the blockchain.

Each node (20-2, 20-3, 20-4, etc.) on the network of the blockchain performs verification on a valid block received by the first node 20, so that each node 20-2, 20 -3, 20-4, etc.) can add a valid block to the blockchain.

FIG. 13 is a diagram for describing a process of transmitting digitally signed transaction information to a node on a network of a blockchain in an electronic device according to an embodiment.

The electronic device 10 encrypts the transaction information 1310 "the first user transfers the 3,500,000 cache of the first cryptocurrency to the second user" with the private key of the first user, and encrypts the encrypted transaction information 1340 with the blockchain. May be transmitted to the first node 20 on the network.

Specifically, the electronic device 10 applies the transaction information 1310 “the first user transfers the 3,500,000 cache of the first cryptocurrency to the second user” to a hash function that generates unique data about the transaction information. The hash value “8F23V230” 1320 corresponding to the transaction information 1310 may be generated.

The electronic device 10 encrypts the hash value " 8F23V230 " 1320 with the private key 1325 of the first user to indicate the first cipher text "%!## (YSEDK $ # 9) representing the digital signature of the transaction information 1310. $ KPXL &% "1330. Here, the private key 1325 of the first user may be obtained from biometric information of the first user. The biometric information may include fingerprint information, iris information, and vein information. And electronic device 10, but is not limited thereto. The electronic device 10 may include transaction information 1340 in which the first cipher text “%! ## (YSEDK $ # 9 $ KPXL &%”) 1330 is combined with transaction information 1310. ) May be transmitted to the first node 20.

In addition, the electronic device 10 may generate the public key of the first user by applying the first user's private key 1325 obtained from the biometric information of the first user to the hash function. The electronic device 10 may transmit the public key of the first user to the first node 20.

14 is a diagram for describing a process of validating transaction information at a node on a network of a blockchain, according to an exemplary embodiment.

For example, the first node 20 may receive the transaction information 1410 from the electronic device 10 of the first user. The transaction information 1410 includes the transaction information 1411 in which the first user transfers the 3,500,000 cache of the first cryptocurrency to the second user, and the first cryptogram "%! ## (YSEDK $ # 9 $ KPXL &%"). The first node 20 may apply a hash function to the transaction information 1411 to generate a hash value "8F23V230" 1421 corresponding to the transaction information 1411. The first node 20 decodes the first ciphertext "%! ## (YSEDK $ # 9 $ KPXL &%" 1412) using the public key 1425 of the first user to generate the hash value "8F23V230" 1422. Since the hash value "8F23V230" 1421 and the hash value "8F23V230" 1422 are the same, the first node 20 determines that the transaction information 1410 received from the electronic device 10 of the first user is valid. Can be judged.

For another example, the first node 20 may receive the transaction information 1430 from the electronic device 10 of the first user. The transaction information 1430 includes the transaction information 1431 where the first user transfers the 2,500,000 cache of the first cryptocurrency to the second user, and the first cryptogram "%! ## (YSEDK $ # 9 $ KPXL &%") (1412). The first node 20 may apply a hash function to the transaction information 1431 to generate a hash value “6F49X298” 1441 corresponding to the transaction information 1431. The first node 201. 20 decodes the first ciphertext "%! ## (YSEDK $ # 9 $ KPXL &%" 1412) using the public key 1425 of the first user to generate the hash value "8F23V230" 1422. Since the hash value "6F49X298" 1421 and the hash value "8F23V230" 1422 are not the same, the first node 20 may determine that the transaction information 1430 received from the electronic device 10 of the first user. It can be determined that it is not valid.

15 is a block diagram illustrating a structure of a block and a blockchain according to an embodiment.

As shown in FIG. 15, a blockchain may be constructed by connecting blocks in which valid transaction information is recorded. That is, the data structure of the blockchain may be a predetermined data structure composed of units in which blocks in which transaction information is recorded are arranged in order. In addition, the data structure of the blockchain is a data structure in which each block header is linked in a chain form with reference to the previous block header, and a data structure of the Merkle tree in which a hash reference indicating data of the transaction information and data of the transaction information are connected in a tree form. Can be configured.

The block may include a block hash, block header, transaction information, and the like. The block header may include the version of the current program, the hash value of the previous block header, the root of the Merkle tree, the timestamp, the difficulty, and the nonce.

The block hash may be a hash value of a hash function applied by using information of a version of a current program, a hash value of a previous block header, a root of a Merkle tree, a time stamp, a difficulty level, and a nonce. That is, the value of the block hash may be a value that hashes the block header, not a value that hashes the entire block.

The hash value of the previous block header may uniquely identify each block header and may be used to refer to the previous block header. If each block header refers to the previous block header, the order of the individual block headers and blocks may be maintained. Referring to FIG. 15, since the first block 1510 is the first block and there is no previous block, there is no reference to the previous block header. Thus, the hash value of the previous block header of the first block 1510 is zero. In addition, since the second block 1520 includes the first block 1510 that is the previous block, the second block header has a hash value indicating the first block header. Similarly, since the third block 1530 has the second block 1520, which is the previous block, the third block header has a hash value indicating the second block header.

The Merkle tree may mean a structure in which a hash reference and data of transaction information are connected in a tree form. The hash reference may refer to data of transaction information using an encrypted hash value. On the other hand, since the encrypted hash value is a unique value of the data, different data do not have the same hash value.

In detail, the process of generating the Merkle tree includes a hash reference (for example, each of the data of the transaction information (for example, first transaction information, second transaction information, third transaction information, and fourth transaction information)). , A first hash reference, a second hash reference, a third hash reference, and a fourth hash reference) may be generated. When a hash reference is generated, a hash reference that points to a pair of hash references (e.g., a 12th hash reference pointing to a first hash reference and a second hash reference, a 34th hash reference pointing to a third hash reference, and a fourth hash reference). ) May be generated. Thereafter, the operation of generating a hash reference that points to the pair of hash references may be repeated to generate a single hash reference (eg, a twelfth hash reference and a 1234 hash reference to the thirty-fourth hash reference). That is, the Merkle tree may be a tree-type structure starting from a single hash reference and linked to data of each transaction information. The root of the Merkle tree may mean a single generated hash reference.

The time staff may mean the time when the work started to prove the work. The difficulty may refer to constraints in proof of work or hash puzzles. The nonce may refer to a value in which the value of the block hash is adjusted to satisfy the constraint for proof of work.

16 is a block diagram illustrating a configuration of an electronic device according to an embodiment.

The electronic device 1600 illustrated in FIG. 16 may include a communication device 1610, a sensor device 1620, a user interface device 1630, a memory 1640, and a processor 1650. However, not all illustrated components are essential components. The electronic device 1600 may be implemented by more components than the illustrated components, and the electronic device 1600 may be implemented by fewer components. Hereinafter, the components will be described. The electronic device 1600 illustrated in FIG. 16 may correspond to the electronic device 10 described with reference to FIGS. 1 to 15.

According to some embodiments, the communication device 1610 may communicate with an external device. In detail, the communication device 2110 may be connected to a network by wire or wirelessly to communicate with an external device. Here, the external device may be a server, a smartphone, a tablet, a PC, a computing device, or the like. The communication device 1610 may include a communication module supporting one of various wired and wireless communication methods. For example, the communication module may be in the form of a chipset, or may be a sticker / barcode (e.g. a sticker including an NFC tag) including information necessary for communication. In addition, the communication module may be a short range communication module or a wired communication module.

For example, the communication device 1610 may include a wireless LAN, a wireless fidelity (Wi-Fi), a Wi-Fi Direct (WFD), a Bluetooth, a Bluetooth Low Energy (BLE), a Wired Lan, and an NFC ( It may support at least one of Near Field Communication, Zigbee Infrared Data Association (IrDA), 3G, 4G, and 5G.

According to some embodiments, the communication device 1610 may communicate with at least one node on a network of a blockchain that distributes and manages a ledger that records a transaction for a cryptocurrency. For example, the communication device 1610 may transmit transaction information of a cryptocurrency traded between the first user and the second user to the first node 20. Here, the transaction information may be encrypted with the private key of the first user obtained from the biometric information of the first user.

According to some embodiments, the communication device 1610 may transmit the public key of the first user obtained from the electronic device 1600 to the first node 20. The public key of the first user is a value calculated by applying the private key of the first user to a hash function.

According to some embodiments, the sensor device 1620 may be a device used to detect biometric information about a predetermined portion of the first user. The sensor device 1620 may include a fingerprint sensor, an iris sensor, a face sensor, a vein sensor, and the like, but is not limited thereto.

For example, the fingerprint recognition sensor may serve to read the skin irregularities formed on the surface of the finger. Types of sensors used as the fingerprint sensor may include capacitive, radio frequency, thermal, and optical arrays. Although the measurement mechanism of each fingerprint recognition sensor method is different, the resulting biological image information can obtain the form of the fingerprint in contact with the sensor.

For example, the iris sensor may capture a user's iris by adjusting a focus through a zoom lens of a camera using infrared rays at a predetermined distance. The iris sensor may image the photographed iris and analyze the light and shade patterns of the iris for each region according to the iris recognition algorithm. The iris recognition sensor may generate a user's own iris code based on the analysis result.

For example, the vein recognition sensor may detect a constant shape of the vein flowing in the finger of the user using near infrared rays. The vein recognition sensor can acquire the distribution of veins and the shape of vein patterns.

According to some embodiments, the user interface device 1630 may refer to a device that receives data from the user to control the electronic device 1600. The processor 1650 may control the user interface device 1630 to generate and output a user interface screen for receiving a predetermined command or data from a user. The user interface device 1630 is configured to display an input unit for receiving an input for controlling the operation of the electronic device 1600, a result according to the operation of the electronic device 1600, or information such as a state of the electronic device 1600. It may include an output unit. For example, the user interface device 1630 may include an operation panel for receiving a user input, a display panel for displaying a screen, and the like.

In detail, the input unit may include, for example, devices capable of receiving various types of user input such as a keyboard, a physical button, a touch screen, a camera or a microphone. In addition, the output unit may include, for example, a display panel or a speaker. However, the present invention is not limited thereto, and the user interface device 1630 may include a device supporting various input / output.

According to some embodiments, the user interface device 1630 may display an execution screen of the electronic wallet of the first user. For example, the user interface device 1630 may display information of a cryptocurrency held in the electronic wallet of the first user. In addition, the user interface device 1630 may display a screen executed by the first user to trade cryptocurrency with another user.

The memory 1640 may include a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (SD, XD memory, etc.), RAM; Random Access Memory (SRAM) Static Random Access Memory (ROM), Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Programmable Read-Only Memory (PROM) Magnetic Memory, Magnetic Disk, Optical Disk It may include one type of storage medium. The memory 1640 may store at least one program for executing in the computer a method of controlling an operation of the electronic wallet executed in the electronic device 1600. At least one program stored in the memory 1640 may be classified into a plurality of modules according to a function.

The processor 1650 controls the overall operation of the electronic device 1600 and may include at least one processor such as a CPU. The processor 1650 may control other components included in the electronic device 1600 to perform an operation corresponding to a user input received through the user interface device 1630. In addition, the processor 1650 may include at least one specialized processor corresponding to each function or may be a processor integrated into one.

The processor 1650 may execute a program stored in the memory 1640, read data or a file stored in the memory 1640, or store a new file in the memory 1640. In addition, the processor 1650 may execute instructions stored in the memory 1640.

The processor 1650 may perform the same operation as that of the processor 15 described with reference to FIGS. 2 to 9. Hereinafter, the description of the operation of the processor 1650 will be omitted.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the devices and components described in the embodiments are, for example, processors, controllers, arithmetic logic units (ALUs), digital signal processors, microcomputers, field programmable gate arrays (FPGAs). Can be implemented using one or more general purpose or special purpose computers, such as a programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to the execution of the software. For the convenience of understanding, a processing device may be described as one being used, but a person skilled in the art will appreciate that the processing device includes a plurality of processing elements and / or a plurality of types of processing elements. It can be seen that it may include. For example, the processing device may include a plurality of processors or one processor and one controller. In addition, other processing configurations are possible, such as parallel processors.

The software may include a computer program, code, instructions, or a combination of one or more of the above, and configure the processing device to operate as desired, or process independently or collectively. You can command the device. Software and / or data may be any type of machine, component, physical device, virtual equipment, computer storage medium or device in order to be interpreted by or to provide instructions or data to the processing device. Or may be permanently or temporarily embodied in a signal wave to be transmitted. The software may be distributed over networked computer systems so that they are stored or executed in a distributed manner. Software and data may be stored on one or more computer readable recording media.

The method according to the embodiment can be implemented in the form of program instructions that can be executed by various computer means and recorded on a computer readable recording medium. The computer readable recording medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded on the media may be those specially designed and constructed for the purposes of the embodiments, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine code, such as produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

Although the embodiments have been described by the limited embodiments and the drawings as described above, various modifications and variations are possible to those skilled in the art from the above description. For example, the described techniques may be performed in a different order than the described method, and / or components of the described systems, structures, devices, circuits, etc. may be combined or combined in a different manner than the described method, or other components. Or even if replaced or replaced by equivalents, an appropriate result can be achieved.

Therefore, other implementations, other embodiments, and equivalents to the claims are within the scope of the following claims.

Claims (22)

Obtaining a biometric image of scanning a predetermined portion of the user;
Obtaining a recognition template representing a biometric characteristic of the user from the biometric image;
Dividing the recognition template into a plurality of areas, and determining an identification value corresponding to the recognition template based on biometric characteristic information in the divided areas; And
Applying the identification value to a first hash function to calculate a hash value and generating the calculated hash value as the private key of the user used for digital signature. The method of claim 1,
Determining an identification value corresponding to the recognition template based on the biometric characteristic information in the divided regions,
Determining a reference template matched to each of the divided regions based on the biometric characteristic information in the divided regions;
And assigning a reference value of the reference template as the identification value to each of the divided regions. The method of claim 2,
And obtaining information of reference templates representing each of the biometric features of the predetermined region and reference value information indicating the reference templates. The method of claim 2,
Determining a reference template matched to each of the divided regions based on the biometric characteristic information in the divided regions,
Detecting at least one feature point and the at least one feature line in the divided regions, the at least one feature point being used to recognize a biometric feature of the predetermined site;
Acquiring biometric characteristic information of the predetermined portion based on at least one of a position, a number, a distribution diagram, and a direction and pattern of the at least one feature line; And
And determining the reference template matched to each of the divided regions based on the biometric characteristic information in the divided regions and the information of the reference templates. The method of claim 2,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the user,
Arranging identification values assigned to each of the divided regions on a predetermined basis to obtain a total identification value; And
And applying the entire identification value to the first hash function to calculate a first hash value, and generating the calculated first hash value as the private key of the user. The method of claim 2,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the user,
Calculating a first hash value by applying the entire identification value obtained by combining the identification values assigned to each of the divided regions to the first hash function;
Calculating a second hash value by applying the first hash value to the first hash function; And
Generating the second hash value as the private key of the user. The method of claim 2,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the user,
Calculating a first hash value by applying a first reference value allocated to a first region among the plurality of regions, wherein N is two or more, to the first hash function; And
Calculating an nth hash value by applying an n−1 hash value and an n th reference value allocated to an n th region among the plurality of regions to the first hash function, sequentially increasing by 1 from n = 2 Repeating to n = N; And
Generating an N-th hash value as the private key of the user. The method of claim 2,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the user,
A process of calculating an n-th hash value of a first layer by applying an n-th reference value assigned to an n-th area among the plurality of N areas, where N is 2 or more, to the first hash function is performed from n = 1. Sequentially increasing by 1 to repeat n = N;
combining the hash values of the n-1 layer by two and applying the first hash function to the first hash function to increase the hash value of the n layer sequentially from n = 2 to 1 by the highest layer (if N is an even number, If the highest layer is an N / 2 layer and N is odd, the highest layer is repeated until the number of hash values of (N + 1) / 2 layers is one; And
If the number of hash values of the top layer is one, generating a hash value of the top layer as the private key of the user. The method of claim 1,
And generating a hash value calculated by applying the generated private key of the user to the first hash function as the public key of the user. The method of claim 9,
And transmitting the public key of the user to a node on a network of a blockchain that distributes and manages a ledger recording a transaction for a cryptocurrency. A method of controlling an operation of an electronic wallet that manages cryptocurrency in an electronic device,
Executing the electronic wallet of the first user;
Acquiring a biological image of scanning a predetermined portion of the first user;
Obtaining a recognition template indicating biometric characteristic information of the first user from the biometric image;
Calculating a hash value by applying an identification value corresponding to the recognition template to a first hash function, and generating the calculated hash value as the private key of the first user; And
Digitally signing the first transaction information of the cryptocurrency between the first user and the second user with the private key of the first user, and distributing and managing the ledger recording the transaction for the cryptocurrency. Transmitting. The method of claim 11,
Dividing the recognition template into a plurality of regions;
Determining a reference template matched to each of the divided regions based on the biometric characteristic information in the divided regions; And
And assigning a reference value of the reference template as the identification value to each of the divided regions to determine an identification value corresponding to the recognition template. The method of claim 12,
Determining a reference template matched to each of the divided regions based on the biometric characteristic information in the divided regions,
Detecting at least one feature point and at least one feature line in the divided regions, the at least one feature point being used to recognize a biometric feature of the predetermined region;
Acquiring biometric characteristic information of the predetermined portion based on at least one of a position, a number, a distribution diagram, and a direction and pattern of the at least one feature line; And
Determining the reference template that matches each of the partitioned regions based on biometric feature information in the partitioned regions and information of reference templates. The method of claim 12,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the first user,
Arranging identification values assigned to each of the divided regions on a predetermined basis to obtain a total identification value; And
Applying the full identification value to the first hash function to calculate a first hash value and generating the calculated first hash value as the private key of the first user. The method of claim 12,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the first user,
Calculating a first hash value by applying the entire identification value obtained by combining the identification values assigned to each of the divided regions to the first hash function;
Calculating a second hash value by applying the first hash value to the first hash function; And
Generating the second hash value as the private key of the first user. The method of claim 12,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the first user,
Calculating a first hash value by applying a first reference value allocated to a first region among the plurality of regions, wherein N is two or more, to the first hash function; And
Calculating an nth hash value by applying an n−1 hash value and an n th reference value allocated to an n th region among the plurality of regions to the first hash function, sequentially increasing by 1 from n = 2 Repeating to n = N; And
Generating an N-th hash value with the private key of the first user. The method of claim 12,
Applying the identification value to a first hash function to calculate a hash value, and generating the calculated hash value as the private key of the first user,
A process of calculating an n-th hash value of a first layer by applying an n-th reference value assigned to an n-th area among the plurality of N areas, where N is 2 or more, to the first hash function is performed from n = 1. Sequentially increasing by 1 to repeat n = N;
combining the hash values of the n-1 layer by two and applying the first hash function to the first hash function to increase the hash value of the n layer sequentially from n = 2 to 1 by the highest layer (if N is an even number, If the highest layer is an N / 2 layer and N is odd, the highest layer is repeated until the number of hash values of (N + 1) / 2 layers is one; And
If the number of hash values of the top layer is one, generating the hash value of the top layer as the private key of the first user. The method of claim 11,
Digitally signing the first transaction information with the private key of the first user and transmitting it to a node of the network of the blockchain,
Generating a hash value corresponding to the first transaction information by applying the first transaction information to a second hash function;
Generating a first cipher text indicating a digital signature of the first transaction information by encrypting a hash value corresponding to the first transaction information with the private key of the first user; And
Sending the first cryptogram along with the first transaction information to the node. The method of claim 11,
Determining a hash value corresponding to the private key of the first user calculated by applying the determined private key of the first user to the first hash function, as the public key of the first user; and
Sending the public key of the first user to a node on the network of the blockchain. The method of claim 11,
Obtaining first transaction information of the cryptocurrency between the first user and the second user; And
In accordance with the first transaction information, performing a transaction of the cryptocurrency between the electronic wallet of the first user and the electronic wallet of the second user. A computer-readable recording medium having recorded thereon a program for executing the method of any one of claims 1 to 10. Communication devices;
Sensor devices;
A processor;
User interface devices; And
A memory storing instructions executable by the processor, the processor executing the instructions,
Launch the first user's wallet,
Acquire a biological image of scanning a predetermined portion of the first user through the sensor device,
Obtaining a recognition template representing biometric characteristic information of the first user from the biometric image,
Applying a identification value corresponding to the recognition template to a first hash function to calculate a hash value, and generating the calculated hash value as a private key of the first user,
Digitally signing first transaction information of the cryptocurrency between the first user and a second user with the private key of the first user,
And transmit the digitally signed first transaction information through the communication device to a node of a network of a blockchain that distributes and manages a ledger that records a transaction for the cryptocurrency.

Images