國立虎尾科技大學 |

Cryptography Made Simple

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Cryptography Made Simple/ by Nigel Smart.
作者:	Smart, Nigel.
面頁冊數:	XII, 481 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Data structures (Computer science). -
電子資源:	https://doi.org/10.1007/978-3-319-21936-3
ISBN:	9783319219363

Cryptography Made Simple
Smart, Nigel.

Cryptography Made Simple[electronic resource] /by Nigel Smart. - 1st ed. 2016. - XII, 481 p.online resource. - Information Security and Cryptography,1619-7100. - Information Security and Cryptography,.

Modular Arithmetic, Groups, Finite Fields and Probability -- Elliptic Curves -- Historical Ciphers -- The Enigma Machine -- Information Theoretic Security -- Historical Stream Ciphers -- Modern Stream Ciphers -- Block Ciphers -- Symmetric Key Distribution -- Hash Functions and Message Authentication Codes -- Basic Public Key Encryption Algorithms -- Primality Testing and Factoring -- Discrete Logarithms -- Key Exchange and Signature Schemes -- Implementation Issues -- Obtaining Authentic Public Keys -- Attacks on Public Key Schemes -- Definitions of Security -- Complexity Theoretic Approaches -- Provable Security: With Random Oracles -- Hybrid Encryption -- Provable Security: Without Random Oracles -- Secret Sharing Schemes -- Commitments and Oblivious Transfer -- Zero-Knowledge Proofs -- Secure Multiparty Computation.

In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout. The chapters in Part 1 offer a brief introduction to the mathematical foundations: modular arithmetic, groups, finite fields, and probability; primality testing and factoring; discrete logarithms; elliptic curves; and lattices. Part 2 of the book shows how historical ciphers were broken, thus motivating the design of modern cryptosystems since the 1960s; this part also includes a chapter on information-theoretic security. Part 3 covers the core aspects of modern cryptography: the definition of security; modern stream ciphers; block ciphers and modes of operation; hash functions, message authentication codes, and key derivation functions; the "naive" RSA algorithm; public key encryption and signature algorithms; cryptography based on computational complexity; and certificates, key transport and key agreement. Finally, Part 4 addresses advanced prot ocols, where the parties may have different or even conflicting security goals: secret sharing schemes; commitments and oblivious transfer; zero-knowledge proofs; and secure multi-party computation. The author balances a largely non-rigorous style — many proofs are sketched only — with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading. This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus.

ISBN: 9783319219363

Standard No.: 10.1007/978-3-319-21936-3doiSubjects--Topical Terms:

680370
Data structures (Computer science).

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Cryptography Made Simple
LDR:04469nam a22004335i 4500 001 979401
003 DE-He213
005 20200707030945.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319219363 $9 978-3-319-21936-3
024 7 $a 10.1007/978-3-319-21936-3 $2 doi
035 $a 978-3-319-21936-3
050 4 $a QA76.9.D35
050 4 $a Q350-390
072 7 $a UMB $2 bicssc
072 7 $a COM031000 $2 bisacsh
072 7 $a UMB $2 thema
072 7 $a GPF $2 thema
082 0 4 $a 005.73 $2 23
100 1 $a Smart, Nigel. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 675924
245 1 0 $a Cryptography Made Simple $h [electronic resource] / $c by Nigel Smart.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XII, 481 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Information Security and Cryptography, $x 1619-7100
505 0 $a Modular Arithmetic, Groups, Finite Fields and Probability -- Elliptic Curves -- Historical Ciphers -- The Enigma Machine -- Information Theoretic Security -- Historical Stream Ciphers -- Modern Stream Ciphers -- Block Ciphers -- Symmetric Key Distribution -- Hash Functions and Message Authentication Codes -- Basic Public Key Encryption Algorithms -- Primality Testing and Factoring -- Discrete Logarithms -- Key Exchange and Signature Schemes -- Implementation Issues -- Obtaining Authentic Public Keys -- Attacks on Public Key Schemes -- Definitions of Security -- Complexity Theoretic Approaches -- Provable Security: With Random Oracles -- Hybrid Encryption -- Provable Security: Without Random Oracles -- Secret Sharing Schemes -- Commitments and Oblivious Transfer -- Zero-Knowledge Proofs -- Secure Multiparty Computation.
520 $a In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout. The chapters in Part 1 offer a brief introduction to the mathematical foundations: modular arithmetic, groups, finite fields, and probability; primality testing and factoring; discrete logarithms; elliptic curves; and lattices. Part 2 of the book shows how historical ciphers were broken, thus motivating the design of modern cryptosystems since the 1960s; this part also includes a chapter on information-theoretic security. Part 3 covers the core aspects of modern cryptography: the definition of security; modern stream ciphers; block ciphers and modes of operation; hash functions, message authentication codes, and key derivation functions; the "naive" RSA algorithm; public key encryption and signature algorithms; cryptography based on computational complexity; and certificates, key transport and key agreement. Finally, Part 4 addresses advanced prot ocols, where the parties may have different or even conflicting security goals: secret sharing schemes; commitments and oblivious transfer; zero-knowledge proofs; and secure multi-party computation. The author balances a largely non-rigorous style — many proofs are sketched only — with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading. This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus.
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a System safety. $3 639363
650 0 $a Discrete mathematics. $3 1254302
650 1 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Security Science and Technology. $3 783419
650 2 4 $a Discrete Mathematics. $3 796600
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319219356
776 0 8 $i Printed edition: $z 9783319219370
776 0 8 $i Printed edition: $z 9783319373096
830 0 $a Information Security and Cryptography, $x 1619-7100 $3 1263985
856 4 0 $u https://doi.org/10.1007/978-3-319-21936-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)