大葉大學圖書館 |

Introduction to cryptography[electronic resource] :principles and applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	005.8
書名/作者:	Introduction to cryptography : principles and applications // by Hans Delfs, Helmut Knebl.
作者:	Delfs, Hans.
其他作者:	Knebl, Helmut.
出版者:	Berlin, Heidelberg : : Springer Berlin Heidelberg :, 2015.
面頁冊數:	xx, 508 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer security.
標題:	Cryptography.
標題:	Computer networks - Security measures.
標題:	Coding theory.
標題:	Computer Science.
標題:	Data Structures, Cryptology and Information Theory.
標題:	Number Theory.
標題:	Systems and Data Security.
標題:	Mathematics of Computing.
ISBN:	9783662479742
ISBN:	9783662479735
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-662-47974-2

Introduction to cryptography[electronic resource] :principles and applications /
Delfs, Hans.

Introduction to cryptographyprinciples and applications /[electronic resource] :by Hans Delfs, Helmut Knebl. - 3rd ed. - Berlin, Heidelberg :Springer Berlin Heidelberg :2015. - xx, 508 p. :ill., digital ;24 cm. - Information security and cryptography,1619-7100. - Information security and cryptography..

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.

ISBN: 9783662479742

Standard No.: 10.1007/978-3-662-47974-2doiSubjects--Topical Terms:

338952
Computer security.

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.8

Introduction to cryptography[electronic resource] :principles and applications /
LDR:03150nam a2200349 a 4500 001 443903
003 DE-He213
005 20160428143128.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783662479742 $q (electronic bk.)
020 $a 9783662479735 $q (paper)
024 7 $a 10.1007/978-3-662-47974-2 $2 doi
035 $a 978-3-662-47974-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25
072 7 $a UMB $2 bicssc
072 7 $a URY $2 bicssc
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 005.8 $2 23
090 $a QA76.9.A25 $b D351 2015
100 1 $a Delfs, Hans. $3 635000
245 1 0 $a Introduction to cryptography $h [electronic resource] : $b principles and applications / $c by Hans Delfs, Helmut Knebl.
250 $a 3rd ed.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a xx, 508 p. : $b ill., digital ; $c 24 cm.
490 1 $a Information security and cryptography, $x 1619-7100
505 0 $a 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.
520 $a 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.
650 0 $a Computer security. $3 338952
650 0 $a Cryptography. $3 381147
650 0 $a Computer networks $x Security measures. $3 341462
650 0 $a Coding theory. $3 188068
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Data Structures, Cryptology and Information Theory. $3 466976
650 2 4 $a Number Theory. $3 464120
650 2 4 $a Systems and Data Security. $3 466229
650 2 4 $a Mathematics of Computing. $3 465323
700 1 $a Knebl, Helmut. $3 635001
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Information security and cryptography. $3 613969
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-47974-2
950 $a Computer Science (Springer-11645)