Muutke küpsiste eelistusi

E-raamat: Introduction to Cryptography with Open-Source Software

(Victoria University, Melbourne, Australia)
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 62,39 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Once the privilege of a secret few, cryptography is now taught at universities around the world. Introduction to Cryptography with Open-Source Software illustrates algorithms and cryptosystems using examples and the open-source computer algebra system of Sage. The author, a noted educator in the field, provides a highly practical learning experience by progressing at a gentle pace, keeping mathematics at a manageable level, and including numerous end-of-chapter exercises.

Focusing on the cryptosystems themselves rather than the means of breaking them, the book first explores when and how the methods of modern cryptography can be used and misused. It then presents number theory and the algorithms and methods that make up the basis of cryptography today. After a brief review of "classical" cryptography, the book introduces information theory and examines the public-key cryptosystems of RSA and Rabins cryptosystem. Other public-key systems studied include the El Gamal cryptosystem, systems based on knapsack problems, and algorithms for creating digital signature schemes.

The second half of the text moves on to consider bit-oriented secret-key, or symmetric, systems suitable for encrypting large amounts of data. The author describes block ciphers (including the Data Encryption Standard), cryptographic hash functions, finite fields, the Advanced Encryption Standard, cryptosystems based on elliptical curves, random number generation, and stream ciphers. The book concludes with a look at examples and applications of modern cryptographic systems, such as multi-party computation, zero-knowledge proofs, oblivious transfer, and voting protocols.

Arvustused

"This very well-written book is recommended to graduate or final-year undergraduate students intended to start research work on both theoretical and experimental cryptography. Most of the cryptographic protocols are illustrated by various examples and implemented using the open-source algebra software Sage. The book provides a rigorous introduction to the mathematics used in cryptography and covers almost all modern practical cryptosystems. Also, the book is certainly a valuable resource for practitioners looking for experimental cryptography with a computer algebra system." Abderrahmane Nitaj (LMNO, Université de Caen Basse Normandie), IACR book reviews, February 2014

"It would make a great first course in cryptography but it is also easy enough to read to make it suitable for solitary study. Overall this is an excellent book. It is far from the theorem-proof format and it does try to explain the ideas and motivate the reader. The pattern of mixing some theory followed by some practice is good at keeping the less theory-minded reader rolling along as the need for the theory becomes all too apparent. this is a really good book. If you want to master cryptography, this is a great place to start." Mike James, IProgrammer, August 2011

