2023 International Conference on Computer Communication and Informatics (ICCCI), Jan.

23 – 25, 2023, Coimbatore, INDIA

Comparison of Cryptography algorithms in

Blockchain
2023 International Conference on Computer Communication and Informatics (ICCCI) | 979-8-3503-4821-7/23/$31.00 ©2023 IEEE | DOI: 10.1109/ICCCI56745.2023.10128372

Amu.D Dr.Santhi Baskaran

Research Scholar Professor
Dept of Computer Science and Engineering Dept of Information Technology
Puducherry Technological University Puducherry Technological University
Puducherry Puducherry
amud56@pec.edu santhibaskaran@pec.edu

Abstract- Various algorithms have been employed to enhance the cryptography. It aids in safeguarding various blockchain
performance of blockchain. Successful algorithms have been network transactions. It makes sure that only those people may
developed with the potential to use blockchain technology. In this acquire, read, and handle the transaction that is intended for
study, we analyze and explain a list of significant blockchain- them.
based algorithms, including Rivest Shamir Adleman, Advanced Terminologies
Encryption Standard, Data Encryption Standard, Digital Encryption: It transforms regular text into a random bit
Signature, and Elliptic Curve Cryptography. In this article, we sequence.
examine the Quantum Teleportation security algorithm for
Key: To obtain the information of the cryptographic
Blockchain Technology. This technique is based on encryption to
provide well security.Quantum teleportation compares favorably algorithm, some information is needed.
to RSA, DES, AES, and ECC. This survey document serves as a Decryption: A random bit sequence is converted to plaintext
valuable guide for upcoming research issues in Blockchain in the opposite of encryption.
Technology. Cipher: The formula, or cryptographic algorithm that is
utilized to transform plaintext into ciphertext (Random
Keywords- Blockchain, Encryption, Cryptography algorithm. sequence of bits).
The following is the composition of the paper: The Categories
of Cryptography are covered in Section 2, and the Comparison
I. INTRODUCTION
of Cryptography Algorithms in Blockchain is covered in
Blockchain technology first appeared with the creation of
Section 3. Section 4: Outcome and suggested algorithm. The
Bitcoin by Satoshi Nakamoto in 2008, which was regarded as
text concludes with Section 5, which is followed by
the foundation of cryptocurrency. Since then, the technology
references.
has drawn a lot of organizational research on its potential
applications.[1] Advanced in conjunction with the digital II. CATEGORIES OF CRYPTOGRAPHY
currency Bitcoin, blockchain technology can offer secure
In essence, there are three major approaches to carrying out
communications, transparency, resiliency, and privacy of data.
cryptographic algorithms:
Blockchain functions as a distributed ledger based on a chain
of data blocks linked by hashes, allowing peers who may not A. Symmetric-key
always trust one another to share information and preventing • One key is utilized for this encryption method.
double-spending. [2] With the help of these properties,
blockchain has gained popularity in recent years, have already • The same shared key is utilized for both the
passed, and recommended as a crucial technology for a variety encryption and decryption processes.
of uses in smart health, measurement systems, logistics, e- • When employing a single common key, it
voting, and other fields. In algorithms of ECC, DS, AES, becomes difficult to safely transfer the key
DES, and RSA, which onethe most powerfulalgorithmin between the sender and the recipient.
quantum Teleportation. Data security using cryptography
• Another name for it is secret-key cryptography.
prevents illegal access. Cryptography is employed in the
blockchain to safeguard transactions between two nodes in a B. Aymmetric-key
blockchain network. As was already said, the two main ideas
• An encryption key and a decryption key, special
in a blockchain are cryptography and hashing. In a P2P
network, messages are encrypted using cryptography, and a as a public key and personal key, respectively,
blockchain's block information and link blocks are secured are used on this encryption technique
using hashing. Security of participants, transactions, and
precautions against double-spending are the main goals of

979-8-3503-4821-7/23/$31.00
Authorized ©2023
licensed use limited to: Universidad Peruana IEEEAplicadas (UPC). Downloaded on June 17,2023 at 07:21:50 UTC from IEEE Xplore. Restrictions apply.
de Ciencias
 2023 International Conference on Computer Communication and Informatics (ICCCI), Jan. 23 – 25, 2023, Coimbatore, INDIA

