How Will Cryptography Survive the Rise of Quantum Computing?

The most widely used cryptography today is based upon a handful of ideas from number theory. The key to the security of most communications in the world lies in the sheer scale of the computation required to break codes. But some quantum algorithms will definitely reduce the computation time from billions of years to few hours, rendering modern cryptography useless. How will cryptography survive the rise of quantum computing? Or is there nothing to worry about?

Transcript

1. How Will Cryptography Survive the Rise of Quantum Computing Rakhim Davletkaliyev @freetonik
2. Whoami codexpanse.com blog → rakhim.org twitter → @freetonik #programming #teaching #finland
3. Computer Quantum Mechanics The Plan Cryptography Quantum Computer Quantum Cryptography
4. 0 1 Bits 1
5. 0 1 Bits 1
6. 0 1 Bits 1
7. 0 1 Bits 1
8. 0 1 Bits 1
9. AND 0 1 0 Gates 1
10. 0 1 OR 1 Gates 1
11. Gates 1
12. Gates 1
13. Gates 1
14. 1 Gates: full adder AND AND XOR XOR OR
15. Gates: full adder 1
16. Gates: full adder 1
17. 0 1 + How to make a computer 1
18. 1 How to make a computer + + 0 1
19. 0 1 + + How to make a computer 1
20. Computer Quantum Mechanics Cryptography Quantum Computer Quantum Cryptography you are here
21. 2 Cryptography: simple shift
22. fsl hzrlk qvbrv rbtwbsh, h zlupvy zjpluapza ha aol uhabyhs ylzvbyjlz puzapabal mpushuk (sbrl), ovd thuf dopal ylpuklly hyl pu mhja dhuklypun hyvbuk shwshuk’z mlssz. ”mvy lclyf vul obukylk ylpuklly ivyu, pa’z busprlsf vul dpss il jvtwslalsf dopal,” ol lewshpulk, hkkpun aoha aolyl thf il h zuvd- dopal pukpcpkbhs pu h nyvbw vm h mld obukylk hupthsz. dopal ylpuklly hyl hszv bzbhssf mlthsl, hjjvykpun av rbtwbsh. ”dopal ylpuklly hylu’a uljlzzhypsf hsipuvz, aolf hyl aol ylzbsa vm jvsvby tbahapvuz. hu hsipuv ylpuklly dpss ohcl wpur lflz, uhpsz huk zrpu, huk hyl mhy yhyly aohu aol dopal
24. Cryptography: Enigma machine 2
25. Cryptography: symmetric encryption 2
26. Cryptography: asymmetric encryption 2 secret public
27. public Cryptography: asymmetric encryption 2 secret
28. + ??? Cryptography: asymmetric encryption 2 0 1
29. Cryptography on a computer 2 easy hard without
30. easy hard P Q N multiply P x Q N find P and Q P Q prime numbers Cryptography on a computer 2
31. 1. Pick two
 primes 2 P 7 Q Cryptography on a computer 2
32. 1. Pick two
 primes 2. Multiply them 2 P 7 Q 14 N Cryptography on a computer 2
33. 1. Pick two
 primes 2. Multiply them 2 P 7 Q 14 N 3. Find φ(N) = (P-1)(Q-1) 6 φ(N) Cryptography on a computer 2
