大葉大學圖書館 |

A cryptography primer[electronic resource] :secrets and promises /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	005.82
書名/作者:	A cryptography primer : secrets and promises // Philip N. Klein.
作者:	Klein, Philip N.
出版者:	Cambridge : : Cambridge University Press,, 2014.
面頁冊數:	xiii, 174 p. : : ill., digital ;; 24 cm.
標題:	Computer security.
標題:	Data encryption (Computer science)
標題:	Digital signatures.
標題:	Telecommunication - Safety measures.
ISBN:	9781139084772
ISBN:	9781107017887
ISBN:	9781107603455
內容註:	Machine generated contents note: 1. Introduction; 2. Modular arithmetic; 3. The addition cypher, an insecure block cypher; 4. Functions; 5. Probability theory; 6. Perfect secrecy and perfectly secure cryptosystems; 7. Number theory; 8. Euclid's algorithm; 9. Some uses of perfect secrecy; 10. Computational problems, easy and hard; 11. Modular exponentiation, modular logarithm, and one-way functions; 12. Diffie and Hellman's exponential-key-agreement protocol; 13. Computationally secure single-key cryptosystems; 14. Public-key cryptosystems and digital signatures.
摘要、提要註:	Cryptography has been employed in war and diplomacy from the time of Julius Caesar. In our Internet age, cryptography's most widespread application may be for commerce, from protecting the security of electronic transfers to guarding communication from industrial espionage. This accessible introduction for undergraduates explains the cryptographic protocols for achieving privacy of communication and the use of digital signatures for certifying the validity, integrity, and origin of a message, document, or program. Rather than offering a how-to on configuring web browsers and e-mail programs, the author provides a guide to the principles and elementary mathematics underlying modern cryptography, giving readers a look under the hood for security techniques and the reasons they are thought to be secure.
電子資源:	https://doi.org/10.1017/CBO9781139084772

A cryptography primer[electronic resource] :secrets and promises /
Klein, Philip N.

A cryptography primersecrets and promises /[electronic resource] :Philip N. Klein. - Cambridge :Cambridge University Press,2014. - xiii, 174 p. :ill., digital ;24 cm.

Machine generated contents note: 1. Introduction; 2. Modular arithmetic; 3. The addition cypher, an insecure block cypher; 4. Functions; 5. Probability theory; 6. Perfect secrecy and perfectly secure cryptosystems; 7. Number theory; 8. Euclid's algorithm; 9. Some uses of perfect secrecy; 10. Computational problems, easy and hard; 11. Modular exponentiation, modular logarithm, and one-way functions; 12. Diffie and Hellman's exponential-key-agreement protocol; 13. Computationally secure single-key cryptosystems; 14. Public-key cryptosystems and digital signatures.

Cryptography has been employed in war and diplomacy from the time of Julius Caesar. In our Internet age, cryptography's most widespread application may be for commerce, from protecting the security of electronic transfers to guarding communication from industrial espionage. This accessible introduction for undergraduates explains the cryptographic protocols for achieving privacy of communication and the use of digital signatures for certifying the validity, integrity, and origin of a message, document, or program. Rather than offering a how-to on configuring web browsers and e-mail programs, the author provides a guide to the principles and elementary mathematics underlying modern cryptography, giving readers a look under the hood for security techniques and the reasons they are thought to be secure.

ISBN: 9781139084772Subjects--Topical Terms:

338952
Computer security.

LC Class. No.: QA76.9.A25 / K557 2014

Dewey Class. No.: 005.82

A cryptography primer[electronic resource] :secrets and promises /
LDR:02178nmm a2200265 a 4500 001 491818
003 UkCbUP
005 20151005020622.0
006 m d
007 cr nn 008maaau
008 210201s2014 enk o 1 0 eng d
020 $a 9781139084772 $q (electronic bk.)
020 $a 9781107017887 $q (hardback)
020 $a 9781107603455 $q (paperback)
035 $a CR9781139084772
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA76.9.A25 $b K557 2014
082 0 4 $a 005.82 $2 23
090 $a QA76.9.A25 $b K64 2014
100 1 $a Klein, Philip N. $3 711575
245 1 2 $a A cryptography primer $h [electronic resource] : $b secrets and promises / $c Philip N. Klein.
260 $a Cambridge : $b Cambridge University Press, $c 2014.
300 $a xiii, 174 p. : $b ill., digital ; $c 24 cm.
505 8 $a Machine generated contents note: 1. Introduction; 2. Modular arithmetic; 3. The addition cypher, an insecure block cypher; 4. Functions; 5. Probability theory; 6. Perfect secrecy and perfectly secure cryptosystems; 7. Number theory; 8. Euclid's algorithm; 9. Some uses of perfect secrecy; 10. Computational problems, easy and hard; 11. Modular exponentiation, modular logarithm, and one-way functions; 12. Diffie and Hellman's exponential-key-agreement protocol; 13. Computationally secure single-key cryptosystems; 14. Public-key cryptosystems and digital signatures.
520 $a Cryptography has been employed in war and diplomacy from the time of Julius Caesar. In our Internet age, cryptography's most widespread application may be for commerce, from protecting the security of electronic transfers to guarding communication from industrial espionage. This accessible introduction for undergraduates explains the cryptographic protocols for achieving privacy of communication and the use of digital signatures for certifying the validity, integrity, and origin of a message, document, or program. Rather than offering a how-to on configuring web browsers and e-mail programs, the author provides a guide to the principles and elementary mathematics underlying modern cryptography, giving readers a look under the hood for security techniques and the reasons they are thought to be secure.
650 0 $a Computer security. $3 338952
650 0 $a Data encryption (Computer science) $3 369827
650 0 $a Digital signatures. $3 609293
650 0 $a Telecommunication $x Safety measures. $3 608265
856 4 0 $u https://doi.org/10.1017/CBO9781139084772