Complexity and Cryptography: An Introduction, Volume 13
Cryptography plays a crucial role in many aspects of today's world, from internet banking and ecommerce to email and web-based business processes. Understanding the principles on which it is based is an important topic that requires a knowledge of both computational complexity and a range of topics in pure mathematics. This book provides that knowledge, combining an informal style with strong proofs of the key results to provide an accessible introduction. It includes many examples and exercises, and is based on a highly successful course developed and taught over many years.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
3-colourable accepts Alice and Bob attack binary Bob's Boolean function chooses a random cipher circuit CLIQUE co-NP colours complexity computation consider cryptogram cryptography decision problem decryption defined denote Diffie-Hellman Elgamal encoding encryption Euclid's algorithm example Exercise exists factorisation feedback polynomial given graph G halting hard-core predicate hash function Hence input x e integer interactive proof system invert keystream length LFSR matrix mod q modn NP-complete one-time pad one-way function output P/poly pair Peggy permutation polynomial time algorithm Pr[A primality primitive root mod private key probabilistic algorithm probabilistic polynomial probability Proposition protocol prove pseudorandom PSPACE public key cryptosystem quadratic residue quadratic residue mod random bits read-write head recover the message result satisfying truth assignment secret key secret shares secure sends sequence signature scheme simply string strong one-way function Suppose tape Theorem trapdoor users vertices Victor zero