Quantum Mechanics; a Blessing and a Curse By Elias Marcopoulos - - PowerPoint PPT Presentation

▶
quantum mechanics a blessing and a curse
SMART_READER_LITE
LIVE PREVIEW

Quantum Mechanics; a Blessing and a Curse By Elias Marcopoulos - - PowerPoint PPT Presentation

May 18, 2023 182 likes •929 views

Quantum Mechanics; a Blessing and a Curse By Elias Marcopoulos Quantum Computers Quantum Computers are just like regular computers, they crunch numbers Quantum Computers Quantum Computers are just like regular computers, they crunch

slide-1
SLIDE 1

Quantum Mechanics; a Blessing and a Curse

By Elias Marcopoulos

slide-2
SLIDE 2

Quantum Computers

  • Quantum Computers are just like regular computers, they crunch

numbers

slide-3
SLIDE 3

Quantum Computers

  • Quantum Computers are just like regular computers, they crunch

numbers

  • The difference lies in the fact that Quantum Computers can crunch

multiple numbers at the same time

slide-4
SLIDE 4

Quantum Computers

  • Quantum Computers are just like regular computers, they crunch

numbers

  • The difference lies in the fact that Quantum Computers can crunch

multiple numbers at the same time

slide-5
SLIDE 5

Superposition

  • They do this through a phenomena known as superposition
slide-6
SLIDE 6

Superposition

  • They do this through a phenomena known as superposition
  • Superposition is when two waves occupy the same physical space, so

that their waves are additively combined

  • This allows a wave to be both a 0 and a 1 at the same time, for

instance.

slide-7
SLIDE 7

Superposition

  • You may remember a picture that looks like this, if you ever took a

high school physics course

slide-8
SLIDE 8

Superposition

  • You may remember a picture that looks like this, if you ever took a

high school physics course

This might represent a 1

slide-9
SLIDE 9

Superposition

  • You may remember a picture that looks like this, if you ever took a

high school physics course

This might represent a 1 And This might represent a 0

slide-10
SLIDE 10

Superposition

  • You may remember a picture that looks like this, if you ever took a

high school physics course

This might represent a 1 And This might represent a 0 And this would be the resultant superposition (In quantum computers, waves do not look like This, but the concept is the same)

slide-11
SLIDE 11

What a Quantum Computer Looks Like

slide-12
SLIDE 12

What a Quantum Computer Looks Like

Each of these gold things are called a qubit, or quantum bit

slide-13
SLIDE 13

What a Quantum Computer Looks Like

Each of these gold things are called a qubit, or quantum bit Each qubit contains a particle, like an atom

slide-14
SLIDE 14

What a Quantum Computer Looks Like

Each of these gold things are called a qubit, or quantum bit Each qubit contains a particle, like an atom Every atom describes a wave, which can Interfere with all the waves described by the Other atoms from the other qubits

slide-15
SLIDE 15

Wait, If they all superposition together…

  • Then for each qubit which is in a superposition between a 1 and a 0,

each other qubit is also in a 1 and a 0

slide-16
SLIDE 16

Wait, If they all superposition together…

  • Then for each qubit which is in a superposition between a 1 and a 0,

each other qubit is also in a 1 and a 0

  • So in total, 2n states exist simultaneously, where n is the number of

qubits

slide-17
SLIDE 17

What’s So Great About Being in Exponential States?

slide-18
SLIDE 18

What’s So Great About Being in Exponential States?

  • Image you are guessing someone’s password
slide-19
SLIDE 19

What’s So Great About Being in Exponential States?

  • Image you are guessing someone’s password
  • Lets imagine their password is 150 bits long
slide-20
SLIDE 20

What’s So Great About Being in Exponential States?

  • Image you are guessing someone’s password
  • Lets imagine their password is 150 bits long
  • With one computer, there are 1.4272477 x 1045 passwords that would

have to be tried iteratively, which would take forever

slide-21
SLIDE 21

What’s So Great About Being in Exponential States?

  • Image you are guessing someone’s password
  • Lets imagine their password is 150 bits long
  • With one computer, there are 1.4272477 x 1045 passwords that would

have to be tried iteratively, which would take forever

  • A Quantum Computer with 150 qubits could represent each possible

password at once

slide-22
SLIDE 22

What’s So Great About Being in Exponential States?

  • Image you are guessing someone’s password
  • Lets imagine their password is 150 bits long
  • With one computer, there are 1.4272477 x 1045 passwords that would

have to be tried iteratively, which would take forever

  • A Quantum Computer with 150 qubits could represent each possible

password at once

  • If the place to enter the password was a physical device compatible

