Making, breaking codes: an introduction to cryptography
This unique book explains the basic issues of classical and modern cryptography, and provides a self contained essential mathematical background in number theory, abstract algebra, and probabilityŚwith surveys of relevant parts of complexity theory and other things. A user-friendly, down-to-earth tone presents concretely motivated introductions to these topics. More detailed chapter topics include simple ciphers; applying ideas from probability; substitutions, transpositions, permutations; modern symmetric ciphers; the integers; prime numbers; powers and roots modulo primes; powers and roots for composite moduli; weakly multiplicative functions; quadratic symbols, quadratic reciprocity; pseudoprimes; groups; sketches of protocols; rings, fields, polynomials; cyclotomic polynomials, primitive roots; pseudo-random number generators; proofs concerning pseudoprimality; factorization attacks finite fields; and elliptic curves. For personnel in computer security, system administration, and information systems.
What people are saying - Write a review
We haven't found any reviews in the usual places.
addition affine cipher Alice bijection certainly characters ciphertext ciphertext-only attack coefficients composite compute congruence corollary cyclic group cyclotomic polynomial decryption defined discrete logarithms divides elliptic curve encryption equation equivalence Euclidean algorithm example exponent Fermat pseudoprime finite fields formula function gives greatest common divisor group G homomorphism identity integer irreducible key length knapsack Lagrange's theorem large prime lemma linear log2 matrix multiplicative inverse nonzero notation number theory occur permutation plaintext positive integer primality prime factors prime number primitive root modulo probabilistic probability Proof proper factor Proposition prove pseudoprime base public-key quadratic reciprocity quadratic symbol random variable real numbers reduced reduction mod relatively prime Remark rho method secret sequence shift cipher Show square modulo square root subgroup subset substitution cipher suppose things transposition cipher trial division vector Vigenere cipher