A Cryptography Primer Secrets And Promises 1st Edition by Philip Klein ISBN 1107603455 978-1107603455

A Cryptography Primer Secrets And Promises 1st Edition by Philip N. Klein  – Ebook PDF Instant Download/Delivery: 1107603455, 978-1107603455
Full download A Cryptography Primer Secrets And Promises 1st Edition after payment

Product details: 

ISBN 10: 1107603455 

ISBN 13: 978-1107603455

Author:  Philip N. Klein

Cryptography has been employed in war and diplomacy from the time of Julius Caesar. In our Internet age, cryptography’s most widespread application may be for commerce, from protecting the security of electronic transfers to guarding communication from industrial espionage. This accessible introduction for undergraduates explains the cryptographic protocols for achieving privacy of communication and the use of digital signatures for certifying the validity, integrity, and origin of a message, document, or program. Rather than offering a how-to on configuring web browsers and e-mail programs, the author provides a guide to the principles and elementary mathematics underlying modern cryptography, giving readers a look under the hood for security techniques and the reasons they are thought to be secure.

Table of contents: 

1 Introduction
1.1 Encryption and decryption
1.2 Channels, secure and insecure
1.3 Security through obscurity
1.4 The alternative: The Kerckhoffs Doctrine
1.5 A taxonomy of cryptography
1.6 Attacks on cryptosystems
1.7 Problems

2 Modular Arithmetic
2.1 The Caesar cypher
2.2 The number circle
2.3 Modular arithmetic in daily life
2.4 Congruences
2.5 Another example: Congruences modulo 10
2.6 Substituting using congruences
2.7 Representatives and remainder
2.8 Problems

3 The Addition Cypher, an Insecure Block Cypher
3.1 The addition cypher
3.2 Block cyphers
3.3 Attacks on the addition cypher
3.4 Attacks on any block cypher that uses ECB mode
3.5 Problems

4 Functions
4.1 The basics
4.2 Invertibility
4.3 Functions from modular arithmetic
4.4 Function notation
4.5 Uses of functions
4.6 A two-input function: The encryption function for the generalized Caesar cypher
4.7 Specialization: Turning a two-input function into a one-input function
4.8 Problems

5 Probability Theory
5.1 Outcomes of an experiment
5.2 Probabilities of outcomes
5.3 Plotting a probability distribution
5.4 Probabilities of sets of outcomes
5.5 Summary so far
5.6 Uniform distributions
5.7 Random variables
5.8 Problems

6 Perfect Secrecy and Perfectly Secure Cryptosystems
6.1 What does an eavesdropper learn from seeing a cyphertext?
6.2 Evaluation of cryptosystems
6.3 Perfect secrecy versus unique decryptability
6.4 A brief history of perfect secrecy
6.5 The drawback of perfectly secret cryptosystems
6.6 Problems

7 Number Theory
7.1 Divisibility
7.2 Relative primality
7.3 Prime numbers
7.4 Prime factorization
7.5 Euler’s phi function φ(x)
7.6 Exponentiation
7.7 Euler’s Theorem
7.8 Problems

8 Euclid’s Algorithm
8.1 The measuring puzzle
8.2 Finding a modular multiplicative inverse by solving a measuring puzzle
8.3 Euclid’s algorithm
8.4 The backward part of Euclid’s algorithm
8.5 The EuclidCards
8.6 What Euclid’s algorithm teaches us
8.7 Problems

9 Some Uses of Perfect Secrecy
9.1 Secret-sharing and perfect secrecy
9.2 Threshold secret-sharing
9.3 Message authentication codes
9.4 Problems

10 Computational Problems, Easy and Hard
10.1 Computational problems
10.2 Algorithms
10.3 Predicting how many computer steps are needed by an algorithm
10.4 Fast algorithms and slow algorithms, easy problems and hard problems
10.5 Problems

11 Modular Exponentiation, Modular Logarithm, and One-Way Functions
11.1 Modular logarithms
11.2 Application of one-way functions to password security
11.3 Application of one-way functions to logging in: s/key
11.4 (Mis) application of one-way functions to commitment
11.5 Problems

12 Diffie and Hellman’s Exponential-Key-Agreement Protocol
12.1 Motivation
12.2 Background
12.3 The protocol
12.4 Security
12.5 Eve in the middle
12.6 Problems

13 Computationally Secure Single-Key Cryptosystems
13.1 Secure block cyphers in the real world
13.2 Cypher block chaining
13.3 The exponentiation cypher
13.4 How to find a big prime
13.5 Problems

14 Public-Key Cryptosystems and Digital Signatures
14.1 Public-key cryptosystems
14.2 El Gamal’s cryptosystem
14.3 More remarks about the El Gamal cryptosystem
14.4 Public-key cryptography in practice
14.5 Signatures
14.6 Trapdoor one-way functions and their use in public-key encryption and digital signatures
14.7 The RSA trapdoor one-way function
14.8 The RSA public-key cryptosystem
14.9 The RSA digital signature scheme
14.10 Message digest functions
14.11 Use of message digest functions in commitment
14.12 Problems

People also search for:

basic cryptography pdf
    
cryptography primer
    
cryptography and prime numbers
    
cryptography.hazmat.primitives.ciphers.aead
    
encryption and prime numbers

 

Tags:

Philip Klein,A Cryptography Primer,Secrets And Promises