1

Quantum Computers - Impact on Encryption

Student Name

Course Name

January 9, 2021
 2

Abstract

This paper aims to clarify quantum computation's effects in current cryptography and

present the reader with simple post-quantum algorithms. The Post-Quantum Cryptography

section primarily contracts through numerous quantum key distribution strategies and

mathematical solutions such as BB84, multivariate-based encryption, Hash-based signatures, and

code-based cryptography. Some tend to call this 'death of public-key encryption' the next step in

the computer process. We claim that this is not the case and that certain mathematics fields can

construct 'quantum tolerant.' We offer a high-level analysis of the danger faced by quantum

computers with the examples of RSA and Short's algorithm. Still, we clarify why we suspect that

in the future, there is a possibility that some quantum algorithms will pose a threat to public-key

encryption schemes.

Keyword: quantum computation, symmetric and asymmetric, security, encryption

 3

Table of Contents

Abstract............................................................................................................................................1

Introduction......................................................................................................................................2

Quantum Computing.......................................................................................................................3

Quantum Key Distribution..............................................................................................................4

Present Cryptography......................................................................................................................6

Symmetric Cryptography.............................................................................................................6

Asymmetric Cryptography...........................................................................................................6

Challenges in Quantum Computing.................................................................................................7

Cryptosystems Vulnerable To Quantum Algorithm........................................................................8

Shor’s Algorithm in Asymmetric Cryptography.........................................................................8

Grover’s Algorithm......................................................................................................................9

Quantum Communication System.................................................................................................10

Post-Quantum Cryptography.........................................................................................................11

Conclusion.....................................................................................................................................11
 4

Quantum Computers - Impact on Encryption

Introduction

Quantum computer has certainly become the most significant technical foundation of the

modern era, developments in technology, and electronic communication. In data processing and

data storage, the need for anonymity, honesty, validity, and republication make cryptographing

technology one of the most important areas for IT. The safe transit data or stored by third-party

opponents is cryptographic, etymologically derived from the Greek term secret and written. Two

forms of cryptosystems are available: the symmetric and asymmetric concept of quantum

computing, first proposed by Richard Feynman in 1982. It was thoroughly investigated and is the

killer of contemporary asymmetrical cryptography.

In comparison, symmetrical cryptography can, with the use of larger key spaces, be

influenced by such quantum algorithms[CITATION Mav18 \p 406-409 \l 1033 ]. Initially, the rest of

this paper analyses symmetrical cryptography, asymmetrical cryptography, and hash functions.

In specific, the accent is on algorithms that use both the complexity and the discrete problem

with the logarithm to factor large prime numbers. Also, we implement two important quantum

algorithms, namely the Shor and the Grover Algorithm, respectively, which can have an

immense effect on asymmetric cryptography and less symmetric[ CITATION Buc161 \l 1033 ].

Quantum Computing

Production is achieved using bits on the computers with which we are acquainted. There

are two potential values for a bit: 0 and 1. A quantum machine uses qubits, and a concept applied

to quantum money by Stephen Weisner. A qubit is also 0 or 1 when calculated, but both 0 and 1

are measured simultaneously during measurement. This is referred to as 'superposition' in

 5

quantum mechanics. People have the same number of possible states in a bit-based computer, but

only one is still present.

Figure 1.Breaks of the RSA cryptosystem[ CITATION Cam15 \l 1033 ].

Quantum mechanics has several modern features that physicists will use to create

quantum computers that are very different from the conventional devices used today.

Quantum Key Distribution

Production is achieved using bits on the machines with which we are acquainted. There

are two potential values for a bit: 0 and 1. A quantum machine uses qubits, a concept proposed in

the proposal for quantum money by Stephen Weisner. A qubit is also 0 or 1 when calculated, but

both 0 and 1 are measured simultaneously during measurement. This is referred to as

'superposition' in quantum mechanics. You have the same amount of statuses in a bit-based

device, but only one at a time remains.

 6

Quantum Key Distribution solves the protected sharing of the cryptographic key over an

insecure channel between two pieces. QKD depends on quantum mechanics' basic properties that

are not computationally generalized and can be achieved using light, lasers, fibreoptics, and free

space transfer. Protocols of preparation and measure use the Heisenberg Indecision rule, which

says that there are alterations in the measurement act in a quantum state. This makes essaying on

a contact platform without leaving any trace impossible for an intruder. If the legal exchanges

occur, the incorrect information will be discarded, and the sum of data that was intercepted was

measured[ CITATION Mav18 \l 1033 ].

