Introduction to Cryptography / by Johannes Buchmann.

Format:

Book

Author/Creator:

Buchmann, Johannes, author.

Contributor:

SpringerLink (Online service)

Series:

Undergraduate texts in mathematics 0172-6056

Undergraduate Texts in Mathematics, 0172-6056

Language:

English

Subjects (All):

Number theory.

Data structures (Computer science).

Number Theory.

Data Structures and Information Theory.

Local Subjects:

Number Theory.

Data Structures and Information Theory.

Physical Description:

1 online resource (XVI, 338 pages).

Edition:

Second edition 2004.

Contained In:

Springer Nature eBook

Place of Publication:

New York, NY : Springer New York : Imprint: Springer, 2004.

System Details:

text file PDF

Summary:

Cryptography is a key technology in electronic key systems. It is used to keep data secret, digitally sign documents, access control, et cetera Therefore, users should not only know how its techniques work, but they must also be able to estimate their efficiency and security. For this new edition, the author has updated the discussion of the security of encryption and signature schemes and recent advances in factoring and computing discrete logarithms. He has also added descriptions of time-memory trade of attacks and algebraic attacks on block ciphers, the Advanced Encryption Standard, the Secure Hash Algorithm, secret sharing schemes, and undeniable and blind signatures. Johannes A. Buchmann is a Professor of Computer Science and Mathematics at the Technical University of Darmstadt, and the Associate Editor of the Journal of Cryptology. In 1985, he received the Feodor Lynen Fellowship of the Alexander von Humboldt Foundation. Furthermore, he has received the most prestigious award in science in Germany, the Leibniz Award of the German Science Foundation. About the first edition: It is amazing how much Buchmann is able to do in under 300 pages: self-contained explanations of the relevant mathematics (with proofs); a systematic introduction to symmetric cryptosystems, including a detailed description and discussion of DES; a good treatment of primality testing, integer factorization, and algorithms for discrete logarithms; clearly written sections describing most of the major types of cryptosystems....This book is an excellent reference, and I believe it would also be a good textbook for a course for mathematics or computer science majors..." -Neal Koblitz, The American Mathematical Monthly.

Contents:

1 Integers

2 Congruences and Residue Class Rings

3 Encryption

4 Probability and Perfect Secrecy

5 DES

6 AES

7 Prime Number Generation

8 Public-Key Encryption

9 Factoring

10 Discrete Logarithms

11 Cryptographic Hash Functions

12 Digital Signatures

13 Other Systems

14 Identification

15 Secret Sharing

16 Public-Key Infrastructures

Solutions of the exercises

References.

Other Format:

Printed edition:

ISBN:

9781441990037

Access Restriction:

Restricted for use by site license.