• The key pair generated by this technique consists calculates the hash h'i= H(Ri, Q'i) and converts to integer r'i
of a unique public key and a private key that are modulo m.. An Euler function of m φ(m), should consider the
both generated by the algorithm. integer r’i to be relatively prime. If not, Alice needs to add
padding to make r'i reasonably prime to φ(m). When it
• It also goes by the name of public-key happens, Alice discovers the r’imodule’s inverse, e’iφ(m). She
cryptography. then determines Y’i = Reii+1 (mod m). Due to the fact that e’i r’i
C. HashFunction = 1 (mod m) and (Ri+1)φ(m) = 1, now integrity check the results
in (Y’i)d’i = (Reii+1)r’i = Pi+1(mod m) (mod m).
• Keys are not used in it.
• Plaintext uses a cipher to create a hash value of a Padding
certain length Due to the fact that m = AB, that have φ(m) = (a- 1)(b- 1).
• It is inherently impossible to recover the If e'i cannot be divided by a safe prime (keep in mind that a
and b are safe primes, i.e., they are primes), then either (1) e'i
plaintext content from the ciphertext
is even or (2) e'i is odd but can be divided by a huge prime. As
. a result, our padding will be as follows. To the block Q’i, we'll
III. COMPARISONS OF CRYPTOGRAPHY ALGORITHM IN randomly add, say, 0 bits. Since it is assumed that the hash
BLOCKCHAIN function H passes all standardized statistical tests [7], Hash
could produce a bit string it translates to the odd integer e’i
This section compares various Cryptography algorithms used with the probability of 1/2; also, there is a very high likelihood
in blockchain technology that e’i will not be divisible by either a-1/2 or b-1/2. As a
result, after just a few of the forementioned padding efforts,
a) The concept behind the well-known RSA encryption we will obtain an integer e’i that is substantially prime to φ
technique [2] are what inspired the blockchain structure (m).
described. If there is another straightforward technique that
may be utilized in this situation to offer for the properties Public unchangeability:
mentioned: In the above paragraph title mentioned "Block structure," a
Public information: party wishing to alter the content of one block should
• a big integer m is made up of two enormous effectively need to rectify the RSA issue by recovering Y from
prime numbers m, Yd (mod m), and e, where e is mutually prime to φ(m). It
• a hashing algorithm H, such as SHA-256. regards mathematically impractical for a suitable m and a
random e, where 0<e< m.
(Again, we underline that our approach may be
applied to any sensible hash function; as such,
b) One of the most well-liked encryption algorithms is
the reader may substitute his or her preferred AES, which is used for encryption.[4]. For encryption and
hash function for SHA-256 here.) decryption, AES uses a proprietary structure. Three distinct
Private information: key sizes, including AES 128, 192, and 256 bits, can be used
• M = AB rime factors. These a and b must be with AES, and every one of these ciphers has a 128-bit block
secure primes, much like in contemporary RSA size. The key length determines how many rounds there will
implementations. When p is another prime, a be The key length determines number of round. The
encryption algorithm and blockchain technology concept are
safe prime has the formula 2p + 1.
used to protect data file when moving it from a server to a
client.The data in the requested text file is first encrypted
Block organization a prefix Ri, the information itself Qi
using the AES encryption technique. Second, the hash
and a suffix Yi, a nonzero number modulo m, are all
function receives the encrypted data file and applies the SHA
included in each block Xi. We also don't want Yi to have
256 hashing method to get a hashing code. The encrypted data
order 2, thus Y2 i should equal 1. (mod m). Since a and b
file is subsequently provided to the client. The encode file is
are safe primes, this will guarantee that Yi does not have
sent to the server, which then verify the hashing code to
a tiny order, hence, if an element of the multiplicative
ensure its validity. If the hash code was identical, it means no
group G*AB has an order other than 2, it is very large.
hackers or intruders have access to or have altered the data
Therefore, whomever creates a block Xi chooses Yi
file. The client uses the same key that was used for encryption
arbitrarily from a range of integers between 1 and m-1,
to decrypt the data file after the authentication verification.
and then determines whether Y2i= 1. (mod m). The
We have employed the blockchain technology concept to
random selection of Yi is repeated if Y2i = 1 (mod m).
assure the security of data files moved across smaller
Once a suitable Xi has been chosen, he is created by
networks. With our approach, we intend to secure the
concatenating Ri and Qi, producing hi = H(Ri, Qi), which
movement of data files across a more limited network.
is then transformed into an integer di modulo n. Then Ri+1
= (Yi) di is used to calculate the prefix Ri+1 of the c) In Elliptic-curve Cryptography (ECC)-based
following block (mod m). Encoded and Decoded with ECDH, We employed an
asymmetric encoded system based on ECC [5]. The trapdoor
Privateness of redaction: function used by ECC has a one-way property that makes it
If Alice, the central figure and owner of the private key, simpler to compute X →Y but impossible to reverse Y→X.
need to change information in block Xi as Qi to Q'i while The Elliptic Curve Diffie-Hellman (ECDH) key replaces was
leaving the other blocks alone, she can do so. Alice then used in our suggested method to generate a shared private key