In BB84 Entanglement (EB) protocols, the property was abused using pairs of entangled

objects exchanged by the two parties. Measurement of one thing will also impact the other.

Practice that every entity intercepting any item is exchanged between two legal exchanges if it

affects the method. The existence of an intruder will be revealed along with the amount of

information the attacker received. The E91 protocol was used for this property. The above

methods are further categorized into three families: discreet coding, continuous coding of the

variable, and dispersed coding process. The biggest distinction in the type of detection system

used is between these families.

Present Cryptography

Symmetric Cryptography

The sender and recipient use the same private key and the same encryption algorithm to

encrypt and decrypt the symmetrical cryptography data. For example, the message can be

encrypted by Alice using the shared secret key, and the message can be interpreted by Bob using

the same encryption algorithm used by Alice using a similar shared secret key. The key must be

kept confidential so that Alice and Bob are aware of it. An effective way to share private keys on
 7

public networks is also necessary. To solve the key distribution problem in symmetrical

cryptography, asymmetric cryptography was introduced.

Asymmetric Cryptography

Asymmetric encryption is an encryption method in which the keys occur in pairs. The

private and public keys for each party should be their own. For example, if Bob wished to

encrypt a letter, Alice will give Bob its public access, and then Alice's public key will encrypt

Bob's message. Then Bob will share Alice, who can decode the message using her private key,

the encrypted message. People then encrypt the transmission by public access and decrypt the

message only for the private key. In comparison, digital signatures use asymmetric

encryption[ CITATION Mav18 \l 1033 ].

Figure .2. Asymmetric encryption[ CITATION Ahm18 \l 1033 ].

Challenges in Quantum Computing

Many researchers focus on a variety of problems in quantum computation.

 8

 Most probabilistic quantum algorithms. This test and error undermine the benefit of

quantum computation speed in calculating and checking the right response.

 Qubits are error-prone. Heat, ambient noise, as well as stray electromagnetic connections

may impact them. Classical machines can be a bit contradictory. Bit-flips and phase

errors are found in Qubits[ CITATION Ahm18 \l 1033 ].

 The complexity of continuity is another problem. For a brief period, Qubits may maintain

their quantum states. Researchers at New South Wales University in Australia have

developed two kinds of quits (Phosphoric and Artificial atoms) that they can use to

remove the magnetic noise that makes them vulnerable to an error with small

silicon[ CITATION Mav18 \l 1033 ].

Cryptosystems Vulnerable To Quantum Algorithm

This section discusses the effect on the present cryptography of quantum algorithms and

offers an introduction to Shor and Grover's algorithm. Note that the Shor algorithm renders

algorithms vulnerable in the following paragraph, relying on factorizing and computing discrete

logarithms. In any electronic communication device today, cryptography plays an important role.

Email, password, financial transfers, or even electronic voting devices are, for example, subject

to the same security objectives, including secrecy and honesty. Cryptography means the

encrypted message is read-only by parties who share keys. Quantum computers challenge the

key purpose of all safe and authentic communication because they can do computers that

traditional computers are unable to create. As a result, quantum computers can easily break down

the cryptography key by measuring or thoroughly searching all the hidden keys, enabling a

sender/receiver to interrupt the communication channel among authentic parties. A traditional

machine treats this work as computationally impossible [ CITATION Mav18 \l 1033 ].

 9

Shor's Algorithm in Asymmetric Cryptography

"Quantum computing algorithms demonstrate that large integer factorization can shift

with a quantum computer in theory. Short algorithms can collapse modern asymmetrically since

they are built upon a large factoring prime integer or the discreet logarithm problem. We use the

following example to explain how a short's algorithm renders big numbers[ CITATION Kha181 \l

1033 ]. The prime factors of number 15 are to be discovered. For this, a 4-qubit register is

needed. The 4-qubit register of a conventional machine is visualized as standard 4-bit registries.

In binary number 15 is 1111, a 4-qubit record is adequate to satisfy this number (calculate).

According to Bone and Castro, a registry calculation should be viewed as parallel estimates for

any future value the registry can take (0-15). This is also the only move on the quantum

computer[CITATION Mav18 \p 406-409 \l 1033 ].

The algorithm does the following:

• n = 15, is the number we want to factorize

• x = random number such as 1 < x < n − 1

• X shall be increased to the register's power (all conceivable state) and consequently split by n

the rest of the operation shall be held in a second 4-qubit register. The second register also has

the effects of the overlay. Suppose x = 2 that is greater than 1 and less than 14.

