Cryptography Theory and Practice

ISBN-10: 1584882069
ISBN-13: 9781584882060
Edition: 2nd 2002 (Revised)
Authors: Douglas Stinson
List price: $79.95
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Italian Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Portuguese Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Spanish Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
German Grammar Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $79.95
Edition: 2nd
Copyright year: 2002
Publisher: CRC Press LLC
Publication date: 2/27/2002
Binding: Hardcover
Pages: 360
Size: 6.25" wide x 9.25" long x 1.00" tall
Weight: 1.496
Language: English

Craig Stinson is a journalist and author. He has written or coauthored more than 20 books including Windows Vista� Inside Out, Deluxe Edition and Microsoft� Office Excel� 2007 Inside Out.

Classical Cryptography
Introduction: Some Simple Cryptosystems
The Shift Cipher
The Substitution Cipher
The Affine Cipher
The Vigenere Cipher
The Hill Cipher
The Permutation Cipher
Stream Ciphers
Cryptanalysis
Cryptanalysis of the Affine Cipher
Cryptanalysis of the Substitution Cipher
Cryptanalysis of the Vigenere Cipher
Cryptanalysis of the Hill Cipher
Cryptanalysis of the LFSR Stream Cipher
Notes
Exercises
Shannon's Theory
Introduction
Elementary Probability Theory
Perfect Secrecy
Entropy
Huffman Encodings
Properties of Entropy
Spurious Keys and Unicity Distance
Product Cryptosystems
Notes
Exercises
Block Ciphers and the Advanced Encryption Standard
Introduction
Substitution-Permutation Networks
Linear Cryptanalysis
The Piling-up Lemma
Linear Approximations of S-boxes
A Linear Attack on an SPN
Differential Cryptanalysis
The Data Encryption Standard
Description of DES
Analysis of DES
The Advanced Encryption Standard
Description of AES
Analysis of AES
Modes of Operation
Notes and References
Exercises
Cryptographic Hash Functions
Hash Functions and Data Integrity
Security of Hash Functions
The Random Oracle Model
Algorithms in the Random Oracle Model
Comparison of Security Criteria
Interated Hash Functions
The Merkle-Damgard Construction
The Secure Hash Algorithm
Message Authentication Codes
Nested MACs and HMAC
CBC-MAC
Unconditionally Secure MACs
Strongly Universal Hash Families
Optimality of Deception Probabilities
Notes and References
Exercises
The RSA Cryptosystem and Factoring Integers
Introduction to Public-key Cryptography
More Number Theory
The Euclidean Algorithm
The Chinese Remainder Theorem
Other Useful Facts
The RSA Cryptosystem
Implementing RSA
Primality Testing
Square Roots Modulo n
Factoring Algorithms
The Pollard p--1 Algorithm
The Pollard Rho Algorithm
Dixon's Random Squares Algorithm
Factoring Algorithms in Practice
Other Attacks on RSA
Computing [phi](n)
The Decryption Exponent
Wiener's Low Decryption Exponent Attack
The Rabin Cryptosystem
Security of the Rabin Cryptosystem
Semantic Security of RSA
Partial Information Concerning Plaintext Bits
Optimal Asymmetric Encryption Padding
Notes and References
Exercises
Public-key Cryptosystems Based on the Discrete Logarithm Problem
The ElGamal Cryptosystem
Algorithms for the Discrete Logarithm Problem
Shank's Algorithm
The Pollard Rho Discrete Logarithm Algorithm
The Pohlig-Hellman Algorithm
The Index Calculus Method
Lower Bounds on the Complexity of Generic Algorithms
Finite Fields
Elliptic Curves
Elliptic Curves over the Reals
Elliptic Curves Modulo a Prime
Properties of Elliptic Curves
Point Compression and the ECIES
Computing Point Multiples on Elliptic Curves
Discrete Logarithm Algorithms in Practice
Security of ElGamal Systems
Bit Security of Discrete Logarithms
Semantic Security of ElGamal Systems
The Diffie-Hellman Problems
Notes and References
Exercises
Signature Schemes
Introduction
Security Requirements for Signature Schemes
Signatures and Hash Functions
The ElGamal Signature Scheme
Security of the ElGamal Signature Scheme
Variants of the ElGamal Signature Scheme
The Schnorr Signature Scheme
The Digital Signature Algorithm
The Elliptic Curve DSA
Provably Secure Signature Schemes
One-time Signatures
Full Domain Hash
Undeniable Signatures
Fail-stop Signatures
Notes and References
Exercises
Further Reading
Bibliography
Cryptosystem Index
Algorithm Index
Problem Index
Subject Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×