Introduction to Cryptography: With Coding TheoryPearson Prentice Hall, 2006 - 577 sayfa This text is for a course in cryptography for advanced undergraduate and graduate students. Material is accessible to mathematically mature students having little background in number theory and computer programming. Core material is treated in the first eight chapters on areas such as classical cryptosystems, basic number theory, the RSA algorithm, and digital signatures. The remaining nine chapters cover optional topics including secret sharing schemes, games, and information theory. Appendices contain computer examples in Mathematica, Maple, and MATLAB. The text can be taught without computers. |
İçindekiler
Classical Cryptosystems | 12 |
Basic Number Theory | 63 |
The Data Encryption Standard | 113 |
Telif Hakkı | |
19 diğer bölüm gösterilmiyor
Diğer baskılar - Tümünü görüntüle
Introduction to Cryptography: With Coding Theory Wade Trappe,Lawrence C. Washington Metin Parçacığı görünümü - 2002 |
Sık kullanılan terimler ve kelime öbekleri
affine cipher algorithm Alice and Bob Alice sends Alice's attack b₁ binary birthday attack bits block cipher bytes c₁ calculate cards certificate Chapter Chinese remainder theorem chooses a random ciphertext codeword coefficients column compute congruence corresponding cryptographic cryptosystem decoding decryption exponent digits discrete log discrete logarithm dot product ElGamal elliptic curve encryption entropy example finite field frequency gcd(a gives hash function Hill cipher infinity mod input integer integers mod inverse large prime lattice length letters linear m₁ MATLAB matrix method mod q multiple nonzero obtain one-time pad output Peggy permutation plaintext polynomial possible prime factors primitive root probability problem procedure protocol public key quantum r₁ random number recurrence rows of G rsan S-box secret Section sequence Show signature Solution square mod square root Suppose theorem v₁ vector yields