LEADER 06088nam 2200673Ia 450 001 9910461902303321 005 20200520144314.0 010 $a0-88385-937-8 035 $a(CKB)2670000000205152 035 $a(EBL)3330402 035 $a(OCoLC)923220115 035 $a(SSID)ssj0000577600 035 $a(PQKBManifestationID)11378675 035 $a(PQKBTitleCode)TC0000577600 035 $a(PQKBWorkID)10577319 035 $a(PQKB)11377121 035 $a(UkCbUP)CR9780883859377 035 $a(MiAaPQ)EBC3330402 035 $a(Au-PeEL)EBL3330402 035 $a(CaPaEBR)ebr10729373 035 $a(OCoLC)929120246 035 $a(EXLCZ)992670000000205152 100 $a20090528d2009 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aElementary cryptanalysis$b[electronic resource] $ea mathematical approach /$fAbraham Sinkov 205 $a2nd ed. /$brevised and updated by Todd Feil. 210 $a[Washington, D.C.] $cMathematical Association of America ;$aCambridge $cCambridge University Press [distributor]$dc2009 215 $a1 online resource (227 p.) 225 0$aAnneli Lax new mathematical library ;$vv. 22 300 $aDescription based upon print version of record. 311 $a0-88385-647-6 320 $aIncludes bibliographical references (p. 205-206) and index. 327 $a""cover ""; ""copyright page ""; ""title page ""; ""Contents""; ""Preface to the First Edition""; ""Preface to the Second Edition""; ""1 Monoalphabetic Ciphers Using Additive Alphabets""; ""1.1 The Caesar Cipher""; ""Exercises""; ""1.2 Modular arithmetic""; ""Exercises""; ""1.3 Additive alphabets""; ""Exercises""; ""1.4 Solution of additive alphabets by completing the plain component""; ""Exercises""; ""1.5 Solving additive alphabets by frequency considerations""; ""Exercises""; ""1.6 Alphabets based on multiplications of the normal sequence""; ""Exercises"" 327 $a""1.7 Solution of multiplicative alphabets""""Exercises""; ""1.8 Affine ciphers""; ""Exercises""; ""2 General Monoalphabetic Substitution""; ""2.1 Mixed alphabets""; ""Exercises""; ""2.2 Solution of mixed alphabet ciphers""; ""Exercises""; ""2.3 Solution of monoalphabets in five letter groupings""; ""Exercises""; ""2.4 Monoalphabets with symbols as cipher equivalents""; ""Exercises""; ""3 Polyalphabetic Substitution""; ""3.1 Polyalphabetic ciphers""; ""Exercises""; ""3.2 Recognition of polyalphabetic ciphers""; ""Exercises""; ""3.3 Determination of number of alphabets""; ""Exercises"" 327 $a""3.4 Solution of individual alphabets, if additive""""Exercises""; ""3.5 Polyalphabetic ciphers with a mixed plain sequence""; ""3.6 Matching alphabets""; ""Exercises""; ""3.7 Reduction of a polyalphabetic cipher to a monoalphabet""; ""3.8 Polyalphabetic ciphers with mixed cipher sequences""; ""3.9 General comments about polyalphabetic ciphers""; ""Exercises""; ""4 Polygraphic Systems""; ""4.1 Digraphic ciphers based on linear transformationsa???matrices""; ""Exercises""; ""4.2 Multiplication of matricesa???inverses""; ""Exercises""; ""4.3 Involutory transformations""; ""Exercises"" 327 $a""4.4 Recognition of digraphic ciphers""""4.5 Solution of a linear transformation""; ""Exercises""; ""4.6 How to make the Hill System more secure""; ""5 Transposition""; ""5.1 Columnar transposition""; ""Exercises""; ""5.2 Solution of transpositions with completely filled rectangles""; ""Exercises""; ""5.3 Incompletely filled rectangles""; ""Exercises""; ""5.4 Solution of incompletely filled rectanglesa???probable word method""; ""Exercises""; ""5.5 Incompletely filled rectanglesa???general case""; ""Exercises""; ""5.6 Repetitions between messages; identical length messages""; ""Exercises"" 327 $a""6 RSA Encryption""""6.1 Public-key encryption""; ""6.2 The RSA method""; ""6.3 Creating the RSA keys""; ""Exercises""; ""6.4 Why RSA worksa???Fermata???s Little Theorem""; ""Exercises""; ""6.5 Computational considerations""; ""Exercises""; ""6.6 Maple and Mathematica for RSA""; ""Exercises""; ""6.7 Breaking RSA and signatures""; ""Exercises""; ""7 Perfect Securitya???One-time Pads""; ""7.1 One-time pads""; ""Exercises""; ""7.2 Pseudo-random number generators""; ""Exercises""; ""Appendix A: Tables""; ""Table of digraphic frequencies""; ""Log Weights"" 327 $a""Frequencies of the letters of the alphabet in a sample of 1000 letters, arranged alphabetically and by frequency."" 330 $aOriginally published in the New Mathematical Library almost half a century ago, this charming book explains how to solve cryptograms based on elementary mathematical principles, starting with the Caesar cipher and building up to progressively more sophisticated substitution methods. Todd Feil has updated the book for the technological age by adding two new chapters covering RSA public-key cryptography, one-time pads, and pseudo-random-number generators. Exercises are given throughout the text that will help the reader understand the concepts and practice the techniques presented. Software to ease the drudgery of making the necessary calculations is made available. The book assumes minimal mathematical prerequisites and therefore explains from scratch such concepts as summation notation, matrix multiplication, and modular arithmetic. Even the mathematically sophisticated reader, however, will find some of the exercises challenging. (Answers to the exercises appear in an appendix.) 410 0$aAnneli Lax New Mathematical Library 606 $aCryptography$xMathematics 606 $aCiphers$xMathematics 608 $aElectronic books. 615 0$aCryptography$xMathematics. 615 0$aCiphers$xMathematics. 676 $a652.80151 700 $aSinkov$b Abraham$f1907-$0770286 701 $aFeil$b Todd$f1951-$054112 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910461902303321 996 $aElementary cryptanalysis$92263462 997 $aUNINA LEADER 00896nam0-2200289 --450 001 9910573198103321 005 20220620100518.0 010 $a978-88-6242-448-6 100 $a20220620d2020----kmuy0itay5050 ba 101 0 $aita 102 $aIT 105 $aa a 001yy 200 1 $a<>progetto del mondo$eDoxiadis, cittą e futuro, 1955-65$fFilippo De Dominicis 210 $aSiracusa$cLetteraVentidue$aVenezia$cIUAV$d2020 215 $a206 p.$cill.$d21 cm 225 1 $aSaggi IUAV$v6 610 0 $aDoxiades, Konstantinos Apostolou, 1913-1975$aEcumenopoli 610 0 $aArchitettura visionaria 676 $a711.4092$v23 700 1$aDe Dominicis,$bFilippo$f<1982- >$01238595 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910573198103321 952 $aMON B 1821$b378/2022$fFARBC 959 $aFARBC 996 $aProgetto del mondo$92874449 997 $aUNINA