WO2022211748A1

WO2022211748A1 - A blockchain security method

Info

Publication number: WO2022211748A1
Application number: PCT/TR2021/050277
Authority: WO
Inventors: Omer GOKSOY
Original assignee: Goksoy Omer
Priority date: 2021-03-29
Filing date: 2021-03-29
Publication date: 2022-10-06

Abstract

The invention relates to a blockchain security method comprising generating a hash number (12) using a predetermined hash algorithm (10) from a data set (8) obtained by an electronic device (70) with a processor, encryption of the data (6) and obtaining a data block (64) by inserting to the obtained hash information (12) to the encrypted data (6). The method further comprising the process step of selecting a nonce calculation method (18, 20) according to the number index contained by the hash algorithm (10); preferably selecting a shift (18) or a skip nonce calculation method (20); get a total number of nonce (34) in accordance with the selected method; get a nonce number (52) in each step by performing a nonce operation step (36) in the total number of nonce numbers (34); adding each got nonce number (52) to a result list (56) to a block (64) in the blockchain (66) in the form of a nonce text (62) by inserting a separator (60) therebetween.

Description

A BLOCK CHAIN SECURITY METHOD

TECHNICAL FIELD

The invention relates to a blockchain security method in a blockchain infrastructure by calculating a nonce text utilizing various methods and adding a nonce text to a block in the blockchain.

BACKGROUND OF THE ART

In computer terminology, blockchain refers to continuously growing ledger of transactions with blocks linked in a chain. The storage where the transaction records of peer-to-peer connected the blocks are stored is so called the digital ledger.

The foundation of Blockchain technology was laid in the early 1990s with the work done by cryptography experts Stuart Haber and Scott Stornetta. Starting from the concept of the "hash tree" patented by Ralph Merkle in the 1970s, the two experts managed to approach the modern definition of blockchain, although they did not fully conceptualize their work. For this reason, according to many, the inventor of this technology is Haber and Stornetta, not Satoshi Nakamoto.

The first Blockchain in its current sense is as old as Bitcoin, the first cryptocurrency in history. When the calendars showed October 31, 2008, it was stated in the white paper document named “Bitcoin: Peer-to-Peer Electronic Cash System” published by a person or group named Satoshi Nakamoto that the BTC infrastructure was completely based on blockchain technology.

The blockchain technology having a wide area of operation, is utilized in many central or decentralized industries, although it is mostly referred with the crypto currencies. There are countless official and informal use cases, from banks to governments, from smart contracts to notary transactions, among the blockchain usage areas. The potential of the technology to lead to revolutionary changes and transformations in almost all business models in the world is widely accepted. Today, there are many settlements that integrate blockchain technology into voting systems. Additionally, the control of supply chains has become a much more transparent and consistent process with this technology. Escrow agents, which were previously needed to establish trust, are no longer needed due to the blockchain. Thanks to this technology, many processes and procedures that used to be under the control of people are now much safer and more transparent. There are some authorities who describe blockchain technology as the most innovative invention since the birth of the internet.

The most important features underlying the operating principle of blockchain technology are its anonymity, distributed, decentralized and public, unbreakable and unhackable structure. Everyone, particularly computer scientists approach this technology with admiration due to the fact that information record chain is both accessible to everyone and unbreakable. There is a simple logic behind the fact that the records committed to the blocks are unbreakable and unchangeable: In order to corrupt the blocks, all the blocks in this registry, which has billions of copies, must be changed. It is almost impossible to make such an intervention.

A blockchain wallet is a digital storage device for sending or holding cryptocurrencies. These wallets have two unique codes called the wallet ID and the private key. Technically, the wallet ID is similar to an e-mail address, and the private key to the password of this e-mail address. Transactions in the wallets are recorded on the blockchain. Blockchain allows one to make deposits extremely quickly and securely. In addition to the investments, Blockchain also provides the necessary security in the withdrawal process. In order to transfer to another crypto wallet, it is sufficient to know the identity code of that wallet. The private key should never be shared with anyone because access to the wallet is provided with this signature code. There is no need to store this code to access your wallets on a cryptocurrency exchange.

