國立高雄大學圖資館 |

Language: English

Back

Fundamentals of cryptographyintroduc...

Buell, Duncan.

Fundamentals of cryptographyintroducing mathematical and algorithmic foundations /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Fundamentals of cryptographyby Duncan Buell.
Reminder of title:	introducing mathematical and algorithmic foundations /
Author:	Buell, Duncan.
Published:	Cham :Springer International Publishing :2021.
Description:	xv, 279 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Data encryption (Computer science)Mathematics.
Online resource:	https://doi.org/10.1007/978-3-030-73492-3
ISBN:	9783030734923$q(electronic bk.)

Fundamentals of cryptographyintroducing mathematical and algorithmic foundations /
Buell, Duncan.

Fundamentals of cryptographyintroducing mathematical and algorithmic foundations /[electronic resource] :by Duncan Buell. - Cham :Springer International Publishing :2021. - xv, 279 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,1863-7310. - 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$q(electronic bk.)

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

561340
Data encryption (Computer science)
--Mathematics.

LC Class. No.: QA76.9.A25 / B84 2021

Dewey Class. No.: 005.824

Fundamentals of cryptographyintroducing mathematical and algorithmic foundations /
LDR:03619nmm a2200349 a 4500 001 601962
003 DE-He213
005 20210622025604.0
006 m d
007 cr nn 008maaau
008 211112s2021 sz s 0 eng d
020 $a 9783030734923$q(electronic bk.)
020 $a 9783030734916$q(paper)
024 7 $a 10.1007/978-3-030-73492-3 $2 doi
035 $a 978-3-030-73492-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25 $b B84 2021
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.824 $2 23
090 $a QA76.9.A25 $b B928 2021
100 1 $a Buell, Duncan. $3 897578
245 1 0 $a Fundamentals of cryptography $h [electronic resource] : $b introducing mathematical and algorithmic foundations / $c by Duncan Buell.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 279 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 1863-7310
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 0 $a Data encryption (Computer science) $x Mathematics. $3 561340
650 0 $a Cryptography. $3 189522
650 1 4 $a Systems and Data Security. $3 274481
650 2 4 $a Cryptology. $3 825728
650 2 4 $a Theory of Computation. $3 274475
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Undergraduate topics in computer science. $3 559648
856 4 0 $u https://doi.org/10.1007/978-3-030-73492-3
950 $a Computer Science (SpringerNature-11645)