WEBVTT 1 00:00:00.090 --> 00:00:01.350 In this lesson, 2 00:00:01.350 --> 00:00:04.920 we will learn about Post-Quantum Implications. 3 00:00:04.920 --> 00:00:06.870 Post-Quantum Implications 4 00:00:06.870 --> 00:00:09.060 involve the future challenges 5 00:00:09.060 --> 00:00:11.190 and necessary adaptations 6 00:00:11.190 --> 00:00:12.840 that we're going to need to take 7 00:00:12.840 --> 00:00:16.620 to secure data against the decryption capabilities 8 00:00:16.620 --> 00:00:18.390 of quantum computers. 9 00:00:18.390 --> 00:00:20.970 Post-quantum implications include, 10 00:00:20.970 --> 00:00:25.320 assessing resistance to quantum computing decryption attack, 11 00:00:25.320 --> 00:00:28.800 and emerging quantum implementations. 12 00:00:28.800 --> 00:00:32.070 Resistance to Quantum Computing Decryption Attack, 13 00:00:32.070 --> 00:00:35.700 refers to the development of cryptographic algorithms 14 00:00:35.700 --> 00:00:39.150 that can withstand the powerful decryption techniques 15 00:00:39.150 --> 00:00:41.340 enabled by quantum computing. 16 00:00:41.340 --> 00:00:45.090 Next, Implementations of Post-Quantum Algorithms 17 00:00:45.090 --> 00:00:49.470 are being developed and tested to replace or augment 18 00:00:49.470 --> 00:00:51.330 the current encryption methods 19 00:00:51.330 --> 00:00:54.000 to ensure that data remains secure, 20 00:00:54.000 --> 00:00:57.360 even as quantum technology advances. 21 00:00:57.360 --> 00:00:59.160 Let's learn more about 22 00:00:59.160 --> 00:01:02.370 resistance to quantum computing decryption attacks, 23 00:01:02.370 --> 00:01:05.190 and emerging implementations. 24 00:01:05.190 --> 00:01:08.700 First, we have resistance to quantum computing 25 00:01:08.700 --> 00:01:10.350 and decryption attacks. 26 00:01:10.350 --> 00:01:13.710 Resistance to quantum computing decryption attacks 27 00:01:13.710 --> 00:01:17.280 focuses on developing cryptographic algorithms 28 00:01:17.280 --> 00:01:21.270 that can withstand the powerful decryption capabilities 29 00:01:21.270 --> 00:01:23.010 of quantum computers. 30 00:01:23.010 --> 00:01:24.810 To counter this threat, 31 00:01:24.810 --> 00:01:29.100 researchers are exploring new cryptographic approaches, 32 00:01:29.100 --> 00:01:31.980 including lattice-based cryptography, 33 00:01:31.980 --> 00:01:33.810 hash-based cryptography, 34 00:01:33.810 --> 00:01:37.290 and multi-variate polynomial cryptography. 35 00:01:37.290 --> 00:01:38.970 Each of these methods, 36 00:01:38.970 --> 00:01:42.030 offers unique mathematical challenges 37 00:01:42.030 --> 00:01:46.080 that quantum computers struggle to solve efficiently, 38 00:01:46.080 --> 00:01:48.270 making them strong contenders 39 00:01:48.270 --> 00:01:52.920 in the development of post-quantum cryptographic methods. 40 00:01:52.920 --> 00:01:54.870 Lattice-based cryptography 41 00:01:54.870 --> 00:01:57.660 relies on the difficulty of problems 42 00:01:57.660 --> 00:02:01.500 related to multi-dimensional grids or lattices. 43 00:02:01.500 --> 00:02:03.000 In simple terms, 44 00:02:03.000 --> 00:02:06.690 imagine a lattice as a three-dimensional grid, 45 00:02:06.690 --> 00:02:08.550 like a stack of boxes 46 00:02:08.550 --> 00:02:11.340 that extends in all directions. 47 00:02:11.340 --> 00:02:15.540 Now, think of this grid not just in three dimensions, 48 00:02:15.540 --> 00:02:17.160 but in many more, 49 00:02:17.160 --> 00:02:20.940 sometimes hundreds or thousands of dimensions. 50 00:02:20.940 --> 00:02:24.990 Quantum computers struggle with these lattice problems 51 00:02:24.990 --> 00:02:27.330 because they are not easily reduced 52 00:02:27.330 --> 00:02:29.880 to the kind of structured problem-solving 53 00:02:29.880 --> 00:02:32.610 that quantum algorithms excel at. 54 00:02:32.610 --> 00:02:35.100 So, lattice-based cryptography 55 00:02:35.100 --> 00:02:38.940 is one of the most promising quantum-resistant approaches, 56 00:02:38.940 --> 00:02:41.100 providing strong security 57 00:02:41.100 --> 00:02:45.450 and versatility for encryption, digital signatures, 58 00:02:45.450 --> 00:02:47.640 and key exchange protocols. 59 00:02:47.640 --> 00:02:51.720 Next, hash-based cryptography builds its security 60 00:02:51.720 --> 00:02:56.340 on the difficulty of reversing cryptographic hash functions. 61 00:02:56.340 --> 00:02:59.160 A hash function takes input data 62 00:02:59.160 --> 00:03:02.370 and converts it into a fixed-size output, 63 00:03:02.370 --> 00:03:05.610 often appearing random and unpredictable. 64 00:03:05.610 --> 00:03:07.470 Hash-based cryptography 65 00:03:07.470 --> 00:03:11.160 uses this property to create digital signatures 66 00:03:11.160 --> 00:03:14.850 that remain secure against quantum attacks. 67 00:03:14.850 --> 00:03:19.020 The idea is that while creating a hash is straightforward, 68 00:03:19.020 --> 00:03:21.810 reversing it or finding another input 69 00:03:21.810 --> 00:03:23.940 that produces the same hash 70 00:03:23.940 --> 00:03:26.280 is computationally intensive, 71 00:03:26.280 --> 00:03:28.470 even for quantum computers. 72 00:03:28.470 --> 00:03:32.370 Finally, multivariate polynomial cryptography 73 00:03:32.370 --> 00:03:34.200 is based on the complexity 74 00:03:34.200 --> 00:03:37.650 of solving systems of nonlinear equations 75 00:03:37.650 --> 00:03:39.630 with multiple variables. 76 00:03:39.630 --> 00:03:42.750 These equations are easy to create, 77 00:03:42.750 --> 00:03:46.830 but extremely difficult to reverse engineer or solve 78 00:03:46.830 --> 00:03:49.230 without specific knowledge. 79 00:03:49.230 --> 00:03:51.090 To better understand this, 80 00:03:51.090 --> 00:03:53.760 imagine you have a locked box 81 00:03:53.760 --> 00:03:55.260 that can only be opened 82 00:03:55.260 --> 00:03:58.020 with a specific combination of numbers, 83 00:03:58.020 --> 00:03:59.850 but instead of a simple code, 84 00:03:59.850 --> 00:04:03.930 you have a complex equation with several unknowns. 85 00:04:03.930 --> 00:04:06.780 This would be like trying to solve a riddle 86 00:04:06.780 --> 00:04:10.770 where each answer depends on multiple other answers. 87 00:04:10.770 --> 00:04:12.300 In this context, 88 00:04:12.300 --> 00:04:14.670 creating the riddle is easy, 89 00:04:14.670 --> 00:04:18.090 you just set up some equations where each variable 90 00:04:18.090 --> 00:04:19.770 interacts with others. 91 00:04:19.770 --> 00:04:23.400 However, solving it without the key knowledge 92 00:04:23.400 --> 00:04:25.230 is nearly impossible, 93 00:04:25.230 --> 00:04:27.960 because every time you change one variable, 94 00:04:27.960 --> 00:04:31.830 it affects many others in unpredictable ways. 95 00:04:31.830 --> 00:04:35.490 So in the context of quantum resistance, 96 00:04:35.490 --> 00:04:38.340 multivariate polynomial cryptography 97 00:04:38.340 --> 00:04:40.950 presents a different kind of problem 98 00:04:40.950 --> 00:04:42.540 that does not align well 99 00:04:42.540 --> 00:04:45.150 with quantum computing capabilities, 100 00:04:45.150 --> 00:04:48.750 making it another promising area of research. 101 00:04:48.750 --> 00:04:52.260 Second, we have emerging implementations. 102 00:04:52.260 --> 00:04:56.340 Beyond the more established methods previously discussed, 103 00:04:56.340 --> 00:04:59.970 two of the most significant emerging implementations 104 00:04:59.970 --> 00:05:02.970 addressing post-quantum implications, 105 00:05:02.970 --> 00:05:05.160 are code-based cryptography 106 00:05:05.160 --> 00:05:07.620 and quantum key distribution. 107 00:05:07.620 --> 00:05:09.840 These approaches are gaining traction 108 00:05:09.840 --> 00:05:11.790 because of their potential 109 00:05:11.790 --> 00:05:14.100 to offer a robust security 110 00:05:14.100 --> 00:05:18.390 in the face of advancing quantum computing capabilities. 111 00:05:18.390 --> 00:05:20.250 Code-based cryptography 112 00:05:20.250 --> 00:05:24.720 relies on the difficulty of decoding random linear codes, 113 00:05:24.720 --> 00:05:27.000 a problem that quantum computers 114 00:05:27.000 --> 00:05:29.580 find hard to solve efficiently. 115 00:05:29.580 --> 00:05:31.860 The McEliece Cryptosystem, 116 00:05:31.860 --> 00:05:34.470 one of the most notable examples, 117 00:05:34.470 --> 00:05:36.630 has been around for decades, 118 00:05:36.630 --> 00:05:39.420 but is now receiving renewed attention 119 00:05:39.420 --> 00:05:43.110 because of its strong resistance to quantum attacks. 120 00:05:43.110 --> 00:05:46.830 Code-based cryptography is particularly suitable 121 00:05:46.830 --> 00:05:49.320 for securing large-scale systems, 122 00:05:49.320 --> 00:05:50.820 such as cloud storage 123 00:05:50.820 --> 00:05:53.460 and secure communication networks. 124 00:05:53.460 --> 00:05:55.770 However, the main challenge 125 00:05:55.770 --> 00:06:00.300 lies in optimizing these algorithms for practical use, 126 00:06:00.300 --> 00:06:03.900 as they often require larger key sizes 127 00:06:03.900 --> 00:06:07.170 compared to traditional encryption methods. 128 00:06:07.170 --> 00:06:10.110 Next, quantum key distribution 129 00:06:10.110 --> 00:06:13.440 represents a fundamentally different approach 130 00:06:13.440 --> 00:06:14.940 to securing data 131 00:06:14.940 --> 00:06:17.940 using the principles of quantum mechanics, 132 00:06:17.940 --> 00:06:22.080 rather than traditional mathematical encryption techniques. 133 00:06:22.080 --> 00:06:24.060 Quantum key distribution, 134 00:06:24.060 --> 00:06:25.710 allows two parties 135 00:06:25.710 --> 00:06:29.970 to securely share a secret encryption key using Qubits, 136 00:06:29.970 --> 00:06:31.680 which are quantum bits. 137 00:06:31.680 --> 00:06:33.960 The unique property of Qubits 138 00:06:33.960 --> 00:06:36.030 is that they cannot be observed 139 00:06:36.030 --> 00:06:39.240 or copied without altering their state, 140 00:06:39.240 --> 00:06:43.650 thus alerting the parties to any eavesdropping attempts. 141 00:06:43.650 --> 00:06:48.240 This makes quantum key distribution theoretically immune 142 00:06:48.240 --> 00:06:50.190 to quantum computing attacks, 143 00:06:50.190 --> 00:06:52.290 offering a level of security 144 00:06:52.290 --> 00:06:56.280 unmatched by conventional cryptographic methods. 145 00:06:56.280 --> 00:06:58.080 Quantum key distribution 146 00:06:58.080 --> 00:07:01.980 is already being tested in high-stakes environments, 147 00:07:01.980 --> 00:07:04.080 such as a financial systems 148 00:07:04.080 --> 00:07:06.180 and government communications, 149 00:07:06.180 --> 00:07:09.780 positioning it as a groundbreaking technology 150 00:07:09.780 --> 00:07:13.860 for secure key exchange in a post-quantum world. 151 00:07:13.860 --> 00:07:18.860 So remember, post-quantum implications involve adapting 152 00:07:19.500 --> 00:07:21.570 and securing data against 153 00:07:21.570 --> 00:07:26.130 the advanced decryption capabilities of quantum computers. 154 00:07:26.130 --> 00:07:30.360 This includes developing cryptographic algorithms 155 00:07:30.360 --> 00:07:33.570 that can resist quantum decryption attacks, 156 00:07:33.570 --> 00:07:36.930 such as lattice-based, hash-based, 157 00:07:36.930 --> 00:07:40.290 and multi-variate polynomial cryptography. 158 00:07:40.290 --> 00:07:44.160 These algorithms present mathematical challenges 159 00:07:44.160 --> 00:07:47.070 that quantum computers struggle to solve, 160 00:07:47.070 --> 00:07:51.480 making them strong contenders for future data security. 161 00:07:51.480 --> 00:07:56.160 Next, emerging implementations like code-based cryptography 162 00:07:56.160 --> 00:08:00.240 and quantum key distribution are also being tested 163 00:08:00.240 --> 00:08:02.610 to offer robust security 164 00:08:02.610 --> 00:08:05.190 in the face of quantum threats. 165 00:08:05.190 --> 00:08:07.470 Together, these approaches 166 00:08:07.470 --> 00:08:11.190 represent the cutting-edge of research and development 167 00:08:11.190 --> 00:08:12.720 in safeguarding data 168 00:08:12.720 --> 00:08:16.593 against the eminent power of quantum computing.