Authorized licensed use limited to: Universidad Peruana de Ciencias Aplicadas (UPC). Downloaded on June 17,2023 at 07:21:50 UTC from IEEE Xplore. Restrictions apply.
 2023 International Conference on Computer Communication and Informatics (ICCCI), Jan. 23 – 25, 2023, Coimbatore, INDIA

for Electric Medical Record encoded and decoded. Both length and a 56-bit key length and is based on a balanced
standing and transient keys are generated by it. Whereas Feistel network. The fundamental problem with the DES
saving and accessing an EMR on the cloud, an EMR algorithm is the tiny key length. 3DES improves DES by using
proprietor utilizes permanent keys to encode and decode the 168 key lengths. The algorithm DES is regarded as being
document. Assume we have a generator point G for a well-designed and efficient. However, many cryptographers
cryptographic elliptic curve over a finite field, and indicate the felt that the size of its key was too little soon after it was
patient's permanent public and private keys, RSpub and RSpriv, published. Currently, brute force attacks can reasonably
correspondingly. The EMR owner generates permanent keys quickly and cheaply break the 56-bit long key. Attacking DES
in the manner described below. is quite simple if you have access to some plaintext. The
• Generate RSpriv at random; attacker has access to all 256 key combinations. He searches
for a key that, when applied to a block of known plaintext that
• Produce RSpub = SKpriv*G.
has been encrypted, yields the same plaintext when decrypted.
When re-encoding and decoding EMR whereas distribution it In actual use, knowing two or three blocks of plaintext is
with another party, transient keys are employed. The set sufficient to ascertain whether the key under test, which is
access time () specified in the GAC throughout the settlement successful for those blocks, will also be successful for
among the EMR proprietor and EMR requester determines additional blocks. The likelihood that the discovered key is
how long these keys will last. The new transient public and flawed and only accurately transforms known plaintext blocks
private keys, designated as EKpub and EKpriv, are generated by is extremely unlikely.One of the most well-known and concise
the EMR owner. A similar ephemeral public and private key algorithms employed in Blockchain applications.
pair, ERpub and ERpriv, is generated by the EMR requester. In
order to re-encode and decode the EMR whereas sharing, both IV. PROPOSED ALGORITHMS
parties evaluate the transient shared secret key, or KES, and
exchange their public keys. For both entities, ephemeral keys
are generated as follows.
• EMR requester randomly creates← ERpriv;
• Produce EKpub = EKpriv* G.
• EMR requester produces ←ERprivat random
• Produce ERpub =ERpriv∗ G.
• Both parties exchange each other's respective ERpub
and EKpub.
• Determine KES = ERpub∗EKpriv = EKpub∗ERpriv.
Through the cryptographic capabilities of ECC, blockchain is
limited securely registered and retrieved.

d) Digital signatures,[6] which can aid in building trust

