BASIC CRYPTO

PRIMITIVES
STRUCTURE OF
BLOCK
SIGNIFICANT ELEMENTS OF A
BLOCK
 Block Height –
 It’s the sequence number of the block in the chain of blocks. Block Height: 1 is the genesis block
(first block in the network).
 Block Size –
 It’s a 4-bytes or 32-bit field that contains the size of the block. It adds size in Bytes. Ex – Block Size:
216 Bytes.
 Block Reward –
 This field contains the amount rewarded to the miner for adding a block of transactions.
 Tx Count –
 The transaction counter shows the number of transactions contained by the block. The field has a
maximum size of 9 bytes.
 Block Header –
 The Block header is an 80-Byte field that contains the metadata – the data about the block.
 Let’s briefly discuss the 6 components of the Block Header.

1. Time – It’s the digitally recorded moment of time when the block has been mined. It is used to validate
the transactions.
2. Version – It’s a 4-bytes field representing the version number of the protocol used. Usually, for bitcoin,
it’s ‘0x1’.
3. PreviousBlock Hash – It’s a 32-bytes field that contains a 256-bits hash (created by
SHA-256 cryptographic hashing) of the previous block. This helps to create a linear chain of blocks.
4. Bits – It’s a 4-bytes field that tells the complexity to add the block. It’s also known as “difficulty bits.”
According to PoW, the block hash should be less than the difficulty level.
5. Nonce – It’s a 4-bytes field that contains a 32-bit number. These are the only changeable element in a
block of transactions. In PoW, miners alter nonce until they find the right block hash.
6. Merkle Root – A 32-bytes field containing a 256-bit root hash. It’s constructed hierarchically combining
hashes of the individual transactions in a block.
TRANSACTIONS

 It’s a variable-size field that includes the list of all transactions contained in the block.
 FYI, each bitcoin block contains about 2000 transactions. The size of each block is approx
1MB. The size and number of transactions in a block vary in blockchains. It’s decided based
on network congestion and communication overhead.
 Let’s see what an actual bitcoin block looks like. This image contains a block summary of a
transaction.
MERKLE TREE
 Merkle tree is a data structure used to encrypt transactions efficiently and securely. Its made
up of the hashes of various data blocks of transactions. In short, it acts as a summary of
transactions for a block in a blockchain network.
 The structure of a Merkle Tree is a hierarchical way to represent hashes of the transactions.
• Merkle Root (or Root Hash): Top node of the tree
• Non-Leaf Nodes: Child hash nodes of transactions in between
• Leaf Nodes: Child nodes or Transactions nodes
HOW DOES MERKLE TREE WORK?

 Merkle tree uses the concept of cryptographic hash functions and public-key cryptography to
encrypt and verify the transactions among all the nodes in the network.

 Merkle tree is made up of hashing pairs of nodes repeatedly hashed until only one hash
remains called the Root Hash or Merkle Root. It is built from the bottom using transaction IDs
which are hashes of the individual transactions. It uses cryptographic hash functions to create
digest or hash of the transactions.

 In the Merkle tree structure, each non-leaf node is a hash of its previous hash. And every leaf
node is the hash of transactional data of each block.
Following are the steps:
1. Each transaction in a block is converted into a hash individually using cryptographic hash
functions like SHA-256.
2. Hierarchical hashing takes place, creating hashes of hashed transactions using hash functions.
3. The hashing goes on until we get a Root Hash or Merkle Root.

 A Merkle tree combines all transactions in a block and generates a digital fingerprint of the
entire set of operations. It allows the network participant to verify whether the transaction got
included in the block or not.
 The Merkle root ensures that data blocks sent through a peer-to-peer network are secure,
undamaged, and unaltered. Overall, it’s a method to confirm that all transactions in the Merkle
tree got added and verified.
HOW IS MERKLE
TREE USEFUL IN
BLOCKCHAIN?
 Blockchain, as the name suggests, is a
chain of blocks. Each block contains a
set of data or components such as
Block hash, previous block hash,
nonce, difficulty, and many more in
the block header. One of which is
Merkle root.
 Merkle root is a kind of summary of
all the transactions in a block. We’ll
see that in the data integrity of the
Merkle tree. Using Merkle root, the
network participants can verify the
transactions have not been tampered
with.
 The diagram can clarify the chain image in
