國立虎尾科技大學 |

Fundamentals of Cryptography = Introducing Mathematical and Algorithmic Foundations /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Fundamentals of Cryptography/ by Duncan Buell.
其他題名:	Introducing Mathematical and Algorithmic Foundations /
作者:	Buell, Duncan.
面頁冊數:	XV, 279 p. 50 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Theory of Computation. -
電子資源:	https://doi.org/10.1007/978-3-030-73492-3
ISBN:	9783030734923

Fundamentals of Cryptography = Introducing Mathematical and Algorithmic Foundations /
Buell, Duncan.

Fundamentals of CryptographyIntroducing Mathematical and Algorithmic Foundations /[electronic resource] :by Duncan Buell. - 1st ed. 2021. - XV, 279 p. 50 illus., 1 illus. in color.online resource. - Undergraduate Topics in Computer Science,2197-1781. - Undergraduate Topics in Computer Science,.

1. Introduction -- 2. Simple Ciphers -- 3. Divisibility, Congruences, and Modular Arithmetic -- 4. Groups, Rings, Fields -- 5. Square Roots and Quadratic Symbols -- 6. Finite Fields of Characteristic 2 -- 7. Elliptic Curves -- 8. Mathematics, Computing, and Arithmetic -- 9. Modern Symmetric Ciphers — DES and AES -- 10. Asymmetric Ciphers — RSA and Others -- 11. How to Factor a Number -- 12. How to Factor More Effectively -- 13. Cycles, Randomness, Discrete Logarithms, and Key Exchange -- 14. Elliptic Curve Cryptography -- 15. Quantum Computing and Cryptography -- 16. Lattice-Based Cryptography -- 17. Homomorphic Encryption -- 18. Exercises.

Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible. This unique and accessible textbook balances the theorems of mathematics against the feasibility of computation. Cryptography is something one actually “does”, not a mathematical game about which one proves theorems. There is deep math; there are some theorems that must be proven; and there is a need to recognize the brilliant work done by those who focus on theory. But at the level of an undergraduate course, the emphasis should be first on knowing and understanding the algorithms and how to implement them, and also to be aware that the algorithms must be implemented carefully to avoid the “easy” ways to break the cryptography. Hence, this text covers the algorithmic foundations and is complemented by core mathematics and arithmetic. Topics and features: Provides an exhaustive set of useful examples, to optimally convey the cryptographic computations Focuses on doing cryptography, rather than on proving theorems Includes detailed source code and a test suite Describes NTRU as a lattice-based cryptographic algorithm Addresses, among other topics, factoring attacks (including their history), elliptic curve cryptography, quantum cryptography, and homomorphic encryption This clearly written introductory textbook emphasizes how implementation issues affect algorithm decisions and will reinforce learning for computer science (or mathematics) students studying cryptography at the undergraduate level. In addition, it will be ideal for professional short courses or self-study. Duncan Buell, professor emeritus in the Dept. of Computer Science and Engineering at University of South Carolina, also has 15 years of experience at a research lab doing high-performance computing research in support of the U.S. National Security Agency.

ISBN: 9783030734923

Standard No.: 10.1007/978-3-030-73492-3doiSubjects--Topical Terms:

669322
Theory of Computation.

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.8

Fundamentals of Cryptography = Introducing Mathematical and Algorithmic Foundations /
LDR:03947nam a22004095i 4500 001 1055543
003 DE-He213
005 20211129222432.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030734923 $9 978-3-030-73492-3
024 7 $a 10.1007/978-3-030-73492-3 $2 doi
035 $a 978-3-030-73492-3
050 4 $a QA76.9.A25
072 7 $a UR $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a UR $2 thema
072 7 $a UTN $2 thema
082 0 4 $a 005.8 $2 23
100 1 $a Buell, Duncan. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1360752
245 1 0 $a Fundamentals of Cryptography $h [electronic resource] : $b Introducing Mathematical and Algorithmic Foundations / $c by Duncan Buell.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XV, 279 p. 50 illus., 1 illus. in color. $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 Undergraduate Topics in Computer Science, $x 2197-1781
505 0 $a 1. Introduction -- 2. Simple Ciphers -- 3. Divisibility, Congruences, and Modular Arithmetic -- 4. Groups, Rings, Fields -- 5. Square Roots and Quadratic Symbols -- 6. Finite Fields of Characteristic 2 -- 7. Elliptic Curves -- 8. Mathematics, Computing, and Arithmetic -- 9. Modern Symmetric Ciphers — DES and AES -- 10. Asymmetric Ciphers — RSA and Others -- 11. How to Factor a Number -- 12. How to Factor More Effectively -- 13. Cycles, Randomness, Discrete Logarithms, and Key Exchange -- 14. Elliptic Curve Cryptography -- 15. Quantum Computing and Cryptography -- 16. Lattice-Based Cryptography -- 17. Homomorphic Encryption -- 18. Exercises.
520 $a Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible. This unique and accessible textbook balances the theorems of mathematics against the feasibility of computation. Cryptography is something one actually “does”, not a mathematical game about which one proves theorems. There is deep math; there are some theorems that must be proven; and there is a need to recognize the brilliant work done by those who focus on theory. But at the level of an undergraduate course, the emphasis should be first on knowing and understanding the algorithms and how to implement them, and also to be aware that the algorithms must be implemented carefully to avoid the “easy” ways to break the cryptography. Hence, this text covers the algorithmic foundations and is complemented by core mathematics and arithmetic. Topics and features: Provides an exhaustive set of useful examples, to optimally convey the cryptographic computations Focuses on doing cryptography, rather than on proving theorems Includes detailed source code and a test suite Describes NTRU as a lattice-based cryptographic algorithm Addresses, among other topics, factoring attacks (including their history), elliptic curve cryptography, quantum cryptography, and homomorphic encryption This clearly written introductory textbook emphasizes how implementation issues affect algorithm decisions and will reinforce learning for computer science (or mathematics) students studying cryptography at the undergraduate level. In addition, it will be ideal for professional short courses or self-study. Duncan Buell, professor emeritus in the Dept. of Computer Science and Engineering at University of South Carolina, also has 15 years of experience at a research lab doing high-performance computing research in support of the U.S. National Security Agency.
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Cryptology. $3 1211076
650 1 4 $a Systems and Data Security. $3 677062
650 0 $a Computers. $3 565115
650 0 $a Data encryption (Computer science). $3 1051084
650 0 $a Computer security. $3 557122
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030734916
776 0 8 $i Printed edition: $z 9783030734930
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-030-73492-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)