WEBVTT

1
00:00:00.120 --> 00:00:01.410
In this lesson,

2
00:00:01.410 --> 00:00:05.280
we will learn about Post-Quantum Cryptography.

3
00:00:05.280 --> 00:00:07.410
Post-quantum cryptography

4
00:00:07.410 --> 00:00:10.140
refers to cryptographic algorithms,

5
00:00:10.140 --> 00:00:14.460
specifically designed to withstand the advanced threats

6
00:00:14.460 --> 00:00:17.070
posed by quantum computers.

7
00:00:17.070 --> 00:00:21.510
Quantum computers with their immense computational power

8
00:00:21.510 --> 00:00:25.170
are expected to break many of the encryption methods

9
00:00:25.170 --> 00:00:28.290
that are currently relied on for security.

10
00:00:28.290 --> 00:00:32.970
In this Post-Quantum cryptography section of the course,

11
00:00:32.970 --> 00:00:36.060
we will compare post-quantum cryptography

12
00:00:36.060 --> 00:00:40.290
to Diffie-Hellman and Elliptic Curve Cryptography.

13
00:00:40.290 --> 00:00:41.760
Let's learn more

14
00:00:41.760 --> 00:00:44.730
about the mechanics of quantum cryptography

15
00:00:44.730 --> 00:00:48.630
and post-quantum versus Diffie-Hellman

16
00:00:48.630 --> 00:00:51.480
and Elliptic Curve Cryptography.

17
00:00:51.480 --> 00:00:54.830
First, let's explore how quantum computing

18
00:00:54.830 --> 00:00:57.900
and quantum cryptography work.

19
00:00:57.900 --> 00:01:00.780
Quantum computing combines principles

20
00:01:00.780 --> 00:01:04.620
from physics, mathematics, and quantum mechanics

21
00:01:04.620 --> 00:01:08.340
to harness the unique properties of quantum states,

22
00:01:08.340 --> 00:01:09.893
such as a superposition

23
00:01:09.893 --> 00:01:13.800
and entanglement to perform computations.

24
00:01:13.800 --> 00:01:17.250
A quantum represents the smallest unit

25
00:01:17.250 --> 00:01:19.470
of any physical property,

26
00:01:19.470 --> 00:01:23.940
such as particles at the atomic or subatomic level.

27
00:01:23.940 --> 00:01:26.820
Traditional computing relies on bits

28
00:01:26.820 --> 00:01:29.880
that can either be a zero or a one.

29
00:01:29.880 --> 00:01:31.380
While quantum computing

30
00:01:31.380 --> 00:01:34.320
uses qubits or quantum bits,

31
00:01:34.320 --> 00:01:37.650
which can exist in multiple states at once

32
00:01:37.650 --> 00:01:39.780
due to superposition.

33
00:01:39.780 --> 00:01:42.360
Superposition allows a qubit

34
00:01:42.360 --> 00:01:44.910
to be in a combination of states

35
00:01:44.910 --> 00:01:48.630
like both zero and one simultaneously,

36
00:01:48.630 --> 00:01:52.320
vastly increasing computational power.

37
00:01:52.320 --> 00:01:54.630
Entanglement is a phenomenon

38
00:01:54.630 --> 00:01:58.410
where two or more qubits become interconnected,

39
00:01:58.410 --> 00:02:00.990
meaning the state of one qubit

40
00:02:00.990 --> 00:02:04.290
instantly influences the state of others

41
00:02:04.290 --> 00:02:06.540
regardless of distance.

42
00:02:06.540 --> 00:02:09.510
This ability to hold, coordinate,

43
00:02:09.510 --> 00:02:12.870
and process multiple states simultaneously

44
00:02:12.870 --> 00:02:14.790
allows quantum computers

45
00:02:14.790 --> 00:02:17.490
to perform complex calculations

46
00:02:17.490 --> 00:02:20.280
much faster than traditional computers,

47
00:02:20.280 --> 00:02:22.830
making them particularly powerful

48
00:02:22.830 --> 00:02:25.770
for solving a cryptographic problems.

49
00:02:25.770 --> 00:02:30.240
For example, a 1000-qubit quantum computer

50
00:02:30.240 --> 00:02:32.160
would vastly outperform

51
00:02:32.160 --> 00:02:35.400
today's most powerful supercomputers.

52
00:02:35.400 --> 00:02:37.108
Today's cryptography relies

53
00:02:37.108 --> 00:02:40.380
on complex mathematical problems

54
00:02:40.380 --> 00:02:42.540
to keep data secure,

55
00:02:42.540 --> 00:02:45.300
but quantum computers can quickly break

56
00:02:45.300 --> 00:02:48.870
traditional encryption methods due to their ability

57
00:02:48.870 --> 00:02:52.860
to process multiple possibilities all at once.