Creating a blockchain wallet is an extremely easy process that can be done with one click. There are some open source websites serving in the technical field. Likewise, by registering with one of the reliable crypto currency exchanges, such as BtcTurk, one can create a wallet for all cryptocurrencies open to transaction. After creating a wallet, one can transfer from another wallet to his new wallet or withdraw to his other wallet.

KR202000013871 discloses the proof of probability (PoP) and a blockchain compensation method based on an apparatus capable of solving excessive power consumption or monopoly problems. The method for blockchain compensation includes: (a) the step of receiving candidate block hashes containing a single real block hash and a plurality of fake block hashes according to a business complexity level; (b) the step of using an independent checksum alignment algorithm to sequentially align received candidate block hashes; (c) the step of using a hash of a single transaction, a hash of a Merkle tree, and a block hash of an immediately preceding block to generate a block header; (d) the step of substituting a random first one for the generated block header to perform SHA one-way decoding operations; and (e) verifying if a block hash calculated by the decoding operations meets a predetermined pattern, whether the actual block hash of the first nonce is a nonce.

CN110535658 relates to a block chain data processing method, device and system. The method comprises the following steps: inputting the same input data into a plurality of parallel branches in parallel; the plurality of parallel branches perform parallel processing on the block header data based on the input data; and in the process of carrying out parallel processing on the block header data, the plurality of parallel branches carry out accumulation iteration from the starting position random number nonce_sta to the ending position random number nonce_fin of a plurality of different parallel intervals in parallel for the random number segment of the block header data. According to the embodiment of the invention, the method can reduce the time consumption of cyclic calculation, and improves the data processing efficiency.

KR20190000578 discloses a method for securing data in a public distributed database based on a blockchain and a blockchain management server using it, and more specifically, encryption of data when recording data on a physical blockchain network.

CN111506647 is in the technical field of computer operations, particularly a method for proof of fuzzy random collision workload. Proof of Work (full name Proof of Work) was discovered long before the emergence of Bitcoin. It is common to use the complexity of hashing to perform CPU operations to determine workload. The publication contains information on the algorithm mechanism that calculates the suitability of the hash value by assigning a random nonce value to improve the security performance and features of the blockchain.

BRIEF DESCRIPTION OF THE INVENTION

The object of the invention is to improve the properties of a blockchain security by calculating the number of nonce using various methods to ensure data security in a blockchain infrastructure and inserting as a nonce text to a block in the blockchain. In order to achieve the mentioned objective, the invention comprises a blockchain security method comprising generating a hash number using a predetermined hash algorithm from a data set obtained by an electronic device with a processor, encryption of the data and obtaining a data block by inserting to the obtained hash information to the encrypted data. Invention further comprising the process step of selecting a nonce calculation method according to the number index contained by the hash algorithm; preferably selecting a shift or a skip nonce calculation method; get a total number of nonce in accordance with the selected method; get a nonce number in each step by performing a nonce operation step in the total number of nonce numbers; adding each got nonce number to a result list to a block in the blockchain in the form of a nonce text by inserting a separator therebetween. In this way, nonce numbers created to maintain system security in a blockchain infrastructure can be created with different methods, and the confusion of nonce numbers as character properties is prevented by creating a nonce text.

A preferred embodiment of the invention comprises step of determining the hash complexity from the hash information consisting of zeros or containing a predefined number sequence. This define number list property of the hash complexity value.

A preferred application of the invention comprises the step of utilizing nonce calculation method with sliding and skipping from the hash number wherein the number sequence corresponds the hash complexity level, in a formula with the predetermined hash length of the nonce and calculation of the total number of nonce. In this way, nonce number calculation is characterized by calculating multiple nonce numbers.

In a preferred application of the invention, in case of a sliding nonce calculation method is selected for finding a number sequence consisting of zeros calculating the total number of nonce utilized comprising the steps of subtracting the number of hash lengths from the number of degrees of complexity and adding the one to the result. In this way, it is ensured that the nonce number calculation suitable for the method is found in the form of nonce numbers.

