Atjaunināt sīkdatņu piekrišanu

Understanding Cryptography: A Textbook for Students and Practitioners 2010 ed. [Mīkstie vāki]

4.42/5 (16 ratings by Goodreads)
, Foreword by ,
  • Formāts: Paperback / softback, 372 pages, height x width: 235x155 mm, weight: 599 g, XVIII, 372 p., 1 Paperback / softback
  • Izdošanas datums: 08-Nov-2014
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642446493
  • ISBN-13: 9783642446498
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 36,20 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 42,59 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Understanding Cryptography: A Textbook for Students and Practitioners 2010 ed.Palielināt
  • Formāts: Paperback / softback, 372 pages, height x width: 235x155 mm, weight: 599 g, XVIII, 372 p., 1 Paperback / softback
  • Izdošanas datums: 08-Nov-2014
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642446493
  • ISBN-13: 9783642446498
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783642446498.html
Keywords:
Cryptography is now ubiquitous moving beyond the traditional environments, such as government communications and banking systems, we see cryptographic techniques realized in Web browsers, e-mail programs, cell phones, manufacturing systems, embedded software, smart buildings, cars, and even medical implants. Today's designers need a comprehensive understanding of applied cryptography.





After an introduction to cryptography and data security, the authors explain the main techniques in modern cryptography, with chapters addressing stream ciphers, the Data Encryption Standard (DES) and 3DES, the Advanced Encryption Standard (AES), block ciphers, the RSA cryptosystem, public-key cryptosystems based on the discrete logarithm problem, elliptic-curve cryptography (ECC), digital signatures, hash functions, Message Authentication Codes (MACs), and methods for key establishment, including certificates and public-key infrastructure (PKI). Throughout the book, the authors focuson communicating the essentials and keeping the mathematics to a minimum, and they move quickly from explaining the foundations to describing practical implementations, including recent topics such as lightweight ciphers for RFIDs and mobile devices, and current key-length recommendations.





The authors have considerable experience teaching applied cryptography to engineering and computer science students and to professionals, and they make extensive use of examples, problems, and chapter reviews, while the books website offers slides, projects and links to further resources. This is a suitable textbook for graduate and advanced undergraduate courses and also for self-study by engineers.