58
00:02:52.860 --> 00:02:56.070
For example, the computational strength

59
00:02:56.070 --> 00:02:57.900
of quantum algorithms,

60
00:02:57.900 --> 00:03:00.480
such as Shor's algorithm

61
00:03:00.480 --> 00:03:03.960
poses a threat to current cryptographic standards

62
00:03:03.960 --> 00:03:06.120
because it can effectively solve

63
00:03:06.120 --> 00:03:07.950
the mathematical problems

64
00:03:07.950 --> 00:03:10.800
that underpin encryption algorithms

65
00:03:10.800 --> 00:03:14.880
like Diffie-Hellman and Elliptic Curve Cryptography.

66
00:03:14.880 --> 00:03:17.880
This means that once quantum computers

67
00:03:17.880 --> 00:03:20.130
become fully operational,

68
00:03:20.130 --> 00:03:24.600
they could render current encryption techniques obsolete,

69
00:03:24.600 --> 00:03:25.890
making it essential

70
00:03:25.890 --> 00:03:29.640
to develop quantum resistant cryptographic methods

71
00:03:29.640 --> 00:03:31.175
to protect our data.

72
00:03:31.175 --> 00:03:35.160
As of 2024, quantum computers

73
00:03:35.160 --> 00:03:37.500
are operating with qubit counts

74
00:03:37.500 --> 00:03:40.980
that vary widely depending upon the technology

75
00:03:40.980 --> 00:03:43.230
and the company developing them.

76
00:03:43.230 --> 00:03:47.490
Leading quantum computing companies like IBM and Google

77
00:03:47.490 --> 00:03:49.620
have made significant strides

78
00:03:49.620 --> 00:03:51.990
in increasing qubit numbers.

79
00:03:51.990 --> 00:03:54.810
IBM's latest quantum processor

80
00:03:54.810 --> 00:03:59.810
known as the Osprey boasts 433 qubits,

81
00:04:00.060 --> 00:04:03.360
representing one of the highest publicly announced

82
00:04:03.360 --> 00:04:07.500
qubit counts in universal quantum computing.

83
00:04:07.500 --> 00:04:10.080
Google's Sycamore processor,

84
00:04:10.080 --> 00:04:12.000
which previously demonstrated

85
00:04:12.000 --> 00:04:16.320
quantum supremacy, operates with 53 qubits,

86
00:04:16.320 --> 00:04:18.930
though the focus has since shifted

87
00:04:18.930 --> 00:04:22.350
towards scaling up and reducing errors.

88
00:04:22.350 --> 00:04:26.640
Overall, most current universal quantum computers

89
00:04:26.640 --> 00:04:30.870
are operating in the range of 500 to 50 qubits,

90
00:04:30.870 --> 00:04:34.980
with ongoing research aiming to increase qubit counts

91
00:04:34.980 --> 00:04:36.900
and improve their stability

92
00:04:36.900 --> 00:04:39.630
and error correction capabilities.

93
00:04:39.630 --> 00:04:42.660
And while 50 to 500 qubits

94
00:04:42.660 --> 00:04:45.210
is a lot of processing power,

95
00:04:45.210 --> 00:04:47.040
most current estimates

96
00:04:47.040 --> 00:04:49.230
predict that a quantum computer

97
00:04:49.230 --> 00:04:50.970
will need somewhere in the neighborhood

98
00:04:50.970 --> 00:04:53.310
of 3000 or more qubits

99
00:04:53.310 --> 00:04:57.210
to be a threat to today's cryptographic algorithms.

100
00:04:57.210 --> 00:05:01.140
Now that we understand the state of quantum computing,

101
00:05:01.140 --> 00:05:04.350
let's learn about two primary strategies

102
00:05:04.350 --> 00:05:08.070
for safeguarding data against quantum computing.

103
00:05:08.070 --> 00:05:10.830
These are increasing key sizes

104
00:05:10.830 --> 00:05:12.813
and developing new algorithms

105
00:05:12.813 --> 00:05:15.030
that are quantum resistant.

106
00:05:15.030 --> 00:05:18.900
Increasing the key size adds more permutations

107
00:05:18.900 --> 00:05:22.770
that need to be brute forced to crack the encryption,

108
00:05:22.770 --> 00:05:25.410
making symmetric encryption algorithms

109
00:05:25.410 --> 00:05:27.690
like the Advanced Encryption Standard

110
00:05:27.690 --> 00:05:30.540
or AES more resilient.

111
00:05:30.540 --> 00:05:35.533
For example, moving from AES-128 to AES256

112
00:05:35.533 --> 00:05:39.180
doubles the key length,

113
00:05:39.180 --> 00:05:43.620
but it exponentially increases the number of combinations

114
00:05:43.620 --> 00:05:46.470
a quantum computer would need to attempt

115
00:05:46.470 --> 00:05:49.650
significantly extending the time required