In a preferred application of the invention, in case of a sliding nonce calculation method is selected for finding a number sequence consisting of zeros, nonce processing steps are performed in the total number of nonce numbers comprising the step of finding the hash number containing the number sequence consisting of zeros found during a nonce processing step as a hash number by sliding the number sequence consisting of zeros desired to be found in the next processing step by sliding one number to the right. The hash numbers are generated by selecting a shift nonce calculation method for finding the number sequence consisting of zeros according to the preferred application.

In a preferred application of the invention, if a skipping nonce calculation method is selected for finding a number sequence consisting of zeroes, while the total number of nonces used in the calculation the number of hash lengths is divided by the number of complexity degrees; if the result is a decimal number, complete it to the next natural number, if it is not a decimal number keeping the same natural number. Accordingly, to encounter a decimal number value is prevented in the calculation of the total number of nonce.

In a preferred application of the invention, in a skipping nonce calculation method for finding a number sequence consisting of zeroes, the nonce processing step is performed on the total number of nonce numbers; a hash number is obtained by sliding the hash number containing the number sequence consisting of zeros found during a nonce processing step to the right by the number of the number of zeros desired to be found in the next processing step by sliding it to the right by the number of complexity degrees. In this way, a skipping nonce calculation is utilized to find the number sequence consisting of zeros by sliding the hash number to the right by the number of complexity degrees in each operation step.

In a preferred application of the invention, if a sliding nonce calculation method is selected to find a certain number sequence, the total number of nonce used is calculated; subtracting the hash length number of the string of numbers from the number of degrees of complexity; adding the number 1 to the result. The nonce number calculation according to the method is found in the form of nonce numbers.

A preferred application of the invention is if a sliding nonce calculation method is selected to find a certain number sequence, the hash number is obtained by sliding a certain number sequence desired to be found in the subsequent processing step while nonce processing steps are performed in the total number of nonce numbers wherein the hash number obtained by finding a certain number sequence found during a nonce processing step. In this way, it is ensured that the hash numbers are generated by selecting a nonce calculation method with a shift to find a certain number sequence.

In a preferred application of the invention, in the case of selecting a skipping nonce calculation method for finding a certain number sequence, the total number of nonce used in the calculation; dividing the hash length number of the string of numbers by the number of the degree of complexity; if the result is a decimal number, complete it to the next natural number; If it is not a decimal number, keeping the same natural number. A decimal number value is prevented accordingly, in the calculation of the total number of nonce suitable for the method.

A preferred application of the invention is in a skipping nonce calculation method for finding a certain number sequence, while nonce processing steps is performed in the total number of nonce numbers a hash number, which includes finding a certain number sequence found during the hash number is skip to the right by complexity degree of the number sequence to be founded during a nonce processing step. A skipping nonce calculation is utilized to find a certain sequence of numbers by sliding the hash number to the right by the number of complexity degrees in each process step.

A preferred embodiment of the invention comprising the steps of generating a hash number in each transaction step of the nonce transaction steps; generating a nonce number for each transaction that indicates how many transactions each hash number is found and the writing of each nonce number side by side in a result list. In this way, it is ensured that nonce numbers are found as a result of the processing steps, preventing the formation of long valued nonce numbers.

In a preferred application of the invention colons or squares are used as separators. In this way, it is possible to know the total number of nonces of nonce numbers written side by side in the result list.

In a preferred application, the transactions are carried out via an electronic device. In this way, it is possible to perform all transactions.

BRIEF DESCRIPTION OF THE FIGURES

Figure 1 represents the flowchart of the conventional blockchain security method.

Figure 2 represents the flowchart in a blockchain security method wherein the predefined method is a shifting nonce calculation to get a sequence of numbers consist of zeros.

Figure 3 represents the flowchart in a blockchain security method wherein the predefined method is a skipping nonce calculation to get a sequence of numbers consist of zeros. Figure 4 shows the flowchart in a blockchain security method wherein the predefined method is a shifting nonce calculation to get a sequence of numbers.

Figure 5 is a flowchart illustration of a block chain security method when the predefined method selects a skipping nonce calculation to find a certain sequence of numbers.

DETAILED DESCRIPTION OF THE INVENTION

In this detailed explanation, the development that is the subject of the invention is explained without any limitation and only with references to better explain the subject.