The authors' website (http://www.crypto-textbook.com/) provides extensive notes, slides, video lectures; the authors' YouTube channel (https://www.youtube.com/channel/UC1usFRN4LCMcflV7UjHNuQg) includes video lectures.

Recenzijas

From the reviews: "The authors have succeeded in creating a highly valuable introduction to the subject of applied cryptography. I hope that it can serve as a guide for practitioners to build more secure systems based on cryptography, and as a stepping stone for future researchers to explore the exciting world of cryptography and its applications." (Bart Preneel, K.U.Leuven) "The material is very well presented so it is clear to understand. The necessary amount of mathematics is used and complete yet simple examples are used by the authors to help the reader understand the topics. ... [ The authors] appear to fully understand the concepts and follow a very good pedagogical process that helps the reader not only understand the different topics but motivate you to perform some of the exercises at the end of each chapter and browse some of the reference materials. I fully recommend this book to any software developer/designer working or considering working on a project that requires security." (John Canessa) "The book presents a panoramic of modern Cryptography with a view to practical applications. ... The book is well written, many examples and figures through it illustrate the theory and the book's website offers links and supplementary information. The book also discusses the implementation in software and hardware of the main algorithms described." (Juan Tena Ayuso, Zentralblatt MATH, Vol. 1190, 2010)

1 Introduction to Cryptography and Data Security
1(28)
1.1 Overview of Cryptology (and This Book)
2(2)
1.2 Symmetric Cryptography
4(5)
1.2.1 Basics
4(2)
1.2.2 Simple Symmetric Encryption: The Substitution Cipher
6(3)
1.3 Cryptanalysis
9(4)
1.3.1 General Thoughts on Breaking Cryptosystems
9(2)
1.3.2 How Many Key Bits Are Enough?
11(2)
1.4 Modular Arithmetic and More Historical Ciphers
13(7)
1.4.1 Modular Arithmetic
13(3)
1.4.2 Integer Rings
16(2)
1.4.3 Shift Cipher (or Caesar Cipher)
18(1)
1.4.4 Affine Cipher
19(1)
1.5 Discussion and Further Reading
20(2)
1.6 Lessons Learned
22(2)
Problems
24(5)
2 Stream Ciphers
29(26)
2.1 Introduction
30(4)
2.1.1 Stream Ciphers vs. Block Ciphers
30(1)
2.1.2 Encryption and Decryption with Stream Ciphers
31(3)
2.2 Random Numbers and an Unbreakable Stream Cipher
34(7)
2.2.1 Random Number Generators
34(2)
2.2.2 The One-Time Pad
36(2)
2.2.3 Towards Practical Stream Ciphers
38(3)
2.3 Shift Register-Based Stream Ciphers
41(8)
2.3.1 Linear Feedback Shift Registers (LFSR)
41(4)
2.3.2 Known-Plaintext Attack Against Single LFSRs
45(1)
2.3.3 Trivium
46(3)
2.4 Discussion and Further Reading
49(1)
2.5 Lessons Learned
50(2)
Problems
52(3)
3 The Data Encryption Standard (DES) and Alternatives
55(32)
3.1 Introduction to DES
56(2)
3.1.1 Confusion and Diffusion
57(1)
3.2 Overview of the DES Algorithm
58(3)
3.3 Internal Structure of DES
61(8)
3.3.1 Initial and Final Permutation
61(1)
3.3.2 The f-Function
62(5)
3.3.3 Key Schedule
67(2)
3.4 Decryption
69(3)
3.5 Security of DES
72(3)
3.5.1 Exhaustive Key Search
73(2)
3.5.2 Analytical Attacks
75(1)
3.6 Implementation in Software and Hardware
75(2)
3.7 DES Alternatives
77(4)
3.7.1 The Advanced Encryption Standard (AES) and the AES Finalist Ciphers
77(1)
3.7.2 Triple DES (3DES) and DESX
78(1)
3.7.3 Lightweight Cipher PRESENT
78(3)
3.8 Discussion and Further Reading
81(1)
3.9 Lessons Learned
82(1)
Problems
83(4)
4 The Advanced Encryption Standard (AES)
87(36)
4.1 Introduction
88(1)
4.2 Overview of the AES Algorithm
89(1)
4.3 Some Mathematics: A Brief Introduction to Galois Fields
90(9)
4.3.1 Existence of Finite Fields
90(3)
4.3.2 Prime Fields
93(1)
4.3.3 Extension Fields GF(2m)
94(1)
4.3.4 Addition and Subtraction in GF(2m)
95(1)
4.3.5 Multiplication in GF(2m)
96(2)
4.3.6 Inversion in GF(2m)
98(1)
4.4 Internal Structure of AES
99(11)
4.4.1 Byte Substitution Layer
101(2)
4.4.2 Diffusion Layer
103(3)
4.4.3 Key Addition Layer
106(1)
4.4.4 Key Schedule
106(4)
4.5 Decryption
110(5)
4.6 Implementation in Software and Hardware
115(1)
4.7 Discussion and Further Reading
116(1)
4.8 Lessons Learned
117(1)
Problems
118(5)
5 More About Block Ciphers
123(26)
5.1 Encryption with Block Ciphers: Modes of Operation
124(12)
5.1.1 Electronic Codebook Mode (ECB)
124(4)
5.1.2 Cipher Block Chaining Mode (CBC)
128(2)
5.1.3 Output Feedback Mode (OFB)
130(1)
5.1.4 Cipher Feedback Mode (CFB)
131(1)
5.1.5 Counter Mode (CTR)
132(2)
5.1.6 Galois Counter Mode (GCM)
134(2)
5.2 Exhaustive Key Search Revisited
136(1)
5.3 Increasing the Security of Block Ciphers
137(6)
5.3.1 Double Encryption and Meet-in-the-Middle Attack
138(2)
5.3.2 Triple Encryption
140(1)
5.3.3 Key Whitening
141(2)
5.4 Discussion and Further Reading
143(1)
5.5 Lessons Learned
144(1)
Problems
145(4)
6 Introduction to Public-Key Cryptography
149(24)
6.1 Symmetric vs. Asymmetric Cryptography
150(3)
6.2 Practical Aspects of Public-Key Cryptography
153(4)
6.2.1 Security Mechanisms
154(1)
6.2.2 The Remaining Problem: Authenticity of Public Keys
154(1)
6.2.3 Important Public-Key Algorithms
155(1)
6.2.4 Key Lengths and Security Levels
156(1)
6.3 Essential Number Theory for Public-Key Algorithms
157(11)
6.3.1 Euclidean Algorithm
157(3)
6.3.2 Extended Euclidean Algorithm
160(4)
6.3.3 Euler's Phi Function
164(2)
6.3.4 Fermat's Little Theorem and Euler's Theorem
166(2)
6.4 Discussion and Further Reading
168(1)
6.5 Lessons Learned
169(1)
Problems
170(3)
7 The RSA Cryptosystem
173(32)
7.1 Introduction
174(1)
7.2 Encryption and Decryption
174(1)
7.3 Key Generation and Proof of Correctness
175(4)
7.4 Encryption and Decryption: Fast Exponentiation
179(4)
7.5 Speed-up Techniques for RSA
183(4)
7.5.1 Fast Encryption with Short Public Exponents
183(1)
7.5.2 Fast Decryption with the Chinese Remainder Theorem
184(3)
7.6 Finding Large Primes
187(5)
7.6.1 How Common Are Primes?
187(1)
7.6.2 Primality Tests
188(4)
7.7 RSA in Practice: Padding
192(2)
7.8 Attacks
194(3)
7.9 Implementation in Software and Hardware
197(1)
7.10 Discussion and Further Reading
198(1)
7.11 Lessons Learned
199(1)
Problems
200(5)
8 Public-Key Cryptosystems Based on the Discrete Logarithm Problem
205(34)
8.1 Diffie--Hellman Key Exchange
206(2)
8.2 Some Algebra
208(8)
8.2.1 Groups
208(2)
8.2.2 Cyclic Groups
210(4)
8.2.3 Subgroups
214(2)
8.3 The Discrete Logarithm Problem
216(9)
8.3.1 The Discrete Logarithm Problem in Prime Fields
216(2)
8.3.2 The Generalized Discrete Logarithm Problem
218(1)
8.3.3 Attacks Against the Discrete Logarithm Problem
219(6)
8.4 Security of the Diffie--Hellman Key Exchange
225(1)
8.5 The Elgamal Encryption Scheme
226(6)
8.5.1 From Diffie--Hellman Key Exchange to Elgamal Encryption
226(1)
8.5.2 The Elgamal Protocol
227(2)
8.5.3 Computational Aspects
229(1)
8.5.4 Security
230(2)
8.6 Discussion and Further Reading
232(1)
8.7 Lessons Learned
233(1)
Problems
234(5)
9 Elliptic Curve Cryptosystems
239(20)
9.1 How to Compute with Elliptic Curves
240(6)
9.1.1 Definition of Elliptic Curves
241(1)
9.1.2 Group Operations on Elliptic Curves
242(4)
9.2 Building a Discrete Logarithm Problem with Elliptic Curves
246(3)
9.3 Diffie--Hellman Key Exchange with Elliptic Curves
249(2)
9.4 Security
251(1)
9.5 Implementation in Software and Hardware
252(1)
9.6 Discussion and Further Reading
253(2)
9.7 Lessons Learned
255(1)
Problems
256(3)
10 Digital Signatures
259(34)
10.1 Introduction
260(4)
10.1.1 Odd Colors for Cars, or: Why Symmetric Cryptography Is Not Sufficient
260(1)
10.1.2 Principles of Digital Signatures
261(2)
10.1.3 Security Services
263(1)
10.2 The RSA Signature Scheme
264(6)
10.2.1 Schoolbook RSA Digital Signature
265(2)
10.2.2 Computational Aspects
267(1)
10.2.3 Security
267(3)
10.3 The Elgamal Digital Signature Scheme
270(7)
10.3.1 Schoolbook Elgamal Digital Signature
270(3)
10.3.2 Computational Aspects
273(1)
10.3.3 Security
274(3)
10.4 The Digital Signature Algorithm (DSA)
277(5)
10.4.1 The DSA Algorithm
277(3)
10.4.2 Computational Aspects
280(1)
10.4.3 Security
281(1)
10.5 The Elliptic Curve Digital Signature Algorithm (ECDSA)
282(5)
10.5.1 The ECDSA Algorithm
282(3)
10.5.2 Computational Aspects
285(1)
10.5.3 Security
286(1)
10.6 Discussion and Further Reading
287(1)
10.7 Lessons Learned
288(1)
Problems
289(4)
11 Hash Functions
293(26)
11.1 Motivation: Signing Long Messages
294(2)
11.2 Security Requirements of Hash Functions
296(7)
11.2.1 Preimage Resistance or One-Wayness
297(1)
11.2.2 Second Preimage Resistance or Weak Collision Resistance
297(2)
11.2.3 Collision Resistance and the Birthday Attack
299(4)
11.3 Overview of Hash Algorithms
303(4)
11.3.1 Dedicated Hash Functions: The MD4 Family
304(1)
11.3.2 Hash Functions from Block Ciphers
305(2)
11.4 The Secure Hash Algorithm SHA-1
307(5)
11.4.1 Preprocessing
308(1)
11.4.2 Hash Computation
309(3)
11.4.3 Implementation
312(1)
11.5 Discussion and Further Reading
312(1)
11.6 Lessons Learned
313(2)
Problems
315(4)
12 Message Authentication Codes (MACs)
319(12)
12.1 Principles of Message Authentication Codes
320(1)
12.2 MACs from Hash Functions: HMAC
321(4)
12.3 MACs from Block Ciphers: CBC-MAC
325(1)
12.4 Galois Counter Message Authentication Code (GMAC)
326(1)
12.5 Discussion and Further Reading
327(1)
12.6 Lessons Learned
328(1)
Problems
329(2)
13 Key Establishment
331(28)
13.1 Introduction
332(4)
13.1.1 Some Terminology
332(1)
13.1.2 Key Freshness and Key Derivation
332(2)
13.1.3 The n2 Key Distribution Problem
334(2)
13.2 Key Establishment Using Symmetric-Key Techniques
336(5)
13.2.1 Key Establishment with a Key Distribution Center
336(3)
13.2.2 Kerberos
339(2)
13.2.3 Remaining Problems with Symmetric-Key Distribution
341(1)
13.3 Key Establishment Using Asymmetric Techniques
342(8)
13.3.1 Man-in-the-Middle Attack
342(2)
13.3.2 Certificates
344(3)
13.3.3 Public-Key Infrastructures (PKI) and CAs
347(3)
13.4 Discussion and Further Reading
350(2)
13.5 Lessons Learned
352(1)
Problems
353(6)
References 359(8)
Index 367
Prof. Dr.-Ing. Christof Paar has the Chair for Embedded Security at the University of Bochum, Germany, and is Adjunct Professor at the University of Massachusetts at Amherst, USA. Prof. Paar has taught cryptography for 15 years to engineering and computer science students in the US and in Europe, and he has taught many industrial practitioners at organizations such as Motorola, Philips and NASA. He has more than 100 publications in applied cryptography and is a cofounder of the Workshop on Cryptographic Hardware and Embedded Systems (CHES), the key academic event in this field.





Prof. Dr.-Ing. January Pelzl started his career at Bosch Telecom GmbH. He has a Ph.D. in applied cryptography, and as a researcher he investigated the practical aspects of elliptic-curve-based cryptography and cryptanalysis. He has published extensively about his theoretical and industrial work through leading international conferences and journals, and he has taught many IT security and cryptography courses in industry. He was the Managing Director of "ESCRYPT GmbH" in Bochum. Since January 2015 he is the professor of  "Computer Security" in Hochschule Hamm-Lippstadt.

The authors' website (http://www.crypto-textbook.com/) provides extensive notes, slides, video lectures; the authors' YouTube channel (https://www.youtube.com/channel/UC1usFRN4LCMcflV7UjHNuQg) includes video lectures.