An Introduction to Cryptography
CRC Press, 10 באוג׳ 2000 - 392 עמודים
INTRODUCTION FOR THE UNINITIATED
Heretofore, there has been no suitable introductory book that provides a solid mathematical treatment of cryptography for students with little or no background in number theory. By presenting the necessary mathematics as needed, An Introduction to Cryptography superbly fills that void. Although it is intended for the undergraduate student needing an introduction to the subject of cryptography, it contains enough optional, advanced material to challenge even the most informed reader, and provides the basis for a second course on the subject.
Beginning with an overview of the history of cryptography, the material covers the basics of computer arithmetic and explores complexity issues. The author then presents three comprehensive chapters on symmetric-key cryptosystems, public-key cryptosystems, and primality testing. There is an optional chapter on four factoring methods: Pollard's p-1 method, the continued fraction algorithm, the quadratic sieve, and the number field sieve. Another optional chapter contains detailed development of elliptic curve cryptosystems, zero-knowledge, and quantum cryptography. He illustrates all methods with worked examples and includes a full, but uncluttered description of the numerous cryptographic applications.
SUSTAINS INTEREST WITH ENGAGING MATERIAL
Throughout the book, the author gives a human face to cryptography by including more than 50 biographies of the individuals who helped develop cryptographic concepts. He includes a number of illustrative and motivating examples, as well as optional topics that go beyond the basics presented in the core data. With an extensive index and a list of symbols for easy reference, An Introduction to Cryptography is the essential fundamental text on cryptography.
מה אומרים אנשים - כתיבת ביקורת
לא מצאנו ביקורות במקומות הרגילים
Cipher 4 78
in cryptography The text has been designed in such a way that the reader with
arithmetic balanced ternary base binary bit operations bitstring Block Cipher called Chapter choose ciphertext complexity composite congruence continued fraction cryptanalyst cryptography cryptology cryptosystem deciphering defined Definition denoted discrete log problem discussion divisor elements ElGamal elliptic curve enciphering encryption entity Euler Example Exercise exists Fermat Fermat's Little Theorem Field Sieve finite field Footnote function gcd(a given Hence induction input instance integer keystream LFSR linear mathematical matrix method modular multiplicative inverse namely natural numbers nonnegative notation notion Number Field Sieve number of bit number theory output pair permutation plaintext polynomial primality testing prime factors primitive root modulo private key properties protocol Prove public-key quadratic residue Quadratic Sieve random reader relatively prime residue modulo result Rijndael ring S-box secret sequence signature scheme solution solve step Stream Cipher subset Subset Sum Problem Suppose symbols unique verify Z/nZ Z/pZ Zero-knowledge Proof