Figure 1 shows the flowchart of the conventional blockchain security method. The conventional method comprises the process steps of generating to a hash number (12) with a hash algorithm (10) on a data set (8) as an input to the process to ensure the encryption (6) of the data; calculating a nonce number (52); adding the nonce number (52) to a block (64); chaining a plurality of data blocks (64) to form a blockchain (66); employing the block chain (66) in a blockchain infrastructure (68) and performing the transactions by means of an electronic device (70) and store in the device (70).

Figure 2 shows the flowchart in a blockchain security method when a predetermined method is selected as a shift nonce calculation to find a sequence of zeros. In a shift nonce computation method for finding a sequence of numbers consisting of zeros, data to be processed encryption (6) is converted to a hash number (12) with a hash algorithm (10); the hash number (12) contains a number string (14) of zeros; processing preferably according to the sliding nonce calculation method (18); calculating the total number of nonces (34), by first subtracting the number (22) of the length of the previously known hash number (22) and the numerical value of the complexity level of the hash number (24) in a formula related to the method (26) and then adding the number (28); performing nonce processing steps (36) in the total number of nonce (34) counts; finding multiple nonce numbers (38) with each nonce processing step (36); each nonce transaction step consists of multiple transactions and the hash number (44) in the desired nonce transaction step is found in the last transaction of the nonce transaction step; finding a new nonce hash number (44) formed by sliding the hash number (44) found as a result of a nonce processing step to the right by one in the next nonce processing step (46); ensure the most recent transaction value containing the nonce hash number is a nonce number (52); repeating this at each nonce processing step (36) and finding the nonce numbers (54); generating the found nonce numbers (54) in the result list (56); writing the nonce numbers generated in the result list side by side when the calculations are completed (58); inserting (60) a colon or square separator between each nonce number (52); thereby creating (62) a nonce text; inserting the nonce text (62) to a block; combining a plurality of data blocks (64) to form a blockchain (66); introducing the block chain (66) in a blockchain infrastructure (68) and performing all these transactions by means of an electronic device (70) and record in the device (70).

Figure 3 shows the flowchart of a block chain security method when the predetermined method is selected, a skipping nonce calculation to find a string of zeros. In a skipping nonce computation method for finding a sequence of numbers consisting of zeros, data to be processed encryption (6) is converted to a hash number (12) with a hash algorithm (10); the hash number (12) contains a number string (14) of zeros; processing preferably according to the skip nonce calculation method (20); first dividing (30) the previously known length of the hash number (22) and the numerical value of the complexity level (24) of the hash number in a formula related to the method, and then rounding (32) to the next natural number if the result is a decimal number; remain the same if it is not a decimal number; the result is the calculation of the total number of nonce (34); performing nonce processing steps (36) in the total number of nonce (34) counts; finding multiple nonce numbers (38) with each nonce processing step (36); each nonce transaction step consists of multiple transactions and the hash number (44) in the desired nonce transaction step is found in the last transaction of the nonce transaction step; finding a new nonce hash number (44) that is formed by sliding the hash number (44) found as a result of a nonce processing step to the right by the complexity level number value (48) in the next nonce processing step; the most recent transaction value containing the nonce hash number is a nonce number (52); repeating this at each nonce processing step (36) and finding the nonce numbers (54); generating the found nonce numbers (54) in the result list (56); writing the nonce numbers generated in the result list side by side when the calculations are finished (58); inserting (60) a colon or square separator between each nonce number (52); thereby creating (62) a nonce text; adding the nonce text (62) to a block; combining a plurality of data blocks (64) to form a blockchain (66); introducing the block chain (66) in a blockchain infrastructure (68) and performing all these transactions by means of an electronic device (70) and record in the device (70).