on the blockchain, are essentially cryptographic proof
methods. Trust withinside the blockchain device would
possibly suggest that it's far feasible to illustrate that the
conversation got here from a positive source, setting any
issues approximately hacking or different irregularities to rest.
Digital signatures can be thought of as the electronic Figure1. The simulated quantum teleportation model
equivalents of handwritten or embossed seals. They can,
however, provide improved security while lowering the
likelihood of impersonation or identity theft. Digital signatures One significant use of quantum entanglement is quantum
use mathematical connections to link two separate keys, which teleportation. [7, 9] To communicate an unidentified quantum
is a special precedent set by asymmetric cryptography. Keys country, one’s statistics is split among two portions: classical
include private and public keys. A digital signature system can statistics and quantum statistics. These portions are then
be implementing with a secure hash function. transmitted to a distant recipient through classical channel and
• Digital signatures guarantee that the message a quantum channel, accordingly. These two portions of statistics
permit for the long-distance transmission of a quantum
recipient gets is from the dispatcher who’s
country, which allows the receiver get better the authentic
claiming to have delivered the data. Non- quantum country that become meant to be communicated from
repudiation is the feature in question. the qubit of their possession. There are no barriers in the way
• Receivers are assured via digital signatures that of this quantum state's propagation, nor are there any
communications haven't undergone any restrictions on time or space. The preliminary qubit, which
alterations while in transit. Infrastructures are able remains withinside the sender's hands, has its nation destroyed
all through the Bell foundation of teleportation measurement.
to find better defenses against malicious
Therefore, the no-cloning theorem isn't always damaged
intermediaries or unintended changes as a result. through quantum teleportation. The velocity of quantum
teleportation isn't always quicker than the velocity of mild
e) DES was created by IBM and adopted as a standard
for encryption in 1977 [6]. The algorithm has a 64-bit block

Authorized licensed use limited to: Universidad Peruana de Ciencias Aplicadas (UPC). Downloaded on June 17,2023 at 07:21:50 UTC from IEEE Xplore. Restrictions apply.
 2023 International Conference on Computer Communication and Informatics (ICCCI), Jan. 23 – 25, 2023, Coimbatore, INDIA