with the quantum computer, it would be opened immediately

slide-23
SLIDE 23

So it can try a lot of things at once?

slide-24
SLIDE 24

So it can try a lot of things at once?

  • Basically
slide-25
SLIDE 25

So it can try a lot of things at once?

  • Basically
  • In fact, with 2n computers, you can simulate a quantum computer
slide-26
SLIDE 26

What do you think is less expensive, more efficient and more reliable?

slide-27
SLIDE 27

What do you think is less expensive, more efficient and more reliable?

2n computers?

slide-28
SLIDE 28

What do you think is less expensive, more efficient and more reliable?

2n computers? Or n qubits?

slide-29
SLIDE 29

What do you think is less expensive, more efficient and more reliable?

2n computers? Or n qubits?

slide-30
SLIDE 30

What do you think is less expensive, more efficient and more reliable?

2n computers? Or n qubits?

That’s why so many big companies are investing in quantum technology

slide-31
SLIDE 31

I don’t know any places to enter a password that are “quantum enabled”

slide-32
SLIDE 32

I don’t know any places to enter a password that are “quantum enabled”

  • There aren’t any, as far as I know! So thankfully quantum computers

can’t be used as the ultimate hacking devices.

slide-33
SLIDE 33

I don’t know any places to enter a password that are “quantum enabled”

  • There aren’t any, as far as I know! So thankfully quantum computers

can’t be used as the ultimate hacking devices.

  • Think of it this way: Even with 2n computers, they all can’t try their

password at once, they have to take turns entering it into the server.

slide-34
SLIDE 34

I don’t know any places to enter a password that are “quantum enabled”

  • There aren’t any, as far as I know! So thankfully quantum computers

can’t be used as the ultimate hacking devices.

  • Think of it this way: Even with 2n computers, they all can’t try their

password at once, they have to take turns entering it into the server.

  • The area that quantum computers can actually break things is in hard

mathematical functions

slide-35
SLIDE 35

Breaking RSA

  • RSA is a popular public encryption model.
slide-36
SLIDE 36

Breaking RSA

  • RSA is a popular public encryption model.
  • There is a secret key and a public key, the public key is used to encrypt

data and send it to the server, where it can be decrypted with the secret key

slide-37
SLIDE 37

Breaking RSA

  • RSA is a popular public encryption model.
  • There is a secret key and a public key, the public key is used to encrypt

data and send it to the server, where it can be decrypted with the secret key

  • The public and private keys must be correlated, and they are with

math!

slide-38
SLIDE 38

Prime Number Factorization

  • The math RSA is based on is multiplying very large prime numbers

together

Much bigger than this!!!!

slide-39
SLIDE 39

Prime Number Factorization

  • The math RSA is based on is multiplying very large prime numbers

together

  • Factoring the resultant number is difficult to do without brute force

(currently no polynomial time algorithm exists for a classical computer)

slide-40
SLIDE 40

Prime Number Factorization

  • The math RSA is based on is multiplying very large prime numbers

together

  • Factoring the resultant number is difficult to do without brute force

(currently no polynomial time algorithm exists for a classical computer)

  • But this is no problem for a quantum computer! Peter Shor came up

with a polynomial time algorithm that has already been used to factor small prime numbers

slide-41
SLIDE 41

(Incomplete) List of Public Key Systems Vulnerable to Quantum Computing

  • RSA
  • DSA
  • ECHD
  • ECDSA
  • BLISS
  • NTRU
slide-42
SLIDE 42

(Incomplete) List of Public Key Systems Vulnerable to Quantum Computing

  • RSA
  • DSA
  • ECHD
  • ECDSA
  • BLISS
  • NTRU
slide-43
SLIDE 43

(Incomplete) List of Public Key Systems Vulnerable to Quantum Computing

  • RSA
  • DSA
  • ECHD
  • ECDSA
  • BLISS
  • NTRU

Most Public Key Systems are compromised, so we need another type of system to remain secure

slide-44
SLIDE 44

The One Time Pad

  • Symmetric key systems are quantum resistant!
slide-45
SLIDE 45

The One Time Pad

  • Symmetric key systems are quantum resistant!
  • The One Time Pad is the most unbreakable symmetric key system
slide-46
SLIDE 46

The One Time Pad

  • Symmetric key systems are quantum resistant!
  • The One Time Pad is the most unbreakable symmetric key system

Each character in the message is given its own random key, Which is added to the original message

slide-47
SLIDE 47

Problems with the One Time Pad

  • A new key needs to be transmitted between the two users each time
slide-48
SLIDE 48