Figure 4 shows the flowchart in a blockchain security method when the predetermined method is chosen to calculate a shift nonce to find a certain sequence of numbers. In a shift nonce computation method for finding a given sequence of numbers, data to be processed encryption (6) is converted to a hash number (12) with a hash algorithm (10); the hash number (12) contains a particular sequence of numbers (16); preferably according to the sliding nonce calculation method (18); calculating the total number of nonces (34), by first subtracting the number (22) of the length of the previously known hash number (22) and the numerical value of the complexity level of the hash number (24) in a formula related to the method (26) and then adding the number (28); performing nonce processing steps (36) in the total number of nonce (34) counts; finding multiple nonce numbers (38) with each nonce processing step (36); each nonce transaction step consists of multiple transactions and the hash number (44) in the desired nonce transaction step is found in the last transaction of the nonce transaction step; finding a new nonce hash number (44) formed by sliding the hash number (44) found as a result of a nonce processing step to the right by one in the next nonce processing step (46); the most recent transaction value containing the nonce hash number is a nonce number (52); repeating this at each nonce processing step (36) and finding the nonce numbers (54); generating the found nonce numbers (54) in the result list (56); writing the nonce numbers generated in the result list side by side when the calculations are completed (58); inserting (60) a colon or square separator between each nonce number (52); thereby creating (62) a nonce text; adding the nonce text (62) to a block; combining a plurality of data blocks (64) to form a blockchain (66); introducing the block chain (66) in a blockchain infrastructure (68) and performing all these transactions by means of an electronic device (70) and record in the device (70).

Figure 5 shows the flowchart in a blockchain security method when the predetermined method is chosen to perform a skipping nonce calculation to find a certain sequence of numbers. In a skipping nonce computation method for finding a particular sequence of numbers, data to be processed encryption (6) is converted to a hash number (12) with a hash algorithm (10); the hash number (12) contains a particular sequence of numbers (14); preferably according to the skip nonce calculation method (20); dividing (30) the length of the previously known hash number (22) and the numerical value of the complexity level (24) of the hash number in a formula related to the method, and then rounding (32) to the next natural number if the result is a decimal number; remain the same if it is not a decimal number; the result is the calculation of the total number of nonce (34); performing nonce processing steps (36) in the total number of nonce (34) counts; finding multiple nonce numbers (38) with each nonce processing step (36); each nonce transaction step consists of multiple transactions and the hash number (44) in the desired nonce transaction step is found in the last transaction of the nonce transaction step; finding a new nonce hash number (44) that is formed by sliding the hash number (44) found as a result of a nonce processing step to the right by the complexity level number value (48) in the next nonce processing step; the most recent transaction value containing the nonce hash number is a nonce number (52); repeating this at each nonce processing step (36) and finding the nonce numbers (54); generating the found nonce numbers (54) in the result list (56); writing the nonce numbers generated in the result list side by side when the calculations are finished (58); placing (60) a colon or square separator between each nonce number (52); thereby creating (62) a nonce text; adding the nonce text (62) to a block; combining a plurality of data blocks (64) to form a blockchain (66); introducing the block chain (66) in a blockchain infrastructure (68) and performing all these transactions by means of an electronic device (70) and record in the device (70).

REFERENCE NUMBERS

6 Encryption of data 36 Nonce processing steps

8 Datasets 38 Multiple nonce count

10 Hash algorithms 44 Process step hashes

12 Hash count 46 One shift to right

14 A string of zeros 48 Shift to the right by complexity degrees

16 A specific sequence of numbers 52 Nonce number

18 Shift nonce calculation 54 Nonce numbers found

20 Skip nonce calculation 56 Results list

22 Numeric value of hash number length 58 Writing Nonce numbers side by side

24 Hash complexity levels 60 Insert separator

26 Subtraction 62 Creating nonce text

28 Adding the number 1 64 A data block

30 Division step 66 Blockchain

32 Rounding to the next natural number 68 Blockchain infrastructure

Claims

1- A blockchain security method comprising generating a hash number (12) using a predetermined hash algorithm (10) from a data set (8) obtained by an electronic device (70) with a processor, encryption of the data (6) and obtaining a data block (64) by inserting to the obtained hash information (12) to the encrypted data (6) characterized by comprising the process step of selecting a nonce calculation method (18, 20) according to the number index contained by the hash algorithm (10); preferably selecting a shift (18) or a skip nonce calculation method (20); get a total number of nonce (34) in accordance with the selected method; get a nonce number (52) in each step by performing a nonce operation step (36) in the total number of nonce numbers (34); adding each got nonce number (52) to a result list (56) to a block (64) in the blockchain (66) in the form of a nonce text (62) by inserting a separator (60) therebetween.

