大葉大學圖書館 |

Cryptography made simple[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	005.82
書名/作者:	Cryptography made simple/ by Nigel P. Smart.
作者:	Smart, Nigel P.
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	xii, 481 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Data encryption (Computer science)
標題:	Cryptography.
標題:	Computer Science.
標題:	Data Structures, Cryptology and Information Theory.
標題:	Mathematics of Computing.
標題:	Security Science and Technology.
標題:	Discrete Mathematics.
ISBN:	9783319219363
ISBN:	9783319219356
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-21936-3

Cryptography made simple[electronic resource] /
Smart, Nigel P.

Cryptography made simple[electronic resource] /by Nigel P. Smart. - Cham :Springer International Publishing :2016. - xii, 481 p. :ill., digital ;24 cm. - 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:

369827
Data encryption (Computer science)

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.82

Cryptography made simple[electronic resource] /
LDR:04066nam a2200337 a 4500 001 454666
003 DE-He213
005 20160725145134.0
006 m d
007 cr nn 008maaau
008 161227s2016 gw s 0 eng d
020 $a 9783319219363 $q (electronic bk.)
020 $a 9783319219356 $q (paper)
024 7 $a 10.1007/978-3-319-21936-3 $2 doi
035 $a 978-3-319-21936-3
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.82 $2 23
090 $a QA76.9.A25 $b S636 2016
100 1 $a Smart, Nigel P. $3 652338
245 1 0 $a Cryptography made simple $h [electronic resource] / $c by Nigel P. Smart.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xii, 481 p. : $b ill., digital ; $c 24 cm.
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 encryption (Computer science) $3 369827
650 0 $a Cryptography. $3 381147
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Data Structures, Cryptology and Information Theory. $3 466976
650 2 4 $a Mathematics of Computing. $3 465323
650 2 4 $a Security Science and Technology. $3 467803
650 2 4 $a Discrete Mathematics. $3 470158
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-319-21936-3
950 $a Computer Science (Springer-11645)