your head.
 Bitcoin uses the Merkle tree method to
keep transaction blocks integrated.
AN EXAMPLE OF
DATA INTEGRITY
USING MERKLE TREE
NOW, COMING TO THE MERKLE TREE ENCRYPTION THE
INFORMATION VS NORMAL ENCRYPTION OF INFORMATION.
WHAT IF 1 APPLE GOT BITTEN BY SOMEONE. HOW
WILL IT AFFECT THE HASHES?
HOW CAN YOU VERIFY THAT THE
DATA CHUNK GOT CORRUPTED?
BENEFITS OF MERKLE TREE
Following are the benefits of using the Merkle tree:
• Help to validate the integrity of data or transactions.
• It consumes less disk space in comparison to any other hash tree.
• It can be divided and sub-divided to verify the information.
• Provides an efficient and faster way to arrange the data.
USE CASES OF MERKLE
TREE
Following are the use cases of Merkle tree other than blockchain:
• Git, a version control project-handling software, uses Merkle tree for its repository structure
for programmers worldwide.
• Merkle tree is used by the certification authority to create verifiable certificates.
• Interplanetary File System (IPFS) is an open-source, peer-to-peer distributed protocol that
uses the Merkle tree for file structure.
• Its used for data replication in No-SQL distributed databases like Amazon DynamoDB.
CRYPTOGRAPHY
 Cryptography is a method of using advanced mathematical principles in
storing and transmitting data in a particular form so that only those whom it is
intended can read and process it. Encryption is a key concept in cryptography
– It is a process whereby a message is encoded in a format that cannot be read
or understood by an eavesdropper. The technique is old and was first used by
Caesar to encrypt his messages using Caesar cipher. A plain text from a user
can be encrypted to a ciphertext, then send through a communication channel
and no eavesdropper can interfere with the plain text. When it reaches the
receiver end, the ciphertext is decrypted to the original plain text.
 Principle:- It is based on substitution and transposition
CRYPTOGRAPHY TERMS

 Plaintext: This is the original intelligible message or data that is fed into the algorithm as
input.
 Encryption algorithm: The encryption algorithm performs various substitutions and
transformations on the plaintext.
 Secret key: The secret key is also input to the encryption algorithm. The key is a value
independent of the plaintext and of the algorithm. The algorithm will produce a different
output depending on the specific key being used at the time. The exact substitutions and
transformations performed by the algorithm depend on the key.
 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and
the secret key. For a given message, two different keys will produce two different ciphertexts.
The ciphertext is an apparently random stream of data and, as it stands, is unintelligible.
 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the
ciphertext and the secret key and produces the original plaintext.
 This is the simplest kind of encryption that involves only one secret key to cipher and decipher
information. Symmetric encryption is an old and best-known technique. It uses a secret key
that can either be a number, a word or a string of random letters. It is a blended with the plain
text of a message to change the content in a particular way. The sender and the recipient
should know the secret key that is used to encrypt and decrypt all the messages. Blowfish,
AES, RC4, DES, RC5, and RC6 are examples of symmetric encryption. The most widely used
symmetric algorithm is AES-128, AES-192, and AES-256.
 The main disadvantage of the symmetric key encryption is that all parties involved have to
exchange the key used to encrypt the data before they can decrypt it.
PROS AND CONS OF SYMMETRIC
ENCRYPTION
Pros
• Faster: Since it’s using a single key for encryption and decryption, it’s faster to execute.
• Identity verification: It uses password authentication as a security purpose to prove the
receiver’s identity.
• Easy to execute & manage: Users have only one key for encryption and decryption so it’s
easy to execute and manage.
Cons
• The chances of sharing encryption keys securely are less; it is difficult and challenging to
share keys in Symmetric Encryption.
• Symmetric is not that scalable, as it’s not suitable for various users.
 Asymmetric encryption is also known as public key cryptography, which is a relatively new method,
compared to symmetric encryption. Asymmetric encryption uses two keys to encrypt a plain text.
Secret keys are exchanged over the Internet or a large network. It ensures that malicious persons do
not misuse the keys. It is important to note that anyone with a secret key can decrypt the message and
this is why asymmetric encryption uses two related keys to boosting security. A public key is made
freely available to anyone who might want to send you a message. The second private key is kept a
secret so that you can only know.
 A message that is encrypted using a public key can only be decrypted using a private key, while also,
