chapter 12 cryptography explained. search problems specified by an algorithm c two inputs ◦ i is...
TRANSCRIPT
![Page 1: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/1.jpg)
Chapter 12Chapter 12Cryptography Explained
![Page 2: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/2.jpg)
Search ProblemsSearch ProblemsSpecified by an algorithm CTwo inputs
◦I is the instance.◦S is the solution.◦Must complete in polynomial time I.
S is a solution to I if and only if C(I,S) is True.
![Page 3: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/3.jpg)
NP-Complete ProblemsNP-Complete Problems
A class of search problems◦Traveling salesman problem
Time limited.
◦Rudrata: Knight’s Tour on a chess board. Cover all 64 squares?
◦Euler: Graph Theory Cross a bridge only once.
◦Knapsack Add maximum items below a limit.
![Page 4: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/4.jpg)
Traveling Salesman Traveling Salesman ProblemProblem
![Page 5: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/5.jpg)
Knight’s TourKnight’s Tour
![Page 6: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/6.jpg)
Knapsack ProblemKnapsack Problem
![Page 7: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/7.jpg)
Graph TheoryGraph Theory
![Page 8: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/8.jpg)
GoalsGoalsComplexity
◦Difficult to solve.◦Number of possible solutions large.◦Brute force solution expected to be
infeasible.Satisfiable
◦Assign values to a formula so that it is true.◦(V1) && (v2 || v3) && (!v3 || !v1)
Solvable◦Simple approach to solve problem.
![Page 9: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/9.jpg)
Figure 12-1 Clique Subgraphs in a Graph.Clique: every vertex connected to every other vertex.v1, v2, v7, v8 form clique size = 4.
![Page 10: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/10.jpg)
Figure 12-2 Simulating Nondeterminism.
![Page 11: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/11.jpg)
Figure 12-3 Hierarchies of Complexity Classes.Problem space. Some solvable in polynomial time (P).Some are beyond Polynomial time (EXP).Class NP between P and EXP.
![Page 12: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/12.jpg)
Diffusion, Confusion, Diffusion, Confusion, Substitution, PermutationSubstitution, PermutationDiffusion
◦ Spread the effect of a change to plaintext throughout the cipher text.
Confusion◦ Relationship between plain and cipher text
should be as random and not apparent.
Substitution (Confusion) S-Boxes◦ Replace one character with another.
Permutation (transposition) P-Boxes◦ Provide confusion by rearranging the
characters in the text.
![Page 13: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/13.jpg)
Figure 12-4 Substitutions and Permutations.
Substitutions
Permutations
![Page 14: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/14.jpg)
Figure 12-5 Key Distribution in Pieces.
![Page 15: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/15.jpg)
Figure 12-6 Distribution Center for Encrypted Information.
Key Clearinghouse, centralize key distribution.
![Page 16: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/16.jpg)
Figure 12-7 Cycles of Substitution and PermutationDES: strength from repeating substitution and permutations.
![Page 17: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/17.jpg)
Figure 12-8 Product Ciphers.
Two weak but complementary ciphers can be made more secure by being applied together, the product of the two ciphers.
![Page 18: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/18.jpg)
Figure 12-9 A Cycle in the DES.
![Page 19: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/19.jpg)
Figure 12-10 Types of Permutations.
![Page 20: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/20.jpg)
Figure 12-11 Details of a Cycle.
![Page 21: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/21.jpg)
Figure 12-12 Pattern of Expansion Permutation.
![Page 22: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/22.jpg)
Figure 12-13 Structure of the AES.
![Page 23: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/23.jpg)
Figure 12-14 Knapsack for Encryption.
![Page 24: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/24.jpg)
Figure 12-15 Example of Solving a Simple Knapsack.
![Page 25: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/25.jpg)
Figure 12-16 Graph of Change of Merkle–Hellman Knapsack Function.
![Page 26: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/26.jpg)
Figure 12-17 Coinciding Discontinuities.
![Page 27: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/27.jpg)
Elliptical Curve Elliptical Curve CryptographyCryptography
![Page 28: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/28.jpg)
Elliptical Curve Elliptical Curve CryptographyCryptographyOffers considerably greater security for a given
key sizeThe smaller key size also makes possible much
more compact implementations for a given level of security, which means faster cryptographic operations, running on smaller chips or more compact software. This means less heat production and less power consumption — all of which is of particular advantage in constrained devices, but of some advantage anywhere.
There are extremely efficient, compact hardware implementations available for ECC exponentiation operations, offering potential reductions in implementation footprint even beyond those due to the smaller key length alone.
![Page 29: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/29.jpg)
Quantum CryptographyQuantum Cryptography
![Page 30: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/30.jpg)
Quantum CryptographyQuantum Cryptography
Instead of depending on the computational difficulty of cracking one-way functions, quantum encryption creates uncrackable codes that employ the laws of physics to guarantee security.
Different quantum states, such as photon polarization, can be used to represent 1s and 0s in a manner that cannot be observed without the receiver's discovering it.
For instance, if hackers observe a polarized photon, then 50 percent of the time they will scramble the result, making it impossible to hide the eavesdropping attempt from the receiver.
![Page 31: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/31.jpg)
Figure 12-18 Transmission of Photons.
![Page 32: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/32.jpg)
Figure 12-19 Results Interpreted Through Filters.
![Page 33: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/33.jpg)
Figure 12-20 Filters Used.
![Page 34: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/34.jpg)
Figure 12-21 Correct Filters.
![Page 35: Chapter 12 Cryptography Explained. Search Problems Specified by an algorithm C Two inputs ◦ I is the instance. ◦ S is the solution. ◦ Must complete in](https://reader037.vdocuments.site/reader037/viewer/2022110400/56649dda5503460f94acfc03/html5/thumbnails/35.jpg)
Figure 12-22 Correct Results.