10.6. Terms and Concepts
| computational complexity, 630 | reducibility, 639 |
| NP-complete problems, 631 | Fermat's theorem, 641 |
| satisfiability problem, 631 | confusion, 642 |
| knapsack problem, 631 | diffusion, 642 |
| clique problem, 632 | Data Encryption Standard (DES), 644 |
| complexity class P, 633 | substitution, 645 |
| complexity class NP, 633 | permutation, 645 |
| nondeterministic Turing machine, 633 | expansion permutation, 645 |
| inverse, 637 | S-box, 650 |
| divisor, 637 | P-box, 650 |
| prime number, 637 | weak DES key, 657 |
| composite number, 637 | differential cryptanalysis, 658 |
| greatest common divisor, 637 | Advanced Encryption System (AES), 660 |
| Euclidean algorithm, 638 | |
| modular arithmetic, 638 | substitute byte, 661 |
| commutative ring, 639 | shift row, 662 |
| Galois field, 639 | mix column, 662 |
| associativity, 639 | add subkey, 662 ... |
Get Security in Computing, Third Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