a message encrypted using a private key can be decrypted using a public key. Security of the public
key is not required because it is publicly available and can be passed over the internet. Asymmetric
key has a far better power in ensuring the security of information transmitted during communication.
 Asymmetric encryption is mostly used in day-to-day communication channels, especially over the
Internet. Popular asymmetric key encryption algorithm includes EIGamal,
RSA, Elliptic curve techniques, PKCS.
PROS AND CONS OF ASYMMETRIC
ENCRYPTION

Pros
• Asymmetric Encryption has two keys, one public and one private, so there’s no problem with
distributing keys.
• Again, with a pair of keys, it is not difficult to communicate with multiple parties and that’s
how it is more scalable in large networks.
Cons
• Performance: Asymmetric Encryption is slower in performance compared to Symmetric
Encryption.
• Hard to understand and execute: Asymmetric Encryption is not that easy to implement and
manage due to its large key sizes.
SYMMETRIC V/S ASYMMETRIC ENCRYPTION

Symmetric Key Encryption Asymmetric Key Encryption

It only requires a single key for both encryption and decryption.
The size of cipher text is the same or smaller than the original plain text.
The encryption process is very fast.
It is used when a large amount of data is required to transfer.
It only provides confidentiality.
The length of key used is 128 or 256 bits
In symmetric key encryption, resource utilization is low as compared to
asymmetric key encryption.
It is efficient as it is used for handling large amount of data.
Security is less as only one key is used for both encryption and decryption
purpose.
The Mathematical Representation is as follows-
P = D (K, E(K, P))
where K –> encryption and decryption key
P –> plain text
D –> Decryption
E(K, P) –> Encryption of plain text using K
Examples: 3DES, AES, DES and RC4
It requires two keys, a public key and a private key, one to encrypt and the other
one to decrypt.
The size of cipher text is the same or larger than the original plain text.
The encryption process is slow.
It is used to transfer small amounts of data.
It provides confidentiality, authenticity, and non-repudiation.
The length of key used is 2048 or higher
In asymmetric key encryption, resource utilization is high.
It is comparatively less efficient as it can handle a small amount of data.
It is more secure as two keys are used here- one for encryption and the other for
decryption.
The Mathematical Representation is as follows-
P = D(Kd, E (Ke,P))
where Ke –> encryption key
Kd –> decryption key
D –> Decryption
E(Ke, P) –> Encryption of plain text using encryption key Ke. P –> plain text
Examples: Diffie-Hellman, ECC, El Gamal, DSA and RSA
PUBLIC-KEY CRYPTOSYSTEM
 Encryption/decryption: The sender encrypts a message with the recipient’s
public key, and the recipient decrypts the message with the recipient’s private
key.
 Digital signature: The sender “signs” a message with its private key. Signing is
achieved by a cryptographic algorithm applied to the message or to a small
block of data that is a function of the message.
 Key exchange: Two sides cooperate to exchange a session key, which is a
secret key for symmetric encryption generated for use for a particular
transaction (or session) and valid for a short period of time.
HASH FUNCTION
 A hash function H accepts a
variable-length block of data
M as input and produces a
fixed-size hash value h =
H(M).
The kind of hash function
needed for security
applications is referred to as
acryptographic hash function.
USE OF HASH FUNCTION
 The message plus concatenated hash code is encrypted using symmetric encryption. Because
only A and B share the secret key, the message must have come from A and has not been
altered. The hash code provides the structure or redundancy required to achieve authentication.
Because encryption is applied to the entire message plus hash code, confidentiality is also
provided.
 Only the hash code is encrypted, using symmetric encryption. This reduces the processing
burden for those applications that do not require confidentiality.
 It is possible to use a hash function but no encryption for message authentication. The
technique assumes that the two communicating parties share a common secret value S. A
computes the hash value over the concatenation of M and S and appends the resulting hash
value to M. Because B possesses S, it can recompute the hash value to verify. Because the
secret value itself is not sent, an opponent cannot modify an intercepted message and cannot
generate a false message.
 Confidentiality can be added to the approach of method (c) by encrypting the entire message
plus the hash code.
 Another important application, which is similar to the message authentication application, is
the digital signature.
DIGITAL SIGNATURE
 We have been using handwritten signatures to authenticate handwritten or typed messages in
