Secret Key Cryptography: Ciphers, from simple to unbreakable
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 codes—including 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 approaches—including a never-before-seen way to implement the uncrackable One-Time Pad algorithm.

Whoever you are, this book is for you! History buffs will love seeing the evolution of sophisticated cryptographic methods, hobbyists will get a gentle introduction to cryptography, and engineers and computer scientists will learn the principles of constructing secure ciphers. Even professional cryptographers will find a range of new methods and concepts never published before.

About the technology
From the Roman empire’s Caesar cipher to the WWII Enigma machine, secret messages have influenced the course of history. Today, Secret Key cryptography is the backbone of all modern computing infrastructure. Properly designed, these algorithms are efficient and practical. Some are actually unbreakable, even using supercomputers or quantum technology!

About the book
Secret Key Cryptography teaches you how to create Secret Key ciphers, ranging from simple pen-and-paper methods to advanced techniques used in modern computer-based cryptography. It reveals both historic examples and current innovations. You’ll learn how to efficiently encrypt large files with fast stream ciphers, discover alternatives to AES encryption, and avoid strong-looking but weak ciphers. Simple language and fun-to-solve mini-ciphers make learning serious concepts easy and engaging.

What's inside

    Construct 30 unbreakable ciphers
    Measure the strength of your ciphers and guarantee their security
    Add an undetectable backdoor to a cipher
    Defeat hypothetical ultracomputers of the future

About the reader
For professional engineers, computer scientists, and cryptography hobbyists. No advanced math knowledge is required.

About the author
Frank Rubin has been doing cryptography for over 50 years. He holds an MS in Mathematics, and a PhD in Computer Science.

Table of Contents

1 Introduction
2 What is cryptography?
3 Preliminary concepts
4 Cryptographer’s toolbox
5 Substitution ciphers
6 Countermeasures
7 Transposition
8 Jefferson Wheel Cypher
9 Fractionation
10 Variable-length fractionation
11 Block ciphers
12 Principles for secure encryption
13 Stream ciphers
14 One-time pad
15 Matrix methods
16 Three pass protocol
17 Codes
18 Quantum computers
"1140862206"
Secret Key Cryptography: Ciphers, from simple to unbreakable
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 codes—including 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 approaches—including a never-before-seen way to implement the uncrackable One-Time Pad algorithm.

Whoever you are, this book is for you! History buffs will love seeing the evolution of sophisticated cryptographic methods, hobbyists will get a gentle introduction to cryptography, and engineers and computer scientists will learn the principles of constructing secure ciphers. Even professional cryptographers will find a range of new methods and concepts never published before.

About the technology
From the Roman empire’s Caesar cipher to the WWII Enigma machine, secret messages have influenced the course of history. Today, Secret Key cryptography is the backbone of all modern computing infrastructure. Properly designed, these algorithms are efficient and practical. Some are actually unbreakable, even using supercomputers or quantum technology!

About the book
Secret Key Cryptography teaches you how to create Secret Key ciphers, ranging from simple pen-and-paper methods to advanced techniques used in modern computer-based cryptography. It reveals both historic examples and current innovations. You’ll learn how to efficiently encrypt large files with fast stream ciphers, discover alternatives to AES encryption, and avoid strong-looking but weak ciphers. Simple language and fun-to-solve mini-ciphers make learning serious concepts easy and engaging.

What's inside

    Construct 30 unbreakable ciphers
    Measure the strength of your ciphers and guarantee their security
    Add an undetectable backdoor to a cipher
    Defeat hypothetical ultracomputers of the future

About the reader
For professional engineers, computer scientists, and cryptography hobbyists. No advanced math knowledge is required.

About the author
Frank Rubin has been doing cryptography for over 50 years. He holds an MS in Mathematics, and a PhD in Computer Science.

Table of Contents

1 Introduction
2 What is cryptography?
3 Preliminary concepts
4 Cryptographer’s toolbox
5 Substitution ciphers
6 Countermeasures
7 Transposition
8 Jefferson Wheel Cypher
9 Fractionation
10 Variable-length fractionation
11 Block ciphers
12 Principles for secure encryption
13 Stream ciphers
14 One-time pad
15 Matrix methods
16 Three pass protocol
17 Codes
18 Quantum computers
36.99 In Stock
Secret Key Cryptography: Ciphers, from simple to unbreakable

Secret Key Cryptography: Ciphers, from simple to unbreakable

by Frank Rubin
Secret Key Cryptography: Ciphers, from simple to unbreakable

Secret Key Cryptography: Ciphers, from simple to unbreakable

by Frank Rubin

eBook

$36.99 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

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 codes—including 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 approaches—including a never-before-seen way to implement the uncrackable One-Time Pad algorithm.

Whoever you are, this book is for you! History buffs will love seeing the evolution of sophisticated cryptographic methods, hobbyists will get a gentle introduction to cryptography, and engineers and computer scientists will learn the principles of constructing secure ciphers. Even professional cryptographers will find a range of new methods and concepts never published before.