when you consider that classical records ought to be while also slowing down the system and causing a high time
despatched all through the procedure. delay. In contrast, a "51% attack" permits attackers to dam
Then, we simply explain how quantum teleportation works. bills among a few or all customers and save you new
Assume that Bob is the recipient and Alice is the sender. The transactions from being showed if a band of miners owns
qubit of Alice that needs to be transferred is in the following better than 50% of the pc strength have to calculate network’s
condition: hash values.
| ϕ›N= q|0›N + r | 1›N = [ N, |q| 2 + |r| 2 = 1. --1 Blockchain consensus mechanism based on quantum
teleportation is fundamentally variety from the
aforementioned traditional blockchain consensus mechanism
She concurrently gets ready an EPR pair made up of qubits Q in that it uses only a little amount of processing power and
and R: only several quantum operators. The blockchain system's
|Φ +›QR = (|00›+|11›)QR ---2 quantum consensus process is succinctly described as follows:
The quantum channel is an entangled pair of qubits Q and R. Quantum consensus algorithms are sometimes called "lottery
Alice transmits qubit R to Bob while keeping qubit Q in her betting" algorithms. First, a transaction consumer creates a
possession. The three qubits' mixed state at this time is nonce F via quantum operations. It was private and
|Ψ›NQR = |ϕ›N⊗ |Φ+›QR = (q|0› + r|1›)N⊗√ 1 2 (|00› + |11›)QR comparable to the "winning numbers" withinside the
gambling. In miner then chooses the nonce F'. This
= 1/ 2 [|ψ −›NQ (−r|0› + q|1›)R + |ψ +›NQ(r|0› + q|1›)R + corresponds to the 'bet number' of a lottery bet (when a nonce
|Φ−›NQ(q|0› − r|1›)R+ |Φ+›NQ(q|0› + r|1›)R ] selected through a miner has already been selected through
any other the machine suggests this and forces the miner to
= 1 /2 |ψ −›NQ[-r/q]Q+ 1/ 2 |ψ +›NQ[r/q] R+ 1 /2 |Φ−›NQ[q/r]R+
pick out any other nonce). Lastly, the miner acquires claims
1/ 2 |Φ+›NQ[q/r] R ----3 and generates block information by quantum teleportation
Qubits N and Q are measured ona Bell basis by Alice, who when F' = F. The following are the specific steps of the
then notifies Bob of the results. Equation (3) predicts that quantum blockchain consensus method.
straight away following, Alice's measurements directly decay
Bob's qubit R to the equivalent state. Bob can then perform Initialization of the Protocol:
the matching quantum operation on qubit R to retrieve the First: Prepare the quantum channel. The O’ groups of EPR
state from it, which is identical to the state of qubit N when it pairs that Miner Alice prepares are depicted in Equation (2).
was first created. She sends qubit R to transaction user Bob and maintains qubit
Q.
Using quantum teleportation as a basis for consensus on
the blockchain: Second: Quantum channel security detection. The EPR pair
Users and miners have two fundamental functions in a can be expressed in bases RZ and RX, respectively, as
quantum blockchain system. Users transact using quantum indicated in Equation (2)
cash, and miners battle it out for mining rights, bookkeeping |Φ +›QR = 1 /√ 2 (|0Q0R› + |1Q1Ri) = 1/ √ 2 (| +Q+R› + | −Q −R›)
privileges, and the creation of the blockchain. ---4
In order to briefly outline the fundamental phases of the The protection of the quantum channel may be diagnosed in
traditional blockchain consensus mechanism, we will use the advance which will thwart an assault via way of means of
example of proof of work. intermediaries, a retransmission assault, or a size assault. Alice
• Nodes, or miners, keep an eye on the network's data selects (O'- O) qubits at random from a qubit R in her
records, and those that pass a simple authenticity possession, randomly measures these qubits in RZ or RX
check are ephemeral kept. premises and, via the classical channel, gives the indices of
• Nodes use their personal processing strength to finish these qubits in the series, the corresponding magnitude bases,
the vital hash calculations, attempt extraordinary and the corresponding magnitudes of Communicate the results
to Bob. Equation (4) states that in the absence of an attack,
nonces, and again the method till they discover a
suitable nonce. The term "mining" additionally Bob's qubit state collapses to the |+› state given Alice's
applies to this method. measurement |+› and given Alice's measurement |-› | -›
• Nodes produce block information (Block header + indicates that it must collapse into a state. If Alice's value is
Block body) after determining an acceptable nonce. |0›, Bob's qubit state should be collapse to |0› state.
• Nodes ship the freshly created block out to the out of The measuring findings are publicly as compared via way of
doors world. The block will be introduced in the means of Alice and Bob. If the measurements are consistent,
the channel is secured. Then resting O-groups in EPR pairs are
blockchain and the peak of the principle chain was
used as quantum channels. In fact, there are several ways to
raised with the aid of using one as soon as a further find the quantum channel [11]
node passes the verification. Then, the whole Third: Quantum key transfer. The secret key is shared by
community switches to the brand new block and the Alice and Bob (2N-bit). Other established quantum key
following mining cycle. distribution protocols, such as BB84 and BBM92, may be
These are the main drawbacks of blockchain's traditional used to implement the key distribution [10–12].
consensus mechanism. On the one hand, nodes use their
computer capacity during the "mining" process to test out Producing Nonce S
various nonces, wasting energy and computing resources

Authorized licensed use limited to: Universidad Peruana de Ciencias Aplicadas (UPC). Downloaded on June 17,2023 at 07:21:50 UTC from IEEE Xplore. Restrictions apply.
 2023 International Conference on Computer Communication and Informatics (ICCCI), Jan. 23 – 25, 2023, Coimbatore, INDIA