the physical world for a long time. Their main use is to bind the signatory with a particular
message. Digital Signature accomplishes the same thing with digital messages. The signatory,
a person or an entity, is bound to digital data. This binding is verifiable by the receiver or a
third party, if necessary.
 Digital Signature in Cryptography is a value calculated from the data along with a secret key
that only the signer is aware of. The receiver needs to be assured that the message belongs to
the sender. This is crucial in businesses as the chances of disputes over data exchange are high.
 There are three algorithms at work in Digital Signatures. They are as follows:
 Key Generation Algorithms
 Signing Algorithms
 Signature Verification Algorithms
PROCESS
IMPORTANCE OF DIGITAL SIGNATURE

• Message authentication − When the verifier validates the digital

signature using public key of a sender, he is assured that signature has
been created only by sender who possess the corresponding secret private
key and no one else.
• Data Integrity − In case an attacker has access to the data and modifies
it, the digital signature verification at receiver end fails. The hash of
modified data and the output provided by the verification algorithm will
not match. Hence, receiver can safely deny the message assuming that
data integrity has been breached.
• Non-repudiation − Since it is assumed that only the signer has the
knowledge of the signature key, he can only create unique signature on a
given data. Thus the receiver can present data and the digital signature to
a third party as evidence if any dispute arises in the future.
POPULAR HASH FUNCTIONS

 Message Digest (MD)

MD5 was most popular and widely used hash function for quite some years.

• The MD family comprises of hash functions MD2, MD4, MD5 and MD6. It
was adopted as Internet Standard RFC 1321. It is a 128-bit hash function.
• MD5 digests have been widely used in the software world to provide
assurance about integrity of transferred file. For example, file servers often
provide a pre-computed MD5 checksum for the files, so that a user can
compare the checksum of the downloaded file to it.
• In 2004, collisions were found in MD5. An analytical attack was reported to be
successful only in an hour by using computer cluster. This collision attack
resulted in compromised MD5 and hence it is no longer recommended for use.
 Secure Hash Function (SHA)

Family of SHA comprise of four SHA algorithms; SHA-0, SHA-1, SHA-2, and SHA-3. Though from
same family, there are structurally different.
• The original version is SHA-0, a 160-bit hash function, was published by the National Institute of
Standards and Technology (NIST) in 1993. It had few weaknesses and did not become very popular.
Later in 1995, SHA-1 was designed to correct alleged weaknesses of SHA-0.
• SHA-1 is the most widely used of the existing SHA hash functions. It is employed in several widely
used applications and protocols including Secure Socket Layer (SSL) security.
• In 2005, a method was found for uncovering collisions for SHA-1 within practical time frame making
long-term employability of SHA-1 doubtful.
• SHA-2 family has four further SHA variants, SHA-224, SHA-256, SHA-384, and SHA-512 depending
up on number of bits in their hash value. No successful attacks have yet been reported on SHA-2 hash
function.
• Though SHA-2 is a strong hash function. Though significantly different, its basic design is still follows
design of SHA-1. Hence, NIST called for new competitive hash function designs.
• In October 2012, the NIST chose the Keccak algorithm as the new SHA-3 standard. Keccak offers many
benefits, such as efficient performance and good resistance for attacks.
RIPEMD
The RIPEMD is an acronym for RACE Integrity Primitives Evaluation Message
Digest. This set of hash functions was designed by open research community
and generally known as a family of European hash functions.
• The set includes RIPEMD, RIPEMD-128, and RIPEMD-160. There also exist
256, and 320-bit versions of this algorithm.
• Original RIPEMD (128 bit) is based upon the design principles used in MD4
and found to provide questionable security. RIPEMD 128-bit version came as
a quick fix replacement to overcome vulnerabilities on the original RIPEMD.
• RIPEMD-160 is an improved version and the most widely used version in the
family. The 256 and 320-bit versions reduce the chance of accidental collision,
but do not have higher levels of security as compared to RIPEMD-128 and
RIPEMD-160 respectively.
Whirlpool
This is a 512-bit hash function.
• It is derived from the modified version of Advanced Encryption
Standard (AES). One of the designer was Vincent Rijmen, a co-
creator of the AES.
• Three
versions of Whirlpool have been released; namely
WHIRLPOOL-0, WHIRLPOOL-T, and WHIRLPOOL.
 APPLICATIONS OF HASH FUNCTIONS