Problems with the One Time Pad

  • A new key needs to be transmitted between the two users each time
  • Anyone can eavesdrop on network traffic and just steal the key, then read the

secret message

slide-49
SLIDE 49

Problems with the One Time Pad

  • A new key needs to be transmitted between the two users each time
  • Anyone can eavesdrop on network traffic and just steal the key, then read the

secret message

  • The key needs to be truly random, or an attacker can find a pattern
slide-50
SLIDE 50

Problems with the One Time Pad

  • A new key needs to be transmitted between the two users each time
  • Anyone can eavesdrop on network traffic and just steal the key, then read the

secret message

  • The key needs to be truly random, or an attacker can find a pattern
  • Currently, random numbers generators are all pseudo-random
  • That means they are deterministic and can be predicted by an attacker
slide-51
SLIDE 51

The Quantum One Time Pad

  • Both of these problems can be fixed using quantum mechanics!
slide-52
SLIDE 52

The Quantum One Time Pad

  • Both of these problems can be fixed using quantum mechanics!
  • Two quantum mechanical properties help us here:
  • 1. The Heisenberg Uncertainty Principle
  • 2. Entanglement
slide-53
SLIDE 53
slide-54
SLIDE 54

What this means is that there are certain processes that are truly unpredictable. We can never be entirely certain about the outcome of a measurement because of this.

slide-55
SLIDE 55

Heisenberg Uncertainty Principle

  • Because of uncertainty, we can create random number generators

that are guaranteed to be unpredictable.

slide-56
SLIDE 56

Heisenberg Uncertainty Principle

  • Because of uncertainty, we can create random number generators

that are guaranteed to be unpredictable.

  • If they could be predicted, then the attacker would have been certain

about the outcome of the event, which contradicts the laws of nature!

slide-57
SLIDE 57

Quantum Entanglement

slide-58
SLIDE 58

Quantum Entanglement

Two particles, although separated by a distance, when measured give correlated results. For instance, when two particles are entangled, and in an unknown up or down state, when one is measured, the other will assume the

  • pposite state
slide-59
SLIDE 59

Quantum Entanglement

  • This solves the transmission problem, because it suggests that a

particle measurement can be detected. Therefore, if an eavesdropper tries to listen in on a key, the attack can be detected and another key can be sent.

slide-60
SLIDE 60

Heisenberg Uncertainty Principle

  • In fact, there is another security measure given from quantum

mechanics for the transmission of keys

slide-61
SLIDE 61

Heisenberg Uncertainty Principle

  • In fact, there is another security measure given from quantum

mechanics for the transmission of keys

  • Since the uncertainty principle only allows you to know with infinite

precision one aspect of a particle, then measuring the particle removes all knowledge of another aspect, effectively changing the state of the particle

slide-62
SLIDE 62

Heisenberg Uncertainty Principle

  • In fact, there is another security measure given from quantum

mechanics for the transmission of keys

  • Since the uncertainty principle only allows you to know with infinite

precision one aspect of a particle, then measuring the particle removes all knowledge of another aspect, effectively changing the state of the particle

  • If the state of the particle changes, then it will no longer give the

same measurement, meaning the attacker’s observed key is useless since the intended receiver gets a different key in the end

slide-63
SLIDE 63

Does Theory Match Up With Expectation?

  • This Quantum One Time Pad has actually been used in practice!
slide-64
SLIDE 64

Does Theory Match Up With Expectation?

  • This Quantum One Time Pad has actually been used in practice!
  • In 2018, over satellite, a video conference was held that was quantum

secured

slide-65
SLIDE 65

Does Theory Match Up With Expectation?

  • This Quantum One Time Pad has actually been used in practice!
  • In 2018, over satellite, a video conference was held that was quantum

secured

  • The call occurred over 7600km, which is quite far, as quantum

systems are notorious for being too short ranged to be practical commercially

slide-66
SLIDE 66

The Quantum Race

  • There are two competing technologies:
slide-67
SLIDE 67

The Quantum Race

  • There are two competing technologies:

Quantum Computers (enable attacking)

slide-68
SLIDE 68

The Quantum Race

  • There are two competing technologies:

Quantum Computers Quantum Cryptography (enable attacking) (enable defense)

slide-69
SLIDE 69

The Quantum Race

Depending on which technology comes first, the world could be in a lot

  • f trouble!

Banking information, government secrets, and more sensitive information would be easily available if quantum computers are developed first.

slide-70
SLIDE 70

The Quantum Race

Depending on which technology comes first, the world could be in a lot

  • f trouble!

