Muutke küpsiste eelistusi

Secret Key Cryptography [Pehme köide]

  • Formaat: Paperback / softback, 344 pages, kõrgus x laius x paksus: 236x187x22 mm, kaal: 595 g
  • Ilmumisaeg: 19-Sep-2022
  • Kirjastus: Manning Publications
  • ISBN-10: 1633439798
  • ISBN-13: 9781633439795
  • Formaat: Paperback / softback, 344 pages, kõrgus x laius x paksus: 236x187x22 mm, kaal: 595 g
  • Ilmumisaeg: 19-Sep-2022
  • Kirjastus: Manning Publications
  • ISBN-10: 1633439798
  • ISBN-13: 9781633439795
Explore the fascinating and rich world of Secret Key cryptography! This book provides practical methods for encrypting messages, an interesting and entertaining historical perspective, and an incredible collection of ciphers and codesincluding 30 unbreakable methods.

In   Secret Key Cryptography: Ciphers, from simple to unbreakable  you will:





Measure the strength of your ciphers and learn how to guarantee their security Construct and incorporate data-compression codes Generate true random numbers in bulk Construct huge primes and safe primes Add an undetectable backdoor to a cipher Defeat hypothetical ultracomputers that could be developed decades from now Construct 30 unbreakable ciphers