Additionally, for the calculation of discrete logarithm problems, the Shor algorithm can be used.

Vazirani analyzed the Shor algorithm's technique in greater detail and demonstrated that a new

overlay could be developed with two high- probability integers that satisfy an equation, starting

from the random overlapping status of two integers and performing a series of Fourier

transformations. Using this equation, the unknown exponent in the DLP r can be determined.
 10

Grover's Algorithm

Grover algorithm has generated an algorithm that scans non-sorted datasets using

quantum computers. The algorithm can be contained in a non-sorted N-input database in N

queries. Also, the N/2 quest for the same entry is required for a traditional computer. Bone and

Castro reported on the effect of Grover's algorithm for breaking a 56-bit card, Data Encryption

Standard (DES). The authors noted that only 185 searches are required to find the main

algorithm[ CITATION Zho18 \l 1033 ].

Quantum Communication System

Quantum communication can be separated into direct quantum communication and

telecommunication. The Quantum Direct Transmitting Paradigm is the easiest way to relay

quantum signals in multiple locations. The model for direct quantum contact. Over a quantum

channel, Alice needs to interact with Bob. Alice first has to generate a sequence of photons using

a training device for the message she wishes to communicate with Bob in the quantum direct

transmission model. In this case, external noise will easily interrupt the quantum channel. The

Bob receiver then initially encodes QECC for the signal received and then encodes the quantum

source. Finally, Bob gets the first quantum letter.

Figure 3 [ CITATION Zho18 \l 1033 ].

 11

Quantum teleportation is the most quantum contact. As compared to classical connection,

qubits can not only be indifferent orthogonal overlays but can also be in an interconnected state.

Figure 4 [ CITATION Zho18 \l 1033 ].

Conclusion

This paper concluded that quantum computing. The processing and storing of information

must be as secure as possible in today's world, where data is especially valuable. Year by year,

we appear to be closer to building a fully working, universal quantum computer that uses solid

quantum algorithms such as Shor's and Grover's. This technical development outcome is that the

existing public key, stable algorithms such as RSA and Elliptic Curve Cryptosystems have

completely crashed. However, algorithms have been introduced to bypass the current asymmetric

cryptographic method whose stability is based on producing big prime numbers and the

algorithm's discrete problem. Even the most reliable and powerful way against quantum

computers is thought to be elliptically curved cryptography, it seems. There is also a need for

robust quantum calculation cryptographic algorithms. Quantum world simulations are also highly

resourceful, and they lack correctness for larger structures, such as molecules. Quantum

simulations can give a new insight into proteins, which can revolutionize the medical field.

Quantum computers may be a professional tool or a massive human revolution

 12

References

Ahmad, J. I., Din, R., & Ahmad, M. (2018). Analysis review on public-key cryptography

algorithms. Indonesian Journal of Electrical Engineering and Computer Science, 12(2),

447-454. Retrieved from

https://www.researchgate.net/publication/327250575_Analysis_Review_on_Public_Key_

Cryptography_Algorithms

Buchanan, W. J., & Woodward, A. (2016). Will quantum computers be the end of public key

encryption? Journal of Cyber Security Technology, 1(1), 1-22. Retrieved from

https://www.researchgate.net/publication/308387440_Will_quantum_computers_be_the_

end_of_public_key_encryption
 13

Campagna, M., Ding, J., & Hayford, D. (2015). Quantum safe cryptography and security.

Retrieved from

https://www.etsi.org/images/files/ETSIWhitePapers/QuantumSafeWhitepaper.pdf

Khan, A. G., Basharat, S., & Riaz, M. U. (2018). Analysis of asymmetric cryptography in

information security based on computational study to ensure confidentiality during

information exchange. International Journal of Scientific & Engineering Research, 9(10),

992-997. Retrieved from

https://www.researchgate.net/publication/328630416_Analysis_of_asymmetric_cryptogr

aphy_in_information_security_based_on_computational_study_to_ensure_confidentiality

_during_information_exchange

Mavroeidis, V., Kamer Vishi, M. D., & Jøsang, A. (2018). The impact of quantum computing on

present cryptography. (IJACSA) International Journal of Advanced Computer Science

and Applications, 9(3), 406-409. Retrieved from

https://www.researchgate.net/publication/324115273_The_Impact_of_Quantum_Comput

ing_on_Present_Cryptography

Zhou, T., Shen, J., & Wang, C. (2018). Quantum cryptography for the future internet and the

security analysis. Security and Communication Networks. Retrieved from

https://www.hindawi.com/journals/scn/2018/8214619/