While the “lottery” actually determines the winning lottery If F' = F, the size final results ought to be one of the quantum
numbers, the results of quantum measurements determine the states | 0›,|+› because, in step with Alice's nonce F', she used
transaction user's nonce F. N qubits are prepared by state
transactional users. quantum teleportation to switch the state | 0›,|+› of the
statistics qubits series N Equation [5] to the qubits series R in
|ψ› = 1 √ 2 (| 0›+|1›)
Bob's possession. The measurement outcome is known if Bob
uses the appropriate measurement basis in accordance with
and degree an N-qubit collection with the idea RZ. The Equation (8), in which case he must acquire the eigenvector
following equation determines the binary variety illustration of
the dimension findings. Before figuring out which miner is a |0› (or |+›) of the relevant basis. Alice is deserted if the size
success in mining, the nonce F desires to be stored withinside end result is withinside of contrary state. It suggests that the
the strictest of confidence. nonce F' her selection isn't same to the nonce F. Otherwise,
the verification is successful, Alice is chosen, which indicates
0› → 0, |1› → 1
that she has discovered the user Bob's legal block. When a
miner finds a valid block, sends it over a peer-to-peer network
Mining Method Using Consensus Mechanism to other miners, and that block is confirmed by other miners,
Finding nonce F and using quantum methods to confirm that the miner has accounting rights in that block and derives from
F‘= F is known as mining. Nonce F is unable to provide the it Receive earnings (quantum currency)[14].
miners with any valuable information during the process. The
miner selects a nonce F' has mystery number after which Benefits of the Plan
makes use of quantum teleportation to examine F' and the Defending Against a 51% Attack
nonce F of a person of a quantum blockchain system. The Our system's layout makes use of quantum strategies like its
miner locates a legitimate block if the verification is size and teleportation instead of a hash feature just similar to
successful. The specific steps are as follows. conventional blockchain protocol, The latter ignores the
drawback of being impervious to attacks that consume more
First: Alice and Bob both possess secure numbers F' and F, than 51% of the network's processing power
Alice obtains knowledge about the secure number
F'={F'ii=1,2,--,N} through the order given below: A qubit .Low Power Requirement, Minimal latency, and High
sequence S can be formed. This law is explicit. Throughput
According to the rule, Alice creates information qubit Traditional blockchain structures require nodes to carry out
sequence M. complicated mathematical operations in a mining race, which
consumes a number of computing power.. As a result, it's will
if Fi = 0, take ϕ›N =|0› need lot of energy and computational resources, resulting in
if Fi = 1, take ϕ›N =|+› ---5 excessive energy use, low throughput, and lengthy delays. Our
method uses quantum measurements and teleportation
Second: According to Bell basis, Alice makes combine techniques to assess the mining success of miners. The avoids
measure in the qubit sequence S and Q. And the value final consuming a significant number of computational resources in
results became one of the 4 Bell states represented. These four mining race and results in extremely little energy use.
measurement results can be compressed into two standard Additionally, it saves computing resources because it avoids
informational units: many mathematically challenging calculations that are
necessary for mining competitions. The operation of quantum
gates and the transmission of classical information take up the
|Ψ−› → 00, |Ψ+› → 01, |Φ−› → 10, |Φ+› → 11 ---6 majority of the very short amount of time required for
quantum teleportation; the transfer of the quantum state
In order to communicate with Bob, Alice encrypts the 2N bits completed quickly. As a result, hypothetically, the throughput
of data from the size at the qubit collection S and Q with the was great and the little interruption.
key KQR that they both shared. She then sends Bob the data.
Table:1 Comparison of Cryptography Algorithm
Third: Bob decodes Alice's encoded information above with
the symmetric key KQR and then operates the equivalent ALGORITHM KEY BLOCK SPEED SECURITY
quantum gate with the equivalent qubit of the qubit sequence SIZE SIZE
R regarding to 'Pi'. Quantum gate that corresponds to the Pi RSA 128 256 Pretty Least Secure
correspondence rule is slow
DES 56 56 Slow Not Secure
Enough
00 → X, 01 → Y, 10 → M, 11 → N ----- 7
Fourth: After completing the quantum gate in question, Bob AES 128 128 fast Excellent
Security
evaluates every qubit in sequence R in order to its origin using
DS 80 650 pixels Better Non-Secure
its secure value F = Fi and the following rules. Speed
Bob chooses a qubit of the sequence R as the basis for ECC 224 nil fast secure
measurement according to the following rule:
As analyze the cryptography algorithm to provide the key size,
if Fi = 0, in basis RM
block size, speed, and Security level. In some cryptographic
if Fi = 1, in basis RY -----8
algorithms will be broken by quantum computers, particularly

Authorized licensed use limited to: Universidad Peruana de Ciencias Aplicadas (UPC). Downloaded on June 17,2023 at 07:21:50 UTC from IEEE Xplore. Restrictions apply.
 2023 International Conference on Computer Communication and Informatics (ICCCI), Jan. 23 – 25, 2023, Coimbatore, INDIA