Password Storage
Hash functions provide protection to password
storage.
• Instead of storing password in clear, mostly all
logon processes store the hash values of
passwords in the file.
• The Password file consists of a table of pairs
which are in the form (user id, h(P)).
• An intruder can only see the hashes of
passwords, even if he accessed the password.
He can neither logon using hash nor can he
derive the password from hash value since
hash function possesses the property of pre-
image resistance.
 Data Integrity Check
 Data integrity check is a most common application of the hash functions. It is used to generate
the checksums on data files. This application provides assurance to the user about correctness
of the data.
 The integrity check helps the user to detect any changes made to original file. It however, does
not provide any assurance about originality. The attacker, instead of modifying file data, can
change the entire file and compute all together new hash and send to the receiver. This
integrity check application is useful only if the user is sure about the originality of file.
MINING STRATEGY
A peer-to-peer computer process, Blockchain mining is used to secure and

verify bitcoin transactions. Mining involves Blockchain miners who add
bitcoin transaction data to Bitcoin’s global public ledger of past transactions.
In the ledgers, blocks are secured by Blockchain miners and are connected to
each other forming a chain.
 When we talk in-depth, as opposed to traditional financial services systems,
Bitcoins have no central clearinghouse. Bitcoin transactions are generally
verified in decentralized clearing systems wherein people contribute
computing resources to verify the same.
 This process of verifying transactions is called mining. It is probably referred
to as mining as it is analogous to mining of commodities like gold—mining
gold requires a lot of effort and resources, but then there is a limited supply of
gold; hence, the amount of gold that is mined every year remains roughly the
same.
 In the same manner, a lot of computing power is consumed in the
process of mining bitcoins. The number of bitcoins that are generated
from mining dwindles over time. In the words of Satoshi Nakamoto,
there is only a limited supply of bitcoins. Only 21 million bitcoins
will ever be created.
 At its core, the term ‘Blockchain mining’ is used to describe the
process of adding transaction records to the bitcoin blockchain. This
process of adding blocks to the Blockchain is how transactions are
processed and how money moves around securely on Bitcoins.
 This process of Blockchain mining is performed by a community of
people around the world called ‘Blockchain miners.’
 Anyone can apply to become a Blockchain miner. These Blockchain
miners install and run a special Blockchain mining software that
enables their computers to communicate securely with one another.
 Once a computer installs the software, joins the network, and begins mining bitcoins, it
becomes what is called a ‘node.’ Together, all these nodes communicate with one another and
process transactions to add new blocks to the blockchain which is commonly known as the
bitcoin network.
 This bitcoin network runs throughout the day. It processes equivalent to millions of dollars in
bitcoin transactions and has never been hacked or experienced downtime since its launch in
2009.
TYPES OF MINING
 The process of mining can get really complex and a regular desktop or PC cannot cut it.
Hence, it requires a unique set of hardware and software that works well for the user. It helps
to have a custom set specific to mining certain blocks.
The mining process undertaking can be divided into three categories:
1. Individual Mining
2. Pool Mining
3. Cloud Mining
INDIVIDUAL MINING
 When mining is done by an individual, user registration as a miner
is necessary. As soon as a transaction takes place, a mathematical
problem is given to all the single users in the blockchain network to
solve. The first one to solve it gets rewarded.
 Once the solution is found, all the other miners in the blockchain
network will validate the decrypted value and then add it to the
blockchain. Thus, verifying the transaction.
POOL MINING

 In pool mining, a group of users works together to approve

the transaction. Sometimes, the complexity of the data
encrypted in the blocks makes it difficult for a user to
decrypt the encoded data alone. So, a group of miners
works as a team to solve it. After the validation of the
result, the reward is then split between all users.
CLOUD MINING
 Cloud mining eliminates the need for computer hardware and
software. It’s a hassle-free method to extract blocks. With cloud
mining, handling all the machinery, order timings, or selling profits
is no longer a constant worry.
 While it is hassle-free, it has its own set of disadvantages. The
operational functionality is limited with the limitations on bitcoin
hashing in blockchain. The operational expenses increase as the
reward profits are low. Software upgrades are restricted and so is
the verification process.
HOW CAN YOU MINE
BITCOINS?
 You can buy and trade for bitcoins, or you can mine them. For
