東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Cryptology and error correction = an...

Childs, Lindsay N.

FindBook

Google Book

Amazon

博客來

Cryptology and error correction = an algebraic introduction and real-world applications /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Cryptology and error correction/ by Lindsay N. Childs.
其他題名:	an algebraic introduction and real-world applications /
作者:	Childs, Lindsay N.
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xiv, 351 p. :ill. (some col.), digital ;24 cm.
內容註:	Preface -- 1. Secure, Reliable Information -- 2. Modular Arithmetic -- 3. Linear Equations Modulo m -- 4. Unique Factorization in Z -- 5. Rings and Fields -- 6. Polynomials -- 7. Matrices and Hamming Codes -- 8. Orders and Euler's theorem -- 9. RSA Cryptography and Prime Numbers -- 10. Groups, Cosets, and Lagrange's theorem -- 11. Solving Systems of Congruences -- 12. Homomorphisms and Euler's Phi function -- 13. Cyclic Groups and Cryptography -- 14. Applications of Cosets -- 15. An Introduction to Reed-Solomon codes -- 16. Blum-Goldwasser Cryptography -- 17. Factoring by the Quadratic Sieve -- 18. Polynomials and Finite Fields -- 19. Reed-Solomon Codes II -- Bibliography.
Contained By:	Springer eBooks
標題:	Cryptography. -
電子資源:	https://doi.org/10.1007/978-3-030-15453-0
ISBN:	9783030154530

Cryptology and error correction = an algebraic introduction and real-world applications /
Childs, Lindsay N.

Cryptology and error correctionan algebraic introduction and real-world applications /[electronic resource] :by Lindsay N. Childs. - Cham :Springer International Publishing :2019. - xiv, 351 p. :ill. (some col.), digital ;24 cm. - Springer undergraduate texts in mathematics and technology,1867-5506. - Springer undergraduate texts in mathematics and technology..

Preface -- 1. Secure, Reliable Information -- 2. Modular Arithmetic -- 3. Linear Equations Modulo m -- 4. Unique Factorization in Z -- 5. Rings and Fields -- 6. Polynomials -- 7. Matrices and Hamming Codes -- 8. Orders and Euler's theorem -- 9. RSA Cryptography and Prime Numbers -- 10. Groups, Cosets, and Lagrange's theorem -- 11. Solving Systems of Congruences -- 12. Homomorphisms and Euler's Phi function -- 13. Cyclic Groups and Cryptography -- 14. Applications of Cosets -- 15. An Introduction to Reed-Solomon codes -- 16. Blum-Goldwasser Cryptography -- 17. Factoring by the Quadratic Sieve -- 18. Polynomials and Finite Fields -- 19. Reed-Solomon Codes II -- Bibliography.

This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for understanding these methods. The objective is to provide a thorough understanding of RSA, Diffie-Hellman, and Blum-Goldwasser cryptosystems and Hamming and Reed-Solomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked. To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebra--rings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets. Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory. This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.

ISBN: 9783030154530

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

532586
Cryptography.

LC Class. No.: QA268

Dewey Class. No.: 003.54

Cryptology and error correction = an algebraic introduction and real-world applications /
LDR:03221nmm a2200337 a 4500 001 2190597
003 DE-He213
005 20190418161328.0
006 m d
007 cr nn 008maaau
008 200501s2019 gw s 0 eng d
020 $a 9783030154530 $q (electronic bk.)
020 $a 9783030154516 $q (paper)
024 7 $a 10.1007/978-3-030-15453-0 $2 doi
035 $a 978-3-030-15453-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA268
072 7 $a PBF $2 bicssc
072 7 $a MAT002000 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 003.54 $2 23
090 $a QA268 $b .C537 2019
100 1 $a Childs, Lindsay N. $3 1001947
245 1 0 $a Cryptology and error correction $h [electronic resource] : $b an algebraic introduction and real-world applications / $c by Lindsay N. Childs.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiv, 351 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Springer undergraduate texts in mathematics and technology, $x 1867-5506
505 0 $a Preface -- 1. Secure, Reliable Information -- 2. Modular Arithmetic -- 3. Linear Equations Modulo m -- 4. Unique Factorization in Z -- 5. Rings and Fields -- 6. Polynomials -- 7. Matrices and Hamming Codes -- 8. Orders and Euler's theorem -- 9. RSA Cryptography and Prime Numbers -- 10. Groups, Cosets, and Lagrange's theorem -- 11. Solving Systems of Congruences -- 12. Homomorphisms and Euler's Phi function -- 13. Cyclic Groups and Cryptography -- 14. Applications of Cosets -- 15. An Introduction to Reed-Solomon codes -- 16. Blum-Goldwasser Cryptography -- 17. Factoring by the Quadratic Sieve -- 18. Polynomials and Finite Fields -- 19. Reed-Solomon Codes II -- Bibliography.
520 $a This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for understanding these methods. The objective is to provide a thorough understanding of RSA, Diffie-Hellman, and Blum-Goldwasser cryptosystems and Hamming and Reed-Solomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked. To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebra--rings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets. Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory. This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.
650 0 $a Cryptography. $3 532586
650 0 $a Error-correcting codes (Information theory) $x Mathematics. $3 3409230
650 1 4 $a Algebra. $3 516203
650 2 4 $a Cryptology. $3 3382308
650 2 4 $a Number Theory. $3 891078
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Springer undergraduate texts in mathematics and technology. $3 1629118
856 4 0 $u https://doi.org/10.1007/978-3-030-15453-0
950 $a Mathematics and Statistics (Springer-11649)