116
00:05:49.650 --> 00:05:51.570
to crack the encryption.

117
00:05:51.570 --> 00:05:55.080
The second strategy for safeguarding data

118
00:05:55.080 --> 00:05:59.100
involves implementing quantum-resistant algorithms,

119
00:05:59.100 --> 00:06:02.310
which researchers are actively developing.

120
00:06:02.310 --> 00:06:06.240
Examples include a lattice-based cryptography

121
00:06:06.240 --> 00:06:10.260
and supersingular isogeny exchanges.

122
00:06:10.260 --> 00:06:12.660
These new algorithms are designed

123
00:06:12.660 --> 00:06:16.140
to withstand a attacks from quantum computers.

124
00:06:16.140 --> 00:06:19.920
Also, the National Institute of Standards and Technology,

125
00:06:19.920 --> 00:06:23.460
or NIST, is currently holding a competition

126
00:06:23.460 --> 00:06:27.330
to select a quantum resistant cryptographic standard

127
00:06:27.330 --> 00:06:30.690
expected to be finalized in the coming years

128
00:06:30.690 --> 00:06:35.040
as it is anticipated that functional quantum computers

129
00:06:35.040 --> 00:06:38.250
could emerge by the year 2030.

130
00:06:38.250 --> 00:06:41.940
We will talk more about post-quantum cryptography

131
00:06:41.940 --> 00:06:44.640
in the next section of this lesson.

132
00:06:44.640 --> 00:06:46.560
Wow, that's intense,

133
00:06:46.560 --> 00:06:50.160
but before we can discuss post-quantum security,

134
00:06:50.160 --> 00:06:52.191
we need to understand the mechanics

135
00:06:52.191 --> 00:06:55.710
and current state of quantum cryptography.

136
00:06:55.710 --> 00:06:59.880
Now, let's learn more about post-quantum cryptography

137
00:06:59.880 --> 00:07:03.600
versus Diffie-Hellman and Elliptic Curve Cryptography.

138
00:07:03.600 --> 00:07:07.320
Post-Quantum Cryptography, or PQC,

139
00:07:07.320 --> 00:07:09.060
is an emerging field

140
00:07:09.060 --> 00:07:12.360
that aims to develop cryptographic algorithms

141
00:07:12.360 --> 00:07:15.360
that can resist the advanced capabilities

142
00:07:15.360 --> 00:07:17.127
of quantum computers.

143
00:07:17.127 --> 00:07:19.320
As we have discussed,

144
00:07:19.320 --> 00:07:21.918
quantum computers are fundamentally different

145
00:07:21.918 --> 00:07:24.030
from traditional computers

146
00:07:24.030 --> 00:07:26.010
because they use qubits,

147
00:07:26.010 --> 00:07:30.300
which can exist in multiple states simultaneously

148
00:07:30.300 --> 00:07:32.400
due to quantum phenomena

149
00:07:32.400 --> 00:07:35.760
like superposition and entanglement.

150
00:07:35.760 --> 00:07:38.040
This allows quantum computers

151
00:07:38.040 --> 00:07:41.250
to perform many calculations at once,

152
00:07:41.250 --> 00:07:45.000
making them capable of solving complex problems

153
00:07:45.000 --> 00:07:48.900
much faster than conventional computers.

154
00:07:48.900 --> 00:07:52.560
This power poses a significant threat

155
00:07:52.560 --> 00:07:55.380
to existing cryptographic methods,

156
00:07:55.380 --> 00:08:00.240
including Diffie-Hellman and Elliptic Curve Cryptography.

157
00:08:00.240 --> 00:08:03.360
Diffie-Hellman and Elliptic Curve Cryptography

158
00:08:03.360 --> 00:08:05.280
are widely used today

159
00:08:05.280 --> 00:08:08.220
because they provide robust security

160
00:08:08.220 --> 00:08:11.670
through complex mathematical operations.

161
00:08:11.670 --> 00:08:15.570
Diffie-Hellman facilitates secure key exchanges,

162
00:08:15.570 --> 00:08:19.260
allowing two parties to establish a shared secret

163
00:08:19.260 --> 00:08:21.780
over an insecure channel.

164
00:08:21.780 --> 00:08:24.780
Elliptic Curve Cryptography, on the other hand,

165
00:08:24.780 --> 00:08:27.720
uses the properties of elliptic curves

166
00:08:27.720 --> 00:08:31.080
to create secure and efficient keys,

167
00:08:31.080 --> 00:08:32.400
making it suitable

168
00:08:32.400 --> 00:08:34.680
for resource-constrained environments

169
00:08:34.680 --> 00:08:36.570
like mobile devices.

170
00:08:36.570 --> 00:08:41.250
However, both methods are vulnerable to quantum attacks

171
00:08:41.250 --> 00:08:44.490
because the underlying mathematical problems