mining bitcoins, users are rewarded in bitcoins. This mechanism
forms the pivot around which the bitcoin economy revolves.
 While the cost and difficulty of mining bitcoins individually
continue to increase, several cloud-based mining services have
gradually emerged. These services allow individual users to lease
the processing power of mining equipment and mine bitcoins
remotely. However, you can mine bitcoins in person too.
MINING BITCOINS IN CLOUD
 Obtain a bitcoin wallet: Bitcoins are stored in digital wallets in an encrypted
manner. This will keep your bitcoins safe.
 Secure the wallet: Since there is no ownership of bitcoins, anyone who gains
access to your blockchain wallet can use it without any restriction. So, enable
two-factor authentication and store the wallet on a computer that does not have
access to the Internet or store it on an external device.
 Choose a cloud mining service provider: Cloud mining service providers
allow users to rent processing or hashing power to mine bitcoins remotely.
Popular cloud mining service providers are Genesis Mining and HashFlare.
 Choose a cloud mining package: To choose a package, you will need to
decide on how much you are willing to pay and keep your eyes open to the
hashing power the package will offer. Cloud mining companies will mostly
envisage the Return on Investment (ROI) based on the current market value of
Bitcoins.
 Pick a mining pool: This is the best shot you can get to earn bitcoins easily.
There are many mining pools that charge a mere 2 percent of your total
earnings. Over here, you will have to create workers which are basically
subaccounts that can be used to track your contributions to the pool.
 Put your earnings in your own secure wallet: Whenever you witness an
ROI, simply withdraw your earnings and put them in your own secure wallet.
MINING BITCOINS ON YOUR
OWN
Purchase custom mining hardware: You need to purchase an Application-

specific Integrated Circuit (ASIC) miner to mine bitcoins. While purchasing an
ASIC Blockchain miner, you should consider its efficacy in hashing power and
take note of its pricing policies.
 Purchase a power supply: Blockchain miners consume a lot of power. So, get
a dependable power supply that is compatible with the ASIC miner that you
purchase.
 Obtain a bitcoin wallet: Bitcoins are stored in digital wallets in an encrypted
manner. This will keep your bitcoins safe.
 Secure the wallet: Since there is no ownership on bitcoins, anyone who gains
access to your wallet can use it without any restriction. So, enable two-factor
authentication and store the wallet on a computer that does not have access to
the Internet or store it in an external device.
 Pick a mining pool: This is the best shot you can get to earn bitcoins easily.
There are many mining pools that charge a mere 2 percent of your total earnings.
Over here, you will have to create workers which are basically subaccounts that
can be used to track your contributions to the pool.
 Connect the power supply to the ASIC Blockchain miner.
 Connect the ASIC Blockchain miner to your router.
 Boot up your ASIC miner.
 Enter your router’s IP address in a web browser.
 Find ‘connected devices in the router miner page.
 Find your ASIC miner and click on it to display the device information.
 Copy and paste the IP address of your ASIC miner into your web browser.
 Log in to the ASIC miner with the default username and password that are ‘Root’ and ‘Root.’
 Select ‘Miner Configuration’ to set up the miner according to your preferences.
 Enter the URL, username, and password for your mining pool on the Miner Configuration
page of the ASIC Miner.
 Click ‘Save and Apply’ to save your credentials for future use.
 Start mining and in periodic intervals check your profitability.
 Put your earnings in your own secure wallet: Whenever you witness an ROI, simply withdraw
your earnings and put them in your own secure wallet.
USES OF BLOCKCHAIN
MINING
1. Validating Transactions
Bitcoin transactions take place in huge figures every day. Cryptocurrencies
function without a central administrator and the insecurity can be substantial with
the transactions that transpire. So, what is the authentication method with such
cryptocurrencies? With each transaction, new blocks are added to the blockchain
in the network and the validation lies in the mining results from the blockchain
miners.
2. Confirming Transactions
Miners work the blockchain mining process to confirm whether the transaction is
authentic or not. All confirmed transactions are then included in the blockchain.
3. Securing Network
To secure the transaction network, bitcoin miners work together. With more users
mining the blockchain, blockchain network security increases. Network security
ensures that there are no fraudulent activities happening with cryptocurrencies.