Scientific Library of Tomsk State University

   E-catalog        

Normal view MARC view

Introduction to Cryptography electronic resource Principles and Applications / by Hans Delfs, Helmut Knebl.

By: Delfs, Hans [author.]Contributor(s): Knebl, Helmut [author.] | SpringerLink (Online service)Material type: TextTextSeries: Information Security and CryptographyPublication details: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015Edition: 3rd ed. 2015Description: XX, 508 p. 5 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783662479742Subject(s): Computer Science | Computer security | Data structures (Computer science) | Computer science -- Mathematics | Number theory | Computer Science | Data Structures, Cryptology and Information Theory | Number Theory | Systems and Data Security | Mathematics of ComputingDDC classification: 005.74 LOC classification: QA76.9.D35Online resources: Click here to access online
Contents:
Introduction -- Symmetric-Key Encryption -- Public-Key Cryptography -- Cryptographic Protocols -- Probabilistic Algorithms -- One-Way Functions and the Basic Assumptions -- Bit Security of One-Way Functions -- One-Way Functions and Pseudorandomness -- Provably Secure Encryption -- Unconditional Security of Cryptosystems -- Provably Secure Digital Signatures -- App. A, Algebra and Number Theory -- App. B, Probabilities and Information Theory -- References -- Index.
In: Springer eBooksSummary: The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises.   In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles.   The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Introduction -- Symmetric-Key Encryption -- Public-Key Cryptography -- Cryptographic Protocols -- Probabilistic Algorithms -- One-Way Functions and the Basic Assumptions -- Bit Security of One-Way Functions -- One-Way Functions and Pseudorandomness -- Provably Secure Encryption -- Unconditional Security of Cryptosystems -- Provably Secure Digital Signatures -- App. A, Algebra and Number Theory -- App. B, Probabilities and Information Theory -- References -- Index.

The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises.   In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles.   The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.

There are no comments on this title.

to post a comment.
Share