172
00:08:44.490 --> 00:08:48.030
can be solved quickly by quantum computers.

173
00:08:48.030 --> 00:08:51.300
This vulnerability is driving the development

174
00:08:51.300 --> 00:08:53.670
of Post-Quantum Cryptography,

175
00:08:53.670 --> 00:08:56.332
which aims to create encryption methods

176
00:08:56.332 --> 00:08:59.640
that can withstand quantum attacks.

177
00:08:59.640 --> 00:09:03.900
PQC or post-quantum cryptography algorithms

178
00:09:03.900 --> 00:09:06.099
are built on mathematical problems

179
00:09:06.099 --> 00:09:08.026
that are believed to be difficult

180
00:09:08.026 --> 00:09:10.830
for quantum computers to solve,

181
00:09:10.830 --> 00:09:14.760
even with their advanced processing capabilities.

182
00:09:14.760 --> 00:09:17.918
These new algorithms are intended to replace

183
00:09:17.918 --> 00:09:20.880
or complement existing methods

184
00:09:20.880 --> 00:09:24.450
like Diffie-Hellman and Elliptic Curve Cryptography,

185
00:09:24.450 --> 00:09:27.686
ensuring data remains secure in the future

186
00:09:27.686 --> 00:09:30.840
where quantum computing is prevalent.

187
00:09:30.840 --> 00:09:34.620
A critical component of Post-Quantum Cryptography

188
00:09:34.620 --> 00:09:36.960
is lattice-based cryptography,

189
00:09:36.960 --> 00:09:38.910
lattice-based cryptography,

190
00:09:38.910 --> 00:09:41.190
is one of the most promising approaches

191
00:09:41.190 --> 00:09:43.680
to quantum resistant encryption.

192
00:09:43.680 --> 00:09:45.480
Lattice-based cryptography

193
00:09:45.480 --> 00:09:49.770
uses complex, high-dimensional mathematical structures

194
00:09:49.770 --> 00:09:50.730
that are resistant

195
00:09:50.730 --> 00:09:54.240
to both classical and quantum attacks.

196
00:09:54.240 --> 00:09:57.780
Unlike Diffie-Hellman and Elliptic Curve Cryptography,

197
00:09:57.780 --> 00:10:00.480
which rely on discreet logarithms,

198
00:10:00.480 --> 00:10:03.990
lattice-based methods like Learning With Errors

199
00:10:03.990 --> 00:10:06.570
and Ring Learning With Errors

200
00:10:06.570 --> 00:10:10.560
offer a strong security against quantum threats.

201
00:10:10.560 --> 00:10:12.990
These algorithms are being designed

202
00:10:12.990 --> 00:10:16.710
to protect key exchanges, digital signatures,

203
00:10:16.710 --> 00:10:19.980
and data encryption in the quantum era.

204
00:10:19.980 --> 00:10:24.980
So remember, Post-Quantum Cryptography, or PQC,

205
00:10:25.770 --> 00:10:27.570
is an emerging field

206
00:10:27.570 --> 00:10:30.452
focused on creating cryptographic algorithms

207
00:10:30.452 --> 00:10:33.900
that can resist the powerful capabilities

208
00:10:33.900 --> 00:10:35.880
of quantum computers.

209
00:10:35.880 --> 00:10:39.570
Quantum computers, unlike traditional computers,

210
00:10:39.570 --> 00:10:44.010
use qubits that can exist in multiple states at once,

211
00:10:44.010 --> 00:10:48.870
allowing them to perform many calculations simultaneously

212
00:10:48.870 --> 00:10:52.440
and solve complex problems much faster.

213
00:10:52.440 --> 00:10:55.200
This poses a significant threat

214
00:10:55.200 --> 00:10:57.009
to existing encryption methods

215
00:10:57.009 --> 00:11:00.990
like Diffie-Hellman and Elliptic Curve Cryptography,

216
00:11:00.990 --> 00:11:03.246
which rely on mathematical problems

217
00:11:03.246 --> 00:11:07.230
that quantum computers can easily solve.

218
00:11:07.230 --> 00:11:09.180
Post-Quantum Cryptography

219
00:11:09.180 --> 00:11:12.282
aims to develop new cryptographic algorithms

220
00:11:12.282 --> 00:11:15.450
that are resistant to quantum attacks,

221
00:11:15.450 --> 00:11:18.210
ensuring data remains secure

222
00:11:18.210 --> 00:11:21.600
even as quantum technology advances.

223
00:11:21.600 --> 00:11:23.760
As quantum computing evolves,

224
00:11:23.760 --> 00:11:27.000
the adoption of Post-Quantum Cryptography

225
00:11:27.000 --> 00:11:30.030
will be important to protect our data

226
00:11:30.030 --> 00:11:32.553
against these future threats.