In-depth introduction to cryptography-Principles and Applications of common encryption technologies

In-depth introduction to cryptography-Principles and Applications of common encryption technologies
Basic Information

• Original Title: Understanding Cryptography: a textbook for students and practitioners

• Author:Christof paar [Us] Jan pelzl
• Translator: Ma xiaoting
• Series Name:Classic Security Technology Translation
• Press: Tsinghua University Press
• ISBN:9787302296096
• Mounting time:
• Published on: February 1, September 2012
• Start: 16
• Page number: 1
• Version: 1-1
• Category: Computer
  

  For more information, go deep into cryptography-Principles and Applications of common encryption technologies
  DirectoryIn-depth introduction to cryptography-Principles and Applications of common encryption technologies
  Chapter 1 Introduction to cryptography and data security 1
  1.1 cryptography and the content of this book Overview 1
  1.2 symmetric cryptography 3
  1.2.1 Basic Knowledge 4
  1.2.2 simple symmetric encryption: password replacement 5
  1.3 password Analysis 8
  1.3.1 General ideas for deciphering the password system 8
  1.3.2 suitable key length: 10
  1.4 modulo operations and a variety of classical passwords 11
  1.4.1 modulo operation 12
  1.4.2 Integer Ring 15
  1.4.3 shift password (CAESAR password) 16
  1.4.4 affine password 18
  1.5 discussion and extended reading 19
  1.6 Key Points Review 21
  1.7 exercise 21
  Chapter 2 sequence code 27
  2.1 Introduction 27
  2.1.1 encryption and decryption of the sequence password and group password 27.2.1.2 29
  2.2 random number and unbreakable group password 32
  2.2.1 random number generator 32
  2.2.2 one password at a time 34
  2.2.3 actual sequence password 35
  2.3 shift register-based sequence password 38
  2.3.1 Linear Feedback Shift Register (lfsr) 39
  2.3.2 known plaintext attacks against a single lfsr 43
  2.3.3trivium 44
  2.4 discussion and extended reading 46
  2.5 key points Review 47
  2.6 exercise 48
  Chapter 1 data encryption standards and replacement algorithms 51
  3.1 des Introduction 51
  3.2des algorithm overview 54
  3.3des internal structure 56
  3.3.1 initial replacement and inverse initial replacement 56
  3.3.2f function 58
  3.3.3 key orchestration 63
  3.4 decryption 65
  3.5des security 68
  3.5.1 exhaustive key search 68
  3.5.2 analysis of attack 70
  3.6 software implementation and hardware implementation 71
  3.6.1 software 71
  3.6.2 hardware 72
  3.7des replacement algorithm 72
  3.7.1aes and AES shortlisted passwords 72
  3.7.23des and desx 73
  3.7.3 lightweight password present 73
  3.8 discussion and extended reading 76
  3.9 Key Points review 77
  3.1 exercise 78
  Chapter 3 advanced encryption standards 83
  4.1 Introduction 83
  4.2aes algorithm overview 85
  4.3 some mathematical knowledge: galova introduction 87
  4.3.1 existence of Finite Fields 87
  4.3.2 suyu 89
  4.3.3 extended domain GF (2 m) 90
  4.3.4gf (2 m) addition and subtraction 91
  4.3.5gf (2 m) multiplication 91
  4.3.6gf (2 m) inverse operation 93
  4.4aes internal structure 95
  4.4.1 byte replacement layer 96
  4.4.2 diffusion layer 99
  4.4.3 addition layer 101
  4.4.4 key orchestration 101
  4.5 decryption 106
  4.6 software implementation and hardware implementation 110
  4.6.1 application 110
  4.6.2 hardware 111
  4.7 discussions and extensions 111
  4.8 key points Review 112
  4.9 exercise 112
  Chapter 1 group password details 5th
  5.1 group password encryption: Operation Mode 117
  5.1.1 electronic cryptographic model (ECB) 118
  5.1.2 password group connection mode (CBC) 122
  5.1.3 output feedback mode (ofB) 123
  5.1.4 password feedback mode (CFB) 125
  5.1.5 counter mode (CTR) 126
  5.1.6 galova counter mode (GCM) 127
  5.2 Review exhaustive key search 129
  5.3 enhanced group password security 130
  5.3.1 dual encryption and man-in-the-middle attack 131
  5.3.2 triple encryption 133
  5.3.3 key bleaching 134
  5.4 discussions and extensions 136
  5.5 key points Review 137
  5.6 exercise 137
  Chapter 2 Introduction to public key cryptography 6th
  6.1 symmetric cryptography and asymmetric cryptography 141
  6.2 practicability of public key cryptography 145
  6.2.1 Security 145
  6.2.2 legacy issues: Public Key reliability 146
  6.2.3 important public key algorithm 146
  6.2.4 key length and security level 147
  6.3 basic number theory knowledge of public key algorithms 148
  6.3.1 Euclidean Algorithm 148
  6.3.2 Extended Euclidean Algorithm 151
  6.3.3 Euler's function 155
  6.3.4 ferma's theorem and Euler's theorem 157
  6.4 discussions and extensions 159
  6.5 key points Review 160
  6.6 exercise 160
  Chapter 2 RSA password system 7th
  7.1 Introduction 164
  7.2 encryption and decryption 164
  7.3 key generation and correctness verification 165
  7.4 encryption and decryption: Quick exponential computation 169
  7.5rsa accelerator 173
  7.5.1 use the short public index for quick encryption 173
  7.5.2 use the Chinese Remainder Theorem for fast encryption 174
  7.6 search for large prime number 177
  7.6.1 universality of prime numbers: 177
  7.6.2 sever testing 178
  7.7 actual RSA: Fill 182
  7.8 attack 183
  7.9 software implementation and hardware implementation 186
  7.1 discussions and extensions 187
  7.11 key points Review 188
  7.12 exercise 189
  Chapter 2 discrete logarithm-based public key cryptography 8th
  8.1diffie-Hellman Key Exchange 194
  8.2 some algebra knowledge 196
  8.2.1 group 196
  8.2.2 Round Robin Group 198
  8.2.3 subgroup 202
  8.3 discrete logarithm problem 204
  8.3.1 discrete logarithm problem in prime number domain 204
  8.3.2 generalized discrete logarithm problem 205
  8.3.3 attacks against discrete logarithm problems 207
  8.4 Diffie-Hellman key exchange security 211
  8.5 ElGamal encryption solution 212
  8.5.1 key exchange from Diffie-Hellman to ElGamal encryption 212
  8.5.2elgamal protocol 213
  8.5.3 computing 215
  8.5.4 Security 216
  8.6 discussions and extensions 218
  8.7 key points Review 219
  8.8 exercise 219
  Chapter 2 Elliptic Curve Cryptography 9th
  9.1 Calculation Method of Elliptic Curve 226
  9.1.1 definition of an elliptic curve 227
  9.1.2 group operations on an elliptic curve 228
  9.2 building discrete logarithm using elliptic curves 232
  9.3 Diffie-Hellman Key Exchange Based on Elliptic Curve 236
  9.4 Security 238
  9.5 software implementation and hardware implementation 238
  9.6 discussions and extensions 239
  9.7 key points Review 241
  9.8 exercise 241
  Chapter 2 digital signature 10th
  10.1 Introduction 245
  10.1.1 the reason why symmetric cryptography cannot fully meet the needs is 246
  10.1.2 basic principles of Digital Signature 247
  10.1.3 Security Service 248
  10.2 RSA Signature Scheme 249
  10.2.1 textbook's RSA Digital Signature 250
  10.2.2 computing 251
  10.2.3 Security 252
  10.3 ElGamal digital signature scheme 255
  10.3.1 ElGamal digital signature of textbook 255
  10.3.2 computing 257
  10.3.3 Security 258
  10.4 digital signature algorithm 261
  10.4.1 DSA algorithm 261
  10.4.2 computing: 264
  10.4.3 Security 265
  10.5 elliptic curve digital signature algorithm 266
  10.5.1 ECDSA algorithms 267
  10.5.2 computing 270
  10.5.3 Security 270
  10.6 discussions and extensions 271
  10.7 key points Review 272
  10.8 exercise 272
  Chapter 2 hash functions 11th
  11.1 motivation: Sign 277 for long messages
  11.2 security requirements for hash functions 280
  11.2.1 anti-first image or unidirectional 280
  11.2.2 secondary or weak resistance to conflict 281
  11.2.3 conflict resistance and birthday attack 282
  11.3 hash functions overview 286
  11.3.1 dedicated hash function: md4 287
  11.3.2 hash function 288 built from the group password
  11.4 secure hash algorithm sha-1290
  11.4.1 pre-processing 291
  11.4.2 hash calculation 292
  11.4.3 294
  11.5 discussions and extensions 295
  11.6 key points Review 296
  11.7 exercise 297
  Chapter 1 message Verification Code 12th
  12.1 basic principles of message verification code 301
  12.2 mac from the hash function: hmac303
  12.3 mac from group password: cbc-mac307
  12.4 galova counter message Verification Code 308
  12.5 discussions and extensions 309
  12.6 key points Review 309
  12.7 exercise 310
  Chapter 4 Key creation 13th
  13.1 Introduction 314
  13.1.1 some terminologies 314
  13.1.2 key refresh and key derivation 314
  13.1.3 N2 key distribution issue 316
  13.2 using Symmetric Key Technology for key creation 317
  13.2.1 use the key of the Key Distribution Center to establish 318
  13.2.2 Kerberos 321
  13.2.3 other problems with symmetric key allocation 323
  13.3 create a 323 key using asymmetric key technology
  13.3.1 man-in-the-middle attack 324
  13.3.2 certificate 326
  13.3.3 PKI and Ca 329
  13.4 discussions and extensions 332
  13.5 key points Review 333
  13.6 exercise 333
  References 339

  Source of this book: China Interactive publishing network