Screen LibraryBasics of contemporary cryptography for IT practitioners /
The aim of this book is to provide a comprehensive introduction to cryptography without using complex mathematical constructions. The themes are conveyed in a form that only requires a basic knowledge of mathematics, but the methods are described in sufficient detail to enable their computer impleme...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Group Author: | |
| Published: |
World Scientific Pub. Co.,
|
| Publisher Address: | Singapore ; Hackensack, N.J. : |
| Publication Dates: | 2005. |
| Literature type: | eBook |
| Language: | English |
| Subjects: | |
| Online Access: |
http://www.worldscientific.com/worldscibooks/10.1142/5885#t=toc |
| Summary: |
The aim of this book is to provide a comprehensive introduction to cryptography without using complex mathematical constructions. The themes are conveyed in a form that only requires a basic knowledge of mathematics, but the methods are described in sufficient detail to enable their computer implementation. The book describes the main techniques and facilities of contemporary cryptography, proving key results along the way. The contents of the first five chapters can be used for one-semester course. |
| Carrier Form: | 1 online resource (ix,197pages) : illustrations |
| Bibliography: | Includes bibliographical references (pages 189-192) and index. |
| ISBN: | 9789812703309 (electronic bk.) |
| CLC: | TP309-532 |
| Contents: | 1. Introduction. Problems and exercises -- 2. Public key cryptosystems. 2.1. Prehistory and main ideas. 2.2. The first public key system - Diffie-Hellman key agreement. 2.3. The elements of number theory. 2.4. Shamir cipher. 2.5. ElGamal encryption. 2.6. RSA encryption and trapdoor functions -- 3. Solving discrete logarithm problem. 3.1. Problem setting. 3.2. The baby-step giant-step algorithm. 3.3. Index calculus algorithm -- 4. Digital signatures. 4.1. RSA digital signature. 4.2. ElGamal digital signature. 4.3. Digital signature standards -- 5. Cryptographic protocols. 5.1. Mental poker. 5.2. Zero knowledge proofs. 5.3. Digital cash. 5.4. Mutual identification with key establishment -- 6. Elliptic curve cryptosystems. 6.1. Introduction. 6.2. Mathematical foundations. 6.3. Choosing curve parameters. 6.4. Constructing cryptosystems. 6.5. Efficient implementation of operations. 6.6. Counting points on elliptic curve. 6.7. Using standard curves -- 7. Theoretical security of cryptosystems. 7.1. Introduction. 7.2. Theory of perfect secrecy. 7.3. Vernam cipher. 7.4. Elements of information theory. 7.5. Unicity distance for secret key cipher. 7.6. Ideal cryptosystems -- 8. Modern secret key ciphers. 8.1. . 8.2. Block ciphers. 8.3. Main modes of operation of block ciphers. 8.4. Stream ciphers. 8.5. Cryptographic Hash functions -- 9. Random numbers in cryptography. 9.1. Introduction. 9.2. Refining physical random number generators. 9.3. Pseudo-random number generators. 9.4. Statistical tests for random and pseudo-random number generators. 9.5. Statistical attack to block ciphers. |