34. 1. Pick two
 primes 2. Multiply them 2 P 7 Q 14 N 3. Find φ(N) = (P-1)(Q-1) 6 φ(N) 4. Choose E 1 < E < φ(N) co-prime with N, φ(N) { 5 E such that Cryptography on a computer 2
35. 1. Pick two
 primes 2. Multiply them 2 P 7 Q 14 N 3. Find φ(N) = (P-1)(Q-1) 6 φ(N) 4. Choose E 1 < E < φ(N) co-prime with N, φ(N) { 5 E 5. Choose D such that d×e (mod φ(N)) = 1 such that 11 D Cryptography on a computer 2
36. 14 N 5 E 11 D Public Private Cryptography on a computer: RSA 2
37. 11 D Private Cryptography on a computer: RSA 2 14 N 5 E Public
38. 14 N 5 E Cryptography on a computer: RSA 2 11 D Private 14 N 5 E Public
39. c "c" → 3 3E (mod 14) = 35 (mod 14) = 243 (mod 14) = 5 Cryptography on a computer: RSA 2 11 D Private 14 N 5 E Public 14 N 5 E
40. 11 D Private 14 N 5 E Public 5 5D (mod 14) = 511 (mod 14) = 48828125 (mod 14) = 3 → "c" Cryptography on a computer: RSA 2
41. Computer Quantum Mechanics Cryptography Quantum Computer Quantum Cryptography you are here
42. Quantum mechanics 3
43. wave? particle? Light is a...
44. Quantum mechanics 3
45. Quantum mechanics 3 Veritasium — The Original Double Slit Experiment https://www.youtube.com/watch?v=Iuv6hY6zsd0
46. Quantum mechanics 3
47. Quantum mechanics 3 electrons/photons
48. Quantum mechanics 3 one at a time
49. Quantum mechanics 3
50. Quantum mechanics 3
51. 0 1
52. 0 1
53. 0 1 0 1
54. 0 1 0 1 0 1
55. How to make a (quantum) computer 0 1 + 3 + 0 1 1 1 0
56. Popular Quantum Computing Level 1 More than just 0 or 1 More POWER!!!
57. Popular Quantum Computing Level 2 0 and 1 at the same time PARALLEL COMPUTATION!!!
58. 0 and 1 at the same time PARALLEL COMPUTATION!!! = ?
59. 0 and 1 at the same time PARALLEL COMPUTATION!!! =
60. Find factors of N
61. 11887050 is not a factor Find factors of N
62. Find factors of N
63. 12338478 is not a factor Find factors of N
64. Find factors of N
65. 487369091 is a factor Find factors of N
66. Find factors of N
67. Find factors of N Find period of a function
68. 1. the answer is x 2. the answer is x 3. the answer is x 4. the answer is y 5. the answer is z 6. the answer is x 7. the answer is w 8. the answer is x 9. the answer is x 10. the answer is z Find factors of N Find period of a function
69. 1. the answer is x 2. the answer is x 3. the answer is x 4. the answer is y 5. the answer is z 6. the answer is x 7. the answer is w 8. the answer is x 9. the answer is x 10. the answer is z Find factors of N Find period of a function Shor's Algorithm
70. Computer Quantum Mechanics Cryptography Quantum Computer Quantum Cryptography you are here
71. Quantum Cryptography: BB84 3
72. Quantum Cryptography: BB84 3 0 1 0 or 1 0 or 1 1 0 0 or 1 0 or 1
73. 0 1 0 or 1 0 or 1 1 0 0 or 1 0 or 1
74. Quantum Cryptography: BB84 3 1 0 0 1 0 1
75. Quantum Cryptography: BB84 3 1 0 0 1 0 1
76. Quantum Cryptography: BB84 3 1 0 0 1 0 1
77. Quantum Cryptography: BB84 3 1 0 0 1 0 1
78. Quantum Cryptography: BB84 3 1 0 0 1 0 1
79. Quantum Cryptography: BB84 3 1 0 0 1 0 1 1 0 1 1 0 0
80. Quantum Cryptography: BB84 3 1 0 0 1 0 1 1 0 1 1 0 0
81. Quantum Cryptography: BB84 3 1 0 0 1 0 1 1 0 1 1 0 0
82. Quantum Cryptography: BB84 3 1 1 0 1 1 0
83. Learn more about quantum computing and cryptography • "Quantum computing for the very curious" (interactive essay)
 https://quantum.country/qcvc • Scott Aaronson's blog
 https://www.scottaaronson.com/blog/ • And his book "Quantum Computing since Democritus" • "Frame of Essense"
 https://www.youtube.com/user/frameofessence
84. rakhim.org/qc Slides, links, etc: Thank you!