Banking information, government secrets, and more sensitive information would be easily available if quantum computers are developed first. Thankfully, the defensive quantum systems seem more sophisticated and viable for commercial distribution at this point in time.

slide-71
SLIDE 71

Any Questions?

slide-72
SLIDE 72

Thank You For Listening To Me Rant About Quantum Mechanics And Its Impact On Cyber Security!

slide-73
SLIDE 73

Works Cited

  • Alspach, Kyle. “CES 2018: IBM Shows Off The World's Largest Quantum Computer.” CRN, 12 January 2018. Web. 4 May 2018. < https://www.crn.com/news/mobility/video/300097916/ces-2018-

ibm-shows-off-the-worlds-largest-quantum-computer.htm>

  • Bonsor, Kevin and Strickland, Jonathan. “How Quantum Computers Work.” howstuffworks tech. howstuffworks, 8 December 2000. Web. 3 May 2018. <

https://computer.howstuffworks.com/quantum-computer1.htm>

  • Buchanan, William and Woodward, Alan. “Will quantum computers be the end of public key encryption?” Journal of Cyber Security Technology, 1:1, 1-22, DOI: 10.1080/23742917.2016.1226650.

2016

  • Drakos, Nikos. “Shor's Algorithm for Quantum Factorization.” Quantum Algorithms. CBLU, 3 July 2002. Web. 3 May 2018. < http://tph.tuwien.ac.at/~oemer/doc/quprog/node18.html>
  • Herrero-Collantes, Miguel and Garcia-Escartin, Juan Carlos. “Quantum Random Number Generators.” Cornell University Library, arXiv:1604.03304. 24 October 2016
  • Hsu, Jeremy. “CES 2018: Intel's 49-Qubit Chip Shoots for Quantum Supremacy.” IEEE Spectrum. IEEE, 9 January 2018. Web. 4 May 2018. < https://spectrum.ieee.org/tech-

talk/computing/hardware/intels-49qubit-chip-aims-for-quantum-supremacy>

  • Koyen, Jeff. “Cybersecurity in the Age of Quantum Computing.” Forbes Tech / Cybersecurity. Forbes, 1 November 2017. Web. 3 May 2018. <

https://www.forbes.com/sites/juniper/2017/11/01/cybersecurity-in-the-age-of-quantum-computing/#210db0a423cd>

  • Kuhn, D. Richard. “A Quantum Cryptographic Protocol with Detection of Compromised Server.” National Institute of Standards and Technology. 2003.
  • Liao, Sheng-Kai, et al. “Satellite-relayed Intercontinental Quantum Network.” Cornell University Library, arXiv:1801.04418. 13 Jan 2018.
  • Nielsen, Michael A. and Chuang, Isaac L. Quantum Computation and Quantum Information (2nd ed.). Cambridge, Cambridge University Press, 2010.
  • Peev, M, et al. “The SECOQC quantum key distribution network in Vienna.” New Journal of Physics 11 075001. Institute of Physics, 2009.
  • Rijmenants, Dirk. “One-time Pad.” Cipher Machines and Cryptology. 2004. Web. 3 May 2018. < http://users.telenet.be/d.rijmenants/en/onetimepad.htm>
  • “What is quantum computing?” IBM Q. IBM, 15 July 2016. Web. 2 May 2018. < https://www.research.ibm.com/ibm-q/learn/what-is-quantum-computing/>
slide-74
SLIDE 74

Image Sources (in order of appearance)

  • http://www.fanpop.com/clubs/the-tenth-doctor/images/33568181/title/thats-impossible-photo
  • https://waves.neocities.org/superposition.html
  • https://www.extremetech.com/computing/261734-intel-unveils-new-quantum-computer-declares-quantum-

breakthrough

  • https://leisureguy.wordpress.com/2013/07/03/employees-as-computer-controlled-automatons/
  • https://newsroom.intel.com/news/intel-delivers-17-qubit-superconducting-chip-advanced-packaging-qutech/
  • https://medium.com/i-math/generate-factors-of-any-number-using-primes-1621bfeb1b2b
  • https://www.slideshare.net/AsadAli108/3-l4
  • https://www.youtube.com/watch?v=Wh2fbQ_6kmY
  • http://www.sciencemag.org/news/2015/08/more-evidence-support-quantum-theory-s-spooky-action-distance
  • https://spectrum.ieee.org/tech-talk/computing/hardware/intels-49qubit-chip-aims-for-quantum-supremacy
  • http://www.sciencemag.org/news/2017/06/china-s-quantum-satellite-achieves-spooky-action-record-distance
  • https://imgur.com/gallery/2nLlm