About the technology
From the Roman empire’s Caesar cipher to the WWII Enigma machine, secret messages have influenced the course of history. Today, Secret Key cryptography is the backbone of all modern computing infrastructure. Properly designed, these algorithms are efficient and practical. Some are actually unbreakable, even using supercomputers or quantum technology!

About the book
Secret Key Cryptography teaches you how to create Secret Key ciphers, ranging from simple pen-and-paper methods to advanced techniques used in modern computer-based cryptography. It reveals both historic examples and current innovations. You’ll learn how to efficiently encrypt large files with fast stream ciphers, discover alternatives to AES encryption, and avoid strong-looking but weak ciphers. Simple language and fun-to-solve mini-ciphers make learning serious concepts easy and engaging.

What's inside

    Construct 30 unbreakable ciphers
    Measure the strength of your ciphers and guarantee their security
    Add an undetectable backdoor to a cipher
    Defeat hypothetical ultracomputers of the future

About the reader
For professional engineers, computer scientists, and cryptography hobbyists. No advanced math knowledge is required.

About the author
Frank Rubin has been doing cryptography for over 50 years. He holds an MS in Mathematics, and a PhD in Computer Science.

Table of Contents

1 Introduction
2 What is cryptography?
3 Preliminary concepts
4 Cryptographer’s toolbox
5 Substitution ciphers
6 Countermeasures
7 Transposition
8 Jefferson Wheel Cypher
9 Fractionation
10 Variable-length fractionation
11 Block ciphers
12 Principles for secure encryption
13 Stream ciphers
14 One-time pad
15 Matrix methods
16 Three pass protocol
17 Codes
18 Quantum computers

Product Details

ISBN-13: 9781638351245
Publisher: Manning
Publication date: 08/30/2022
Sold by: SIMON & SCHUSTER
Format: eBook
Pages: 344
File size: 12 MB
Note: This product may take a few minutes to download.

About the Author

Frank Rubin has an MS in Mathematics, and a PhD in Computer Science. He worked for 30 years at IBM in the Design Automation field, and has been doing cryptography for over 50 years. He has been an editor of Cryptologia and other publications, has written dozens of papers on cryptography, mathematics and computer algorithms, and has created thousands of mathematical puzzles.

Table of Contents

Foreword xi

Preface xiii

Acknowledgments xv

About this book xvii

About the author xix

About the cover illustration xx

1 Introduction 1

2 What is cryptography? 4

2.1 Unbreakable ciphers 5

2.2 Types of cryptography 6

2.3 Symmetric vs. asymmetric cryptography 8

2.4 Block ciphers vs. stream ciphers 9

2.5 Mechanical vs. digital 9

2.6 Why choose Secret Key? 12

2.7 Why build your own? 14

3 Preliminary concepts 16

3.1 Bits and bytes 16

3.2 Functions and operators 17

3.3 Boolean operators 18

3.4 Number bases 19

3.5 Prime numbers 20

3.6 Modular arithmetic 21

4 Cryptographer's toolbox 23

4.1 Rating system 24

4.2 Substitution 25

Huffman codes 25

4.3 Transposition 26

4.4 Fractionation 27

4.5 Random number generators 29

Chained digit generator 30

4.6 Useful combinations, wasteful combinations 31

Bazeries type 4 cipher 32

5 Substitution ciphers 34

5.1 Simple substitution 35

5.2 Mixing the alphabet 39

5.3 Nomenclators 42

5.4 Polyalphabetic substitution 42

5.5 The Belaso cipher 43

5.6 The Kasiski method 44

5.7 Index of Coincidence 47

5.8 Index of Coincidence, again 49

5.9 Solving a polyalphabetic cipher 49

Solving a Belaso cipher 49

Solving a Vigenère cipher 52

Solving a general polyalphabetic cipher 54

5.10 Autokey 55

5.11 Running key 57

5.12 Simulated rotor machines 59

Single-rotor machine 60

Three-rotor machine 61

Eight-rotor machine 62

6 Countermeasures 64

6.1 Double encipherment 64

6.2 Null characters 65

6.3 Interrupted key 66

6.4 Homophonic substitution 68

Cipher 5858 69

6.5 Bigram and trigram substitution 70

6.6 Hiding messages in images 70

6.7 Adding null bits 72

6.8 Merging multiple messages 74

6.9 Embedding a message in a file 75

7 Transposition 77

7.1 Route transposition 77

7.2 Columnar transposition 79

Cysquare 82

Word transposition 83

7.3 Double columnar transposition 84

7.4 Cycling columnar transposition 85

7.5 Random number transposition 86

7.6 Selector transposition 88

7.7 Key transposition 88

7.8 Halving transposition 91

7.9 Multiple anagramming 92

8 Jefferson Wheel Cypher 94

8.1 Known-word solution 96

8.2 Cipher text-only solution 97

9 Fractionation 100

9.1 Polybius square 100

9.2 Playfair 101

Solving a Playfair cipher 104

Strengthening a Playfair cipher 104

9.3 Two Square 106

9.4 Three Square 107

9.5 Four Square 109

9.6 Bifid 111

Conjugated matrix bifid 113

9.7 Diagonal bifid 114

9.8 6×6 squares 114

9.9 Trifid 115

9.10 Three Cube 116