Preface xv
1 Introduction to cryptography
1(22)
1.1 Hiding information: Confidentiality
1(2)
1.2 Some basic definitions
3(2)
1.3 Attacks on a cryptosystem
5(2)
1.4 Some cryptographic problems
7(1)
1.5 Cryptographic protocols
8(4)
1.6 Some simple ciphers
12(6)
1.7 Cryptography and computer security
18(1)
1.8 Glossary
19(4)
Exercises
20(3)
2 Basic number theory
23(32)
2.1 Introduction
23(1)
2.2 Some basic definitions
23(4)
2.3 Some number theoretic calculations
27(17)
2.4 Primality testing
44(3)
2.5 Glossary
47(8)
Exercises
48(7)
3 Classical cryptosystems
55(24)
3.1 Introduction
55(1)
3.2 The Caesar cipher
56(1)
3.3 Translation ciphers
57(1)
3.4 Transposition ciphers
58(3)
3.5 The Vigenere cipher
61(4)
3.6 The one-time pad
65(1)
3.7 Permutation ciphers
65(1)
3.8 Matrix ciphers
66(5)
3.9 Glossary
71(8)
Exercises
71(8)
4 Introduction to information theory
79(14)
4.1 Entropy and uncertainty
79(3)
4.2 Perfect secrecy
82(2)
4.3 Estimating the entropy of English
84(4)
4.4 Unicity distance
88(1)
4.5 Glossary
89(4)
Exercises
89(4)
5 Public-key cryptosystems based on factoring
93(26)
5.1 Introduction
93(1)
5.2 The RSA cryptosystem
93(6)
5.3 Attacks against RSA
99(2)
5.4 RSA in Sage
101(3)
5.5 Rabin's cryptosystem
104(5)
5.6 Rabin's cryptosystem in Sage
109(2)
5.7 Some notes on security
111(1)
5.8 Factoring
112(3)
5.9 Glossary
115(4)
Exercises
115(4)
6 Public-key cryptosystems based on logarithms and knapsacks
119(26)
6.1 El Gamal's cryptosystem
119(3)
6.2 El Gamal in Sage
122(3)
6.3 Computing discrete logarithms
125(2)
6.4 Diffie-Hellman key exchange
127(1)
6.5 Knapsack cryptosystems
128(9)
6.6 Breaking the knapsack
137(2)
6.7 Glossary
139(6)
Exercises
140(5)
7 Digital signatures
145(22)
7.1 Introduction
145(2)
7.2 RSA signature scheme
147(3)
7.3 Rabin digital signatures
150(2)
7.4 The El Gamal digital signature scheme
152(5)
7.5 The Digital Signature Standard
157(4)
7.6 Glossary
161(6)
Exercises
162(5)
8 Block ciphers and the data encryption standard
167(48)
8.1 Block ciphers
167(2)
8.2 Some definitions
169(2)
8.3 Substitution/permutation ciphers
171(2)
8.4 Modes of encryption
173(5)
8.5 Exploring modes of encryption
178(4)
8.6 The Data Encryption Standard
182(1)
8.7 Feistel ciphers
182(1)
8.8 Simplified DES: sDES
183(7)
8.9 The DES algorithm
190(6)
8.10 Security of S-boxes
196(8)
8.11 Security of DES
204(1)
8.12 Using DES
205(1)
8.13 Experimenting with DES
206(1)
8.14 Lightweight ciphers
207(4)
8.15 Glossary
211(4)
Exercises
212(3)
9 Finite fields
215(30)
9.1 Groups and rings
215(4)
9.2 Introduction to fields
219(3)
9.3 Fundamental algebra of finite fields
222(2)
9.4 Polynomials mod 2
224(2)
9.5 A field of order 8
226(3)
9.6 Other fields GF(2n)
229(1)
9.7 Multiplication and inversion
230(4)
9.8 Multiplication without power tables
234(4)
9.9 Glossary
238(7)
Exercises
238(7)
10 The Advanced Encryption Standard
245(22)
10.1 Introduction and some history
245(1)
10.2 Basic structure
246(2)
10.3 The layers in detail
248(4)
10.4 Decryption
252(4)
10.5 Experimenting with AES
256(2)
10.6 A simplified Rijndael
258(6)
10.7 Security of the AES
264(1)
10.8 Glossary
265(2)
Exercises
265(2)
11 Hash functions
267(28)
11.1 Uses of hash functions
268(2)
11.2 Security of hash functions
270(1)
11.3 Constructing a hash function
271(10)
11.4 Provably secure hash functions
281(4)
11.5 New hash functions
285(2)
11.6 Message authentication codes
287(1)
11.7 Using a MAC
288(1)
11.8 Glossary
289(6)
Exercises
289(6)
12 Elliptic curves and cryptosystems
295(38)
12.1 Basic definitions
295(5)
12.2 The group on an elliptic curve
300(7)
12.3 Background and history
307(1)
12.4 Multiplication
308(1)
12.5 Elliptic curve cryptosystems
309(7)
12.6 Elliptic curve signature schemes
316(1)
12.7 Elliptic curves over binary fields
317(1)
12.8 Pairing-based cryptography
318(5)
12.9 Exploring pairings in Sage
323(3)
12.10 Glossary
326(7)
Exercises
327(6)
13 Random numbers and stream ciphers
333(28)
13.1 Introduction
333(1)
13.2 Pseudo-random number generators
334(4)
13.3 Some cryptographically strong generators
338(3)
13.4 The shrinking generator
341(3)
13.5 ISAAC and Fortuna
344(2)
13.6 Stream ciphers
346(2)
13.7 RC4
348(3)
13.8 The Blum-Goldwasser cryptosystem
351(4)
13.9 Glossary
355(6)
Exercises
356(5)
14 Advanced applications and protocols
361(34)
14.1 Secure multi-party computation
361(5)
14.2 Zero knowledge proofs
366(5)
14.3 Oblivious transfer
371(3)
14.4 Digital cash
374(8)
14.5 Voting protocols
382(6)
14.6 Glossary
388(7)
Exercises
389(6)
Appendix A Introduction to Sage
395(16)
A.1 Obtaining and installing Sage
395(1)
A.2 Starting with Sage
396(1)
A.3 Basic usage
396(6)
A.4 Tab completion and help
402(2)
A.5 Basic programming
404(3)
A.6 A programming example
407(4)
Exercises
408(3)
Appendix B Advanced computational number theory
411(14)
B.1 The quadratic sieve
411(4)
B.2 The AKS primality test
415(2)
B.3 Methods of computing discrete logarithms
417(8)
Exercises
423(2)
Bibliography 425(10)
Index 435
Alasdair McAndrew is a senior lecturer in the School of Engineering and Science at Victoria University in Melbourne, Australia.