國立虎尾科技大學 |

Cryptography for Secure Encryption

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Cryptography for Secure Encryption/ by Robert G. Underwood.
作者:	Underwood, Robert G.
面頁冊數:	XII, 319 p. 23 illus., 15 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Coding and Information Theory. -
電子資源:	https://doi.org/10.1007/978-3-030-97902-7
ISBN:	9783030979027

Cryptography for Secure Encryption
Underwood, Robert G.

Cryptography for Secure Encryption[electronic resource] /by Robert G. Underwood. - 1st ed. 2022. - XII, 319 p. 23 illus., 15 illus. in color.online resource. - Universitext,2191-6675. - Universitext,.

1. Introduction to Cryptography -- 2. Introduction to Probability -- 3. Information Theory and Entropy -- 4. Introduction to Complexity Theory -- 5. Algebraic Foundations: Groups- 6. Algebraic Foundations: Rings and Fields -- 7. Advanced Topics in Algebra -- 8.Symmetric Key Cryptography -- 9. Public Key Cryptography -- 10. Digital Signature Schemes -- 11. Key Generation -- 12. Key Distribution -- 13. Elliptic Curves in Cryptography -- 14. Singular Curves -- 15. Bibliography -- Index.

This text is intended for a one-semester course in cryptography at the advanced undergraduate/Master's degree level. It is suitable for students from various STEM backgrounds, including engineering, mathematics, and computer science, and may also be attractive for researchers and professionals who want to learn the basics of cryptography. Advanced knowledge of computer science or mathematics (other than elementary programming skills) is not assumed. The book includes more material than can be covered in a single semester. The Preface provides a suggested outline for a single semester course, though instructors are encouraged to select their own topics to reflect their specific requirements and interests. Each chapter contains a set of carefully written exercises which prompts review of the material in the chapter and expands on the concepts. Throughout the book, problems are stated mathematically, then algorithms are devised to solve the problems. Students are tasked to write computer programs (in C++ or GAP) to implement the algorithms. The use of programming skills to solve practical problems adds extra value to the use of this text. This book combines mathematical theory with practical applications to computer information systems. The fundamental concepts of classical and modern cryptography are discussed in relation to probability theory, complexity theory, modern algebra, and number theory. An overarching theme is cyber security: security of the cryptosystems and the key generation and distribution protocols, and methods of cryptanalysis (i.e., code breaking). It contains chapters on probability theory, information theory and entropy, complexity theory, and the algebraic and number theoretic foundations of cryptography. The book then reviews symmetric key cryptosystems, and discusses one-way trap door functions and public key cryptosystems including RSA and ElGamal. It contains a chapter on digital signature schemes, including material on message authentication and forgeries, and chapters on key generation and distribution. It contains a chapter on elliptic curve cryptography, including new material on the relationship between singular curves, algebraic groups and Hopf algebras.

ISBN: 9783030979027

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

669784
Coding and Information Theory.

LC Class. No.: QA241-247.5

Dewey Class. No.: 512.7

Cryptography for Secure Encryption
LDR:04100nam a22004095i 4500 001 1087061
003 DE-He213
005 20220603173619.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030979027 $9 978-3-030-97902-7
024 7 $a 10.1007/978-3-030-97902-7 $2 doi
035 $a 978-3-030-97902-7
050 4 $a QA241-247.5
072 7 $a PBH $2 bicssc
072 7 $a MAT022000 $2 bisacsh
072 7 $a PBH $2 thema
082 0 4 $a 512.7 $2 23
100 1 $a Underwood, Robert G. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 796577
245 1 0 $a Cryptography for Secure Encryption $h [electronic resource] / $c by Robert G. Underwood.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XII, 319 p. 23 illus., 15 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 Universitext, $x 2191-6675
505 0 $a 1. Introduction to Cryptography -- 2. Introduction to Probability -- 3. Information Theory and Entropy -- 4. Introduction to Complexity Theory -- 5. Algebraic Foundations: Groups- 6. Algebraic Foundations: Rings and Fields -- 7. Advanced Topics in Algebra -- 8.Symmetric Key Cryptography -- 9. Public Key Cryptography -- 10. Digital Signature Schemes -- 11. Key Generation -- 12. Key Distribution -- 13. Elliptic Curves in Cryptography -- 14. Singular Curves -- 15. Bibliography -- Index.
520 $a This text is intended for a one-semester course in cryptography at the advanced undergraduate/Master's degree level. It is suitable for students from various STEM backgrounds, including engineering, mathematics, and computer science, and may also be attractive for researchers and professionals who want to learn the basics of cryptography. Advanced knowledge of computer science or mathematics (other than elementary programming skills) is not assumed. The book includes more material than can be covered in a single semester. The Preface provides a suggested outline for a single semester course, though instructors are encouraged to select their own topics to reflect their specific requirements and interests. Each chapter contains a set of carefully written exercises which prompts review of the material in the chapter and expands on the concepts. Throughout the book, problems are stated mathematically, then algorithms are devised to solve the problems. Students are tasked to write computer programs (in C++ or GAP) to implement the algorithms. The use of programming skills to solve practical problems adds extra value to the use of this text. This book combines mathematical theory with practical applications to computer information systems. The fundamental concepts of classical and modern cryptography are discussed in relation to probability theory, complexity theory, modern algebra, and number theory. An overarching theme is cyber security: security of the cryptosystems and the key generation and distribution protocols, and methods of cryptanalysis (i.e., code breaking). It contains chapters on probability theory, information theory and entropy, complexity theory, and the algebraic and number theoretic foundations of cryptography. The book then reviews symmetric key cryptosystems, and discusses one-way trap door functions and public key cryptosystems including RSA and ElGamal. It contains a chapter on digital signature schemes, including material on message authentication and forgeries, and chapters on key generation and distribution. It contains a chapter on elliptic curve cryptography, including new material on the relationship between singular curves, algebraic groups and Hopf algebras.
650 2 4 $a Coding and Information Theory. $3 669784
650 1 4 $a Number Theory. $3 672023
650 0 $a Information theory. $3 595305
650 0 $a Coding theory. $3 561460
650 0 $a Number theory. $3 527883
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030979010
776 0 8 $i Printed edition: $z 9783030979034
776 0 8 $i Printed edition: $z 9783030979041
830 0 $a Universitext, $x 0172-5939 $3 1253835
856 4 0 $u https://doi.org/10.1007/978-3-030-97902-7
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)