000 04098nam a22004935i 4500
003 DE-He213
005 20231104114205.0
007 cr nn 008mamaa
008 150929s2015 gw | s |||| 0|eng d
020 _a9783662479742
_z978-3-662-47974-2
024 7 _a10.1007/978-3-662-47974-2
_2doi
050 4 _aQA76.9.D35
072 7 _aUMB
_2bicssc
072 7 _aCOM031000
_2bisacsh
072 7 _aUMB
_2thema
072 7 _aURY
_2thema005.74
_223
100 1 _aDelfs, Hans.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aIntroduction to Cryptography :
_bPrinciples and Applications /
_cby Hans Delfs, Helmut Knebl.
250 _a3rd ed. 2015.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aInformation Security and Cryptography,
_x1619-7100
505 0 _aIntroduction -- 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 _aThe 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 _aData structures (Computer scienc.
650 0 _aNumber theory.
650 0 _aComputer security.
650 0 _aComputer science.
650 1 4 _aData Structures and Information Theory.
_0http://scigraph.springernature.com/things/product-market-codes/I15009
650 2 4 _aNumber Theory.
_0http://scigraph.springernature.com/things/product-market-codes/M25001
650 2 4 _aSystems and Data Security.
_0http://scigraph.springernature.com/things/product-market-codes/I28060
650 2 4 _aMathematics of Computing.
_0http://scigraph.springernature.com/things/product-market-codes/I17001
700 1 _aKnebl, Helmut.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
710 2 _aSpringerLink (Online service)
856 4 0 _uhttps://doi.org/10.1007/978-3-662-47974-2
_3Springer eBooks
_zOnline access link to the resource
912 _aZDB-2-SCS
999 _c200433697
_d51909
942 _2lcc
_cEBK
041 _aeng