9.11 Rectangular grids 118

9.12 Hexadecimal fractionation 119

9.13 Bitwise fractionation 120

Cyclic 8×N 121

9.14 Other fractionation 122

9.15 Stronger blocks 123

10 Variable-length fractionation 124

10.1 Morse3 125

10.2 Monom-Binom 125

10.3 Periodic lengths 128

10.4 Huffman Substitution 129

10.5 Post tag systems 131

Same-length tags 133

Different-length tags 134

Multiple alphabets 136

Short and long moves 136

10.6 Fractionation in other bases 137

10.7 Text compression 137

Lempel-Ziv 137

Arithmetic coding 140

Adaptive arithmetic coding 143

11 Block ciphers 146

11.1 Substitution-permutation network 147

11.2 Data Encryption Standard (DES) 148

Double DES 150

Triple DES 150

Fast bit transposition 151

Short blocks 152

11.3 Matrix multiplication 153

11.4 Matrix multiplication 154

11.5 Advanced Encryption Standard (AES) 155

11.6 Fixed vs. keyed substitution 156

11.7 Involutory ciphers 157

Involulory substitution 158

Involutory polyalphabetic substitution 158

Involutory transposition 158

Involutory block cipher 159

Example, poly triple flip 160

11.8 Variable-length substitutions 160

11.9 Ripple ciphers 161

11.10 Block chaining 163

Polyalphabetic chaining 165

Enciphered chaining 165

Lagged chaining 165

Interior taps 165

Key chaining 166

Chaining mode summary 166

Chaining short blocks 166

Chaining variable-length blocks 166

11.11 Strengthening a block cipher 167

12 Principles for secure encryption 169

12.1 Large blocks 169

12.2 Long keys 170

Redundant keys 171

12.3 Confusion 172

Correlation coefficient 174

Base-26 linearity 177

Base-256 linearity 180

Adding a backdoor 181

Condensed linearity 184

Hybrid linearity 185

Constructing an S-box 185

S-box with a key 188

12.4 Diffusion 189

12.5 Saturation 192

13 Stream ciphers 197

13.1 Combining functions 198

13.2 Random numbers 199

13.3 Multiplicative congruential generator 200

13.4 Linear congruential generator 203

13.5 Chained exclusive-OR generator 204

13.6 Chained addition generator 205

13.7 Shift and XOR generator 206

13.8 FRand 207

13.9 Mersenne Twister 208

13.10 Linear feedback shift registers 208

13.11 Estimating the period 210

13.12 Strengthening a generator 211

13.13 Combining generators 212

13.14 True random numbers 215

Lagged linear addition 216

Layering images 216

13.15 Refreshing the random bytes 217

13.16 Synchronized key streams 219

13.17 Hash functions 220

14 One-time pad 223

14.1 The Vernam cipher 224

14.2 Key supply 226

Circulating key 227

Combined key 227

Selection key 227

14.3 Indicators 228

14.4 Diffie-Hellman key exchange 229

Constructing large primes, old 230

Constructing large primes, new 231

15 Matrix methods 236

15.1 Inverting a matrix 237

15.2 Transposition matrix 239

15.3 The Hill cipher 240

15.4 Hill cipher, computer versions 242

15.5 Large integer multiplication 245

Multiplying and dividing congruences 246

15.6 Solving a linear congruence 247

Reducing a congruence 248

Half and-Half Rule 248

Laddering 249

Continued fractions 250

15.7 Large integer ciphers 251

15.8 Small integer multiplication 253

15.9 Multiplication modulo P 254

15.10 Change of base 256

15.11 Rings 257

15.12 Matrices over a ring 258

15.13 Constructing a ring 259

Gaussian integers 261

Quaternions 261

15.14 Finding an invertible matrix 262

16 Three pass protocol 264

16.1 Shamir's method 266

16.2 Massey-Omura 266

16.3 Discrete logarithm 267

Logarithms 267

Powers of primes 267

Crash 268

Factoring 268

Estimates 269

16.4 Matrix three pass protocol 270

Commutative family of matrices 271

Multiplicative order 271

Maximum order 272

Emily attacks 272

Non-commutative ring 273

Solving bilinear equations 273

Weaklings 275

Making it fast 275

16.5 Two-sided three pass protocol 276

17 Codes 278

17.1 The Joker 279

18 Quantum computers 282

18.1 Superposition 283

18.2 Entanglement 284

18.3 Error correction 285

18.4 Measurement 285

18.5 Quantum 3-stage protocol 286

18.6 Quantum key exchange 286

18.7 Grover's algorithm 287

18.8 Equations 287

Transpositions 288

Substitutions 288

Karnaugh maps 289

Intermediate variables 289

Known plaintext 290

18.9 Minimization 290

Hill climbing 291

Mille sommets 291

Simulated annealing 292

18.10 Quantum simulated annealing 293

18.11 Quantum factoring 294

18.12 Ultracomputers 294

Substitution 294

Random numbers 295

Ultra-substitution cipher US-A 296

Ultrastream cipher US-B 297

Fun pages 299

Challenge 302

Epilogue 304

Index 307

From the B&N Reads Blog

Customer Reviews