Secret Key Cryptography  gives you a toolbox of cryptographic techniques and Secret Key methods. The book's simple, non-technical language is easy to understand and accessible for any reader, even without the advanced mathematics normally required for cryptography. You'll learn how to create and solve ciphers, as well as how to measure their strength. As you go, you'll explore both historic ciphers and groundbreaking new approachesincluding a never-before-seen way to implement the uncrackable One-Time Pad algorithm. about the technology Secret Key cryptography is the backbone of all modern computing infrastructure. Secret Key ciphers use the same key to encrypt and decrypt messages. Properly designed, these algorithms are efficient and practical. Some Secret Key approaches are uncrackable, even under attacks backed by supercomputers or quantum technology! about the book Secret Key Cryptography  teaches anyone how to create a wide range of cipherseven if you have no background in math or creating codes. You'll combine Secret Key techniques to achieve ciphers that are effectively uncrackable and avoid common pitfalls that result in strong-looking but weak ciphers. The book reveals scores of different cipher methods, including both historic examples and current innovations in the field. RETAIL SELLING POINTS Measure the strength of your ciphers and learn how to guarantee their security Construct and incorporate data-compression codes Generate true random numbers in bulk Construct huge primes and safe primes Add an undetectable backdoor to a cipher Defeat hypothetical ultra computers that could be developed decades from now Construct 30 unbreakable ciphers AUDIENCE For professional engineers, computer scientists, and cryptography hobbyists. No advanced math knowledge is required  
Foreword xi
Preface xiii
Acknowledgments xv
About this book xvii
About the author xix
About the cover illustration xx
1 Introduction
1(3)
2 What is cryptography?
4(12)
2.1 Unbreakable ciphers
5(1)
2.2 Types of cryptography
6(2)
2.3 Symmetric vs. asymmetric cryptography
8(1)
2.4 Block ciphers vs. stream ciphers
9(1)
2.5 Mechanical vs. digital
9(3)
2.6 Why choose Secret Key?
12(2)
2.7 Why build your own?
14(2)
3 Preliminary concepts
16(7)
3.1 Bits and bytes
16(1)
3.2 Functions and operators
17(1)
3.3 Boolean operators
18(1)
3.4 Number bases
19(1)
3.5 Prime numbers
20(1)
3.6 Modular arithmetic
21(2)
4 Cryptographer's toolbox
23(11)
4.1 Rating system
24(1)
4.2 Substitution
25(1)
Huffman codes
25(1)
4.3 Transposition
26(1)
4.4 Fractionation
27(2)
4.5 Random number generators
29(2)
Chained digit generator
30(1)
4.6 Useful combinations, wasteful combinations
31(3)
Bazeries type 4 cipher
32(2)
5 Substitution ciphers
34(30)
5.1 Simple substitution
35(4)
5.2 Mixing the alphabet
39(3)
5.3 Nomenclators
42(1)
5.4 Polyalphabetic substitution
42(1)
5.5 The Belaso cipher
43(1)
5.6 The Kasiski method
44(3)
5.7 Index of Coincidence
47(2)
5.8 Index of Coincidence, again
49(1)
5.9 Solving a polyalphabetic cipher
49(6)
Solving a Belaso cipher
49(3)
Solving a Vigenere cipher
52(2)
Solving a general polyalphabetic cipher
54(1)
5.10 Autokey
55(2)
5.11 Running key
57(2)
5.12 Simulated rotor machines
59(5)
Single-rotor machine
60(1)
Three-rotor machine
61(1)
Eight-rotor machine
62(2)
6 Countermeasures
64(13)
6.1 Double encipherment
64(1)
6.2 Null characters
65(1)
6.3 Interrupted key
66(2)
6.4 Homophonic substitution
68(2)
Cipher 5858
69(1)
6.5 Bigram and trigram substitution
70(1)
6.6 Hiding messages in images
70(2)
6.7 Adding null bits
72(2)
6.8 Merging multiple messages
74(1)
6.9 Embedding a message in a file
75(2)
7 Transposition
77(17)
7.1 Route transposition
77(2)
7.2 Columnar transposition
79(5)
Cysquare
82(1)
Word transposition
83(1)
7.3 Double columnar transposition
84(1)
7.4 Cycling columnar transposition
85(1)
7.5 Random number transposition
86(2)
7.6 Selector transposition
88(1)
7.7 Key transposition
88(3)
7.8 Halving transposition
91(1)
7.9 Multiple anagramming
92(2)
8 Jefferson Wheel Cypher
94(6)
8.1 Known-word solution
96(1)
8.2 Ciphertext-only solution
97(3)
9 Fractionation
100(24)
9.1 Polybius square
100(1)
9.2 Playfair
101(5)
Solving a Play fair cipher
104(1)
Strengthening a Playfair cipher
104(2)
9.3 Two Square
106(1)
9.4 Three Square
107(2)
9.5 Four Square
109(2)
9.6 Bifid
111(3)
Conjugated matrix bifid
113(1)
9.7 Diagonal bifid
114(1)
9.8 6 × 6 squares
114(1)
9.9 Trifid
115(1)
9.10 Three Cube
116(2)
9.11 Rectangular grids
118(1)
9.12 Hexadecimal fractionation
119(1)
9.13 Bitwise fractionation
120(2)
Cyclic 8 × N
121(1)
9.14 Other fractionation
122(1)
9.15 Stronger blocks
123(1)
10 Variable-length fractionation
124(22)
10.1 Morse3
125(1)
10.2 Monom-Binom
125(3)
10.3 Periodic lengths
128(1)
10.4 Huffman Substitution
129(2)
10.5 Post tag systems
131(6)
Same-length tags
133(1)
Different-length tags
134(2)
Multiple alphabets
136(1)
Short and long moves
136(1)
10.6 Fractionation in other bases
137(1)
10.7 Text compression
137(9)
Lempel-Ziv
137(3)
Arithmetic coding
140(3)
Adaptive arithmetic coding
143(3)
11 Block ciphers
146(23)
11.1 Substitution-permutation network
147(1)
11.2 Data Encryption Standard (DES)
148(5)
Double DES
150(1)
Triple DES
150(1)
Fast bit transposition
151(1)
Short blocks
152(1)
11.3 Matrix multiplication
153(1)
11.4 Matrix multiplication
154(1)
11.5 Advanced Encryption Standard (AES)
155(1)
11.6 Fixed vs. keyed substitution
156(1)
11.7 Involutory ciphers
157(3)
Involutory substitution
158(1)
Involutory polyalphabetic substitution
158(1)
Involutory transposition
158(1)
Involutory block cipher
159(1)
Example, poly triple flip
160(1)
11.8 Variable-length substitutions
160(1)
11.9 Ripple ciphers
161(2)
11.10 Block chaining
163(4)
Polyalphabetic chaining
165(1)
Enciphered chaining
165(1)
Lagged chaining
165(1)
Interior taps
165(1)
Key chaining
166(1)
Chaining mode summary
166(1)
Chaining short blocks
166(1)
Chaining variable-length blocks
166(1)
11.11 Strengthening a block cipher
167(2)
12 Principles for secure encryption
169(28)
12.1 Large blocks
169(1)
12.2 Long keys
170(2)
Redundant keys
171(1)
12.3 Confusion
172(17)
Correlation coefficient
174(3)
Base-26 linearity
177(3)
Base-256 linearity
180(1)
Adding a backdoor
181(3)
Condensed linearity
184(1)
Hybrid linearity
185(1)
Constructing an S-box
185(3)
S-box with a key
188(1)
12.4 Diffusion
189(3)
12.5 Saturation
192(5)
13 Stream ciphers
197(26)
13.1 Combining functions
198(1)
13.2 Random numbers
199(1)
13.3 Multiplicative congruential generator
200(3)
13.4 Linear congruential generator
203(1)
13.5 Chained exclusive-OR generator
204(1)
13.6 Chained addition generator
205(1)
13.7 Shift and XOR generator
206(1)
13.8 FRand
207(1)
13.9 Mersenne Twister
208(1)
13.10 Linear feedback shift registers
208(2)
13.11 Estimating the period
210(1)
13.12 Strengthening a generator
211(1)
13.13 Combining generators
212(3)
13.14 True random numbers
215(2)
Lagged linear addition
216(1)
Layering images
216(1)
13.15 Refreshing the random bytes
217(2)
13.16 Synchronized key streams
219(1)
13.17 Hash functions
220(3)
14 One-time pad
223(13)
14.1 The Vernam cipher
224(2)
14.2 Key supply
226(2)
Circulating key
227(1)
Combined key
227(1)
Selection key
227(1)
14.3 Indicators
228(1)
14.4 Diffie-Hellman key exchange
229(7)
Constructing large primes, old
230(1)
Constructing large primes, new
231(5)
15 Matrix methods
236(28)
15.1 Inverting a matrix
237(2)
15.2 Transposition matrix
239(1)
15.3 The Hill cipher
240(2)
15.4 Hill cipher, computer versions
242(3)
15.5 Large integer multiplication
245(2)
Multiplying and dividing congruences
246(1)
15.6 Solving a linear congruence
247(4)
Reducing a congruence
248(1)
Half-and-Half Rule
248(1)
Laddering
249(1)
Continued fractions
250(1)
15.7 Large integer ciphers
251(2)
15.8 Small integer multiplication
253(1)
15.9 Multiplication modulo P
254(2)
15.10 Change of base
256(1)
15.11 Rings
257(1)
15.12 Matrices over a ring
258(1)
15.13 Constructing a ring
259(3)
Gaussian integers
261(1)
Quaternions
261(1)
15.14 Finding an invertible matrix
262(2)
16 Three pass protocol
264(5)
16.1 Shamir's method
266(1)
16.2 Massey-Omura
266(1)
16.3 Discrete logarithm
267(2)
Logarithms
267(1)
Powers of primes
267(1)
Crash
268(1)
Factoring
268(1)
16 Estimates
269(9)
16.4 Matrix three pass protocol
270(6)
Commutative family of matrices
271(1)
Multiplicative order
271(1)
Maximum order
272(1)
Emily attacks
272(1)
Non-commutative ring
273(1)
Solving bilinear equations
273(2)
Weaklings
275(1)
Making it fast
275(1)
16.5 Two-sided three pass protocol
276(2)
17 Codes
278(4)
17.1 The Joker
279(3)
18 Quantum computers
282(17)
18.1 Superposition
283(1)
18.2 Entanglement
284(1)
18.3 Error correction
285(1)
18.4 Measurement
285(1)
18.5 Quantum 3-stage protocol
286(1)
18.6 Quantum key exchange
286(1)
18.7 Grover's algorithm
287(1)
18.8 Equations
287(3)
Transpositions
288(1)
Substitutions
288(1)
Karnaugh maps
289(1)
Intermediate variables
289(1)
Known plaintext
290(1)
18.9 Minimization
290(3)
Hill climbing
291(1)
Mille sommets
291(1)
Simulated annealing
292(1)
18.10 Quantum simulated annealing
293(1)
18.11 Quantum factoring
294(1)
18.12 Ultracomputers
294(5)
Substitution
294(1)
Random numbers
295(1)
Ultrasubstitution cipher US-A
296(1)
Ultrastream cipher US-B
297(2)
Fun pages 299(3)
Challenge 302(2)
Epilogue 304(3)
Index 307