public-key cryptosystems like RSA, ECC, etc. Teleportation [14] Ganesan A, Kumar Kombaiya A, “Predicting Malicious Node Behavior
in Wireless Network Using DSR Protocol and Network Metrics”,
will make it possible to send quantum information between International Journal Of Computer Communication And Informatics,
locations in the form of quantum states, creating a quantum volume- 4, issue- 1, 1-10, 2022
network. A quantum network has the benefit of allowing
information to be exchanged in complete secrecy.
Eavesdroppers are unable to intercept and read messages.
Quantum Teleportation has measured the qubits and consensus
mechanism to provide security in blockchain Technology.

V. CONCLUSION
The use of blockchain is widespread. Blockchain technology's
decentralized and peer-to-peer networks make it very safe.
Additionally, these surveyed papers go over blockchain's
many algorithms and limitless potential as well as how it may
be used in conjunction with other technologies like IoT to get
even greater outcomes. The adoption of blockchain is still up
for debate, but as more and more initiatives and studies show
that it offers the best possible solution to the majority of
contemporary technological problems, the likelihood that it
will be adopted by various mechanisms will grow. To find
new, safer, and more efficient ways to use blockchain, new
research is being conducted. It accomplishes low energy
consumption, high throughput, and minimal latency by using
less computer power, fixing the standard blockchain system's
weakness of being vulnerable to 51% attacks, and eliminating
that flaw. Additionally, it is significantly simpler to construct
than the previous quantum blockchain consensus process.

REFERENCES

[1] S Nakamoto, “Bitcoin: A peer-to-peer electronic cash system”, Tech.

Rep., 2008. [Online]. Available: https://bitco.in/pdf/bitcoin.pdf.
[2] R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital
signatures and public-key cryptosystems”, Commun. ACM 21 (1978),
pp. 120–126
[3] Secure Hash Standard (SHS) Available at
https://nvlpubs.nist.goc/nistpubs/FIPS/NIST.FIPS.180-4.pdf.
[4] Secure Hash Standard (SHS).Available at
https://nvlpubs.nist.goc/nistpubs/FIPS/NIST.FI PS.180-4.pdf.
[5] FaiqaMaqsood, Muhammad Ahmed, Muhammad Mumtaz Ali, Munam
Ali Shah, “Cryptography: A Comparative Analysis for Modern
Techniques”, (IJACSA) International Journal of Advanced Computer
Science and Applications, Vol. 8, No. 6, 2017.
[6] J. Lopez and R. Dahab, “An overview of elliptic curve cryptography,”
2000.
[7] N. F. PUB, “46-3. data encryption standard,” Federal Information
Processing Standards, National Bureau of Standards, US Department of
Commerce, 1977.
[8] Wen, X.; Chen, Y.” Quantum Signature and Its Application”; Aviation
Industry Press: Beijing, China, 2012; pp. 35–38.
[9] Fan, X.; Wen, X. “Improvement of data link layer algorithm based on
quantum teleportation”,Chin. J. Quantum Electron. 2015, 32, 466. 24.
[10] Dong, Y.; Peng, J. “Quantum channel authentication scheme via weak
cross-Kerr nonlinearity”, J. Quantum Optic. 2015, 21, 334–338.
[11] Zhou, Y.; Li, X.; Zhou, X. ‘Study on BB84-decoy-state quantum key
distribution with a heralded single photon source”, Chin. J. Quantum
Electron. 2010, 27, 565–572.
[12] Wu, Z.; Chen, G.; Yang, B. “Improve the performance of BBM92
quantum key distribution system”, Chin. J. Quantum Electron. 2009, 26,
560–564
[13] Mao, Q.; Zhao, S.; Wang, L.; Qian, C.; Chen, H. “Measurement-device-
independent quantum key distribution based on wavelength division
multiplexing technology”, Chin. J. Quantum Electron. 2017, 34, 46–53.

Authorized licensed use limited to: Universidad Peruana de Ciencias Aplicadas (UPC). Downloaded on June 17,2023 at 07:21:50 UTC from IEEE Xplore. Restrictions apply.