2- A blockchain security method according to claim 1 , wherein comprising step of determining the hash complexity (24) from the hash information (12) consisting of zeros (14) or containing a predefined number sequence (16).

3- A blockchain security method according to claim 2, comprising the steps of utilizing nonce calculation method (22) (24) (26) (28) (30) (32) with sliding (18) and skipping (20) from the hash number (14) (16) wherein the number sequence corresponds the hash complexity (24) level, in a formula with the predetermined hash length of the nonce and calculation of the total number of nonce (34).

4- A blockchain security method according to Claim 3, wherein in case of a sliding nonce calculation method (18) is selected for finding a number sequence (14) consisting of zeros calculating the total number of nonce (34) utilized comprising the steps of subtracting the number of hash lengths (22) from the number of degrees of complexity (26) and adding the one to the result (28).

5- A blockchain security method according to Claim 4, wherein in case of a sliding nonce calculation method (18) is selected for finding a number sequence consisting of zeros (14), nonce processing steps (36) are performed in the total number of nonce numbers (34) comprising the step of finding the hash number (44) containing the number sequence consisting of zeros found during a nonce processing step (36) as a hash number (44) by sliding the number sequence consisting of zeros desired to be found in the next processing step (36) by sliding one number to the right (46). 6- A blockchain security method according to Claim 3, wherein if a skipping nonce calculation method (20) is selected for finding a number sequence (14) consisting of zeroes, while the total number of nonces used in the calculation (34) the number of hash lengths (22) divided by the number of complexity degrees (24); if the result is a decimal number, complete it to the next natural number (32); if it is not a decimal number keeping the same natural number.

7- A blockchain security method according to Claim 6, comprising the steps of in a skipping nonce calculation method (20) for finding a number sequence (14) consisting of zeroes, the nonce processing step (36) is performed on the total number of nonce numbers (34); a hash number is obtained by sliding the hash number (44) containing the number sequence consisting of zeros found during a nonce processing step (36) to the right by the number of the number of zeros (14) desired to be found in the next processing step (36) by sliding it to the right by the number of complexity degrees (48).

8- A blockchain security method according to Claim 3, wherein if a sliding nonce calculation method (18) is selected to find a certain number sequence (16), the total number of nonce (34) used is calculated; subtracting the hash length number (22) of the string of numbers from the number of degrees of complexity (24); adding the number 1 to the result (28).

9- A blockchain security method according to Claim 8, wherein if a sliding nonce calculation method (18) is selected to find a certain number sequence (16), the hash number (44) is obtained by sliding a certain number sequence desired to be found in the subsequent processing step (36) while nonce processing steps (36) are performed in the total number of nonce (34) numbers wherein the hash number (44) obtained by finding a certain number sequence (16) found during a nonce processing step (36).

10- A blockchain security method according to Claim 3, comprising the steps of in the case of selecting a skipping nonce calculation method (20) for finding a certain number sequence (16), the total number of nonce (34) used in the calculation; dividing (30) the hash length number (22) of the string of numbers by the number (24) of the degree of complexity; if the result is a decimal number, complete it to the next natural number (32); if it is not a decimal number, keeping the same natural number.

11-A blockchain security method according to claim 10, comprising the steps of in a skipping nonce calculation method (20) for finding a certain number sequence (16), while nonce processing steps (36) is performed in the total number of nonce (34) numbers a hash number (44), which includes finding a certain number sequence (16) found during the hash number (44) is skip to the right by complexity degree of the number sequence (16) to be founded during a nonce processing step (36).

12- A blockchain security method according to any of the preceding claims, comprising the steps of generating a hash number (44) in each transaction step of the nonce transaction steps (36); generating a nonce number (52) for each transaction that indicates how many transactions each hash number (44) is found and the writing of each nonce number (54) side by side in a result list (58).

13- A blockchain encryption method according to Claim 12, wherein colons or squares are used as separators (60). 14- A block chain encryption method according to any of the preceding claims, wherein transactions are processed via an electronic device (70).