國立虎尾科技大學 |

CryptoSchool

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	CryptoSchool/ by Joachim von zur Gathen.
作者:	von zur Gathen, Joachim.
面頁冊數:	XII, 876 p. 186 illus., 97 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Data structures (Computer science). -
電子資源:	https://doi.org/10.1007/978-3-662-48425-8
ISBN:	9783662484258

CryptoSchool
von zur Gathen, Joachim.

CryptoSchool[electronic resource] /by Joachim von zur Gathen. - 1st ed. 2015. - XII, 876 p. 186 illus., 97 illus. in color.online resource.

1 Introduction -- 2 Basic cryptosystems -- A Classical cryptology -- 3 The RSA cryptosystem -- B Key addition and modular arithmetic -- 4 Group cryptography and discrete logarithms -- 5 Elliptic curves -- C Breaking the unbreakable -- 6 Differential and linear cryptanalysis -- 7 Hash functions -- D Codebooks -- 8 Signatures -- 9 Security and reductions -- E Steganography -- 10 Identification and authentication -- F Transposition ciphers -- 11 Random generation -- G Some cryptographers -- 12 Proof systems and zero knowledge -- H People using cryptography -- 13 Integral lattices -- I The Zimmermann telegram -- 14 Quantum computation -- J Enigma, Turing, and Colossus -- 15 The computer algebra toolbox -- List of notation and sources of quotations, images, and ornaments -- Bibliography -- Index.

This book offers an introduction to cryptology, the science that makes secure communications possible, and addresses its two complementary aspects: cryptography — the art of making secure building blocks — and cryptanalysis — the art of breaking them. The text describes some of the most important systems in detail, including AES, RSA, group-based and lattice-based cryptography, signatures, hash functions, random generation, and more, providing detailed underpinnings for most of them. With regard to cryptanalysis, it presents a number of basic tools such as the differential and linear methods and lattice attacks. This text, based on lecture notes from the author’s many courses on the art of cryptography, consists of two interlinked parts. The first, modern part explains some of the basic systems used today and some attacks on them. However, a text on cryptology would not be complete without describing its rich and fascinating history. As such, the colorfully illustrated historical part interspersed throughout the text highlights selected inventions and episodes, providing a glimpse into the past of cryptology. The first sections of this book can be used as a textbook for an introductory course to computer science or mathematics. Other sections are suitable for advanced undergraduate or graduate courses. Many exercises are included. The emphasis is on providing a (reasonably) complete explanation of the background for some selected systems. < Joachim von zur Gathen has held professorships at the universities of Toronto, Paderborn, and Bonn, each for more than a decade. He is now retired (and active). His numerous visiting professorships were in Australia, Chile, Germany, South Africa, Spain, Switzerland, Uruguay, and USA. He is founder and was editor-in-chief for 25 years of the journal computational complexity, and was on the editorial boards of several other journals. He is listed in various editions of Who's Who in the World.

ISBN: 9783662484258

Standard No.: 10.1007/978-3-662-48425-8doiSubjects--Topical Terms:

680370
Data structures (Computer science).

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

CryptoSchool
LDR:04140nam a22004215i 4500 001 966693
003 DE-He213
005 20200703022338.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783662484258 $9 978-3-662-48425-8
024 7 $a 10.1007/978-3-662-48425-8 $2 doi
035 $a 978-3-662-48425-8
050 4 $a QA76.9.D35
050 4 $a Q350-390
072 7 $a UMB $2 bicssc
072 7 $a COM031000 $2 bisacsh
072 7 $a UMB $2 thema
072 7 $a GPF $2 thema
082 0 4 $a 005.73 $2 23
100 1 $a von zur Gathen, Joachim. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1262319
245 1 0 $a CryptoSchool $h [electronic resource] / $c by Joachim von zur Gathen.
250 $a 1st ed. 2015.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a XII, 876 p. 186 illus., 97 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
505 0 $a 1 Introduction -- 2 Basic cryptosystems -- A Classical cryptology -- 3 The RSA cryptosystem -- B Key addition and modular arithmetic -- 4 Group cryptography and discrete logarithms -- 5 Elliptic curves -- C Breaking the unbreakable -- 6 Differential and linear cryptanalysis -- 7 Hash functions -- D Codebooks -- 8 Signatures -- 9 Security and reductions -- E Steganography -- 10 Identification and authentication -- F Transposition ciphers -- 11 Random generation -- G Some cryptographers -- 12 Proof systems and zero knowledge -- H People using cryptography -- 13 Integral lattices -- I The Zimmermann telegram -- 14 Quantum computation -- J Enigma, Turing, and Colossus -- 15 The computer algebra toolbox -- List of notation and sources of quotations, images, and ornaments -- Bibliography -- Index.
520 $a This book offers an introduction to cryptology, the science that makes secure communications possible, and addresses its two complementary aspects: cryptography — the art of making secure building blocks — and cryptanalysis — the art of breaking them. The text describes some of the most important systems in detail, including AES, RSA, group-based and lattice-based cryptography, signatures, hash functions, random generation, and more, providing detailed underpinnings for most of them. With regard to cryptanalysis, it presents a number of basic tools such as the differential and linear methods and lattice attacks. This text, based on lecture notes from the author’s many courses on the art of cryptography, consists of two interlinked parts. The first, modern part explains some of the basic systems used today and some attacks on them. However, a text on cryptology would not be complete without describing its rich and fascinating history. As such, the colorfully illustrated historical part interspersed throughout the text highlights selected inventions and episodes, providing a glimpse into the past of cryptology. The first sections of this book can be used as a textbook for an introductory course to computer science or mathematics. Other sections are suitable for advanced undergraduate or graduate courses. Many exercises are included. The emphasis is on providing a (reasonably) complete explanation of the background for some selected systems. < Joachim von zur Gathen has held professorships at the universities of Toronto, Paderborn, and Bonn, each for more than a decade. He is now retired (and active). His numerous visiting professorships were in Australia, Chile, Germany, South Africa, Spain, Switzerland, Uruguay, and USA. He is founder and was editor-in-chief for 25 years of the journal computational complexity, and was on the editorial boards of several other journals. He is listed in various editions of Who's Who in the World.
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computers. $3 565115
650 0 $a Number theory. $3 527883
650 0 $a Algebra. $2 gtt $3 579870
650 0 $a Field theory (Physics). $3 685987
650 0 $a Electrical engineering. $3 596380
650 1 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Number Theory. $3 672023
650 2 4 $a Field Theory and Polynomials. $3 672025
650 2 4 $a Communications Engineering, Networks. $3 669809
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662484234
776 0 8 $i Printed edition: $z 9783662484241
776 0 8 $i Printed edition: $z 9783662501436
856 4 0 $u https://doi.org/10.1007/978-3-662-48425-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)