LEADER 00864nam0-2200289---450- 001 990009220610403321 005 20100913110731.0 035 $a000922061 035 $aFED01000922061 035 $a(Aleph)000922061FED01 035 $a000922061 100 $a20100913d1980----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $af---ac--001yy 200 1 $a<>chiesa di santa Maria della Pace$fDiodato Colonnesi 210 $a[S. l$cs. n.]$dstampa 1980$eFuorni di Salerno$gArti grafiche Boccia 215 $a46 p., [32] c. di tav.$d21 cm 610 0 $aNapoli$aChiese$aSanta Maria della Pace 700 1$aColonnesi,$bDiodato$036148 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990009220610403321 952 $a30.630$b8518$fDARST 959 $aDARST 996 $aChiesa di santa Maria della Pace$9776826 997 $aUNINA LEADER 03371nam 2200637Ia 450 001 9910954622103321 005 20250728182706.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(RPAM)15717103 035 $a(EXLCZ)992670000000205152 100 $a20090528d2009 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aElementary cryptanalysis $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 (xiv, 212 pages) $cdigital, PDF file(s) 225 1 $aAnneli Lax New Mathematical Library,$x2643-5586 ;$vv. 22 225 0$aAnneli Lax new mathematical library ;$vv. 22 300 $aTitle from publisher's bibliographic system (viewed on 02 Oct 2015). 311 08$a0-88385-647-6 320 $aIncludes bibliographical references (p. 205-206) and index. 327 $a1. Monoalphabetic ciphers using additive alphabets -- 2. General monoalphabetic substitution -- 3. Polyalphabetic substitution -- 4. Polygraphic systems -- 5. Transposition -- 6. RSA encryption -- 7. Perfect security: one-time pads. 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 615 0$aCryptography$xMathematics. 615 0$aCiphers$xMathematics. 676 $a652.80151 700 $aSinkov$b Abraham$f1907-$0770286 701 $aFeil$b Todd$f1951-$054112 712 02$aMathematical Association of America, 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910954622103321 996 $aElementary cryptanalysis$94403593 997 $aUNINA