|
|
|
|
| LEADER |
00000cam a2200000Mi 4500 |
| 001 |
EBOOKCENTRAL_ocn775428918 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr ||||||||||| |
| 008 |
111024s2012 enk o 001 0 eng d |
| 040 |
|
|
|a COO
|b eng
|e pn
|c COO
|d OCLCQ
|d EBLCP
|d DEBSZ
|d OCLCQ
|d ZCU
|d MERUC
|d ICG
|d OCLCO
|d OCLCF
|d OCLCQ
|d INT
|d OCLCO
|d OCLCQ
|d DKC
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 019 |
|
|
|a 923220115
|a 929120246
|
| 020 |
|
|
|a 9780883859377
|q (ebook)
|
| 020 |
|
|
|a 0883859378
|q (ebook)
|
| 029 |
1 |
|
|a DEBBG
|b BV043624325
|
| 029 |
1 |
|
|a DEBBG
|b BV044103546
|
| 029 |
1 |
|
|a DEBSZ
|b 449725693
|
| 029 |
1 |
|
|a AU@
|b 000066753953
|
| 035 |
|
|
|a (OCoLC)775428918
|z (OCoLC)923220115
|z (OCoLC)929120246
|
| 050 |
|
4 |
|a QA76.9.A25 ǂb S56 2009eb
|
| 082 |
0 |
4 |
|a 652.8
|
| 049 |
|
|
|a UAMI
|
| 245 |
0 |
0 |
|a Elementary Cryptanalysis :
|b a Mathematical Approach /
|c Abraham Sinkov, Revised by Todd Feil.
|
| 260 |
|
|
|a Cambridge :
|b Cambridge University Press,
|c 2012.
|
| 300 |
|
|
|a 1 online resource
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Anneli Lax New Mathematical Library ;
|v v. 22
|
| 500 |
|
|
|a Title from publishers bibliographic system (viewed on 30 Jan 2012).
|
| 505 |
0 |
|
|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
|
| 505 |
8 |
|
|a 1.7 Solution of multiplicative alphabetsExercises -- 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
|
| 505 |
8 |
|
|a 3.4 Solution of individual alphabets, if additiveExercises -- 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 transformations�matrices -- Exercises -- 4.2 Multiplication of matrices�inverses -- Exercises -- 4.3 Involutory transformations -- Exercises
|
| 505 |
8 |
|
|a 4.4 Recognition of digraphic ciphers4.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 rectangles�probable word method -- Exercises -- 5.5 Incompletely filled rectangles�general case -- Exercises -- 5.6 Repetitions between messages; identical length messages -- Exercises
|
| 505 |
8 |
|
|a 6 RSA Encryption6.1 Public-key encryption -- 6.2 The RSA method -- 6.3 Creating the RSA keys -- Exercises -- 6.4 Why RSA works�Fermat�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 Security�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
|
| 590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
| 650 |
|
0 |
|a Cryptography
|x Mathematics.
|
| 650 |
|
0 |
|a Ciphers
|x Mathematics.
|
| 650 |
|
6 |
|a Cryptographie
|x Mathématiques.
|
| 650 |
|
6 |
|a Chiffres (Cryptographie)
|x Mathématiques.
|
| 650 |
|
7 |
|a Cryptography
|x Mathematics
|2 fast
|
| 700 |
1 |
|
|a Sinkov, Abraham.
|
| 700 |
1 |
|
|a Feil, Todd.
|
| 758 |
|
|
|i has work:
|a Elementary cryptanalysis (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCH7JCJVrXvDBGv6b8cWhVy
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Sinkov, Abraham.
|t Elementary Cryptanalysis.
|d Washington : Mathematical Association of America, ©2014
|z 9780883856475
|
| 830 |
|
0 |
|a Anneli Lax new mathematical library.
|
| 856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3330402
|z Texto completo
|
| 938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL3330402
|
| 994 |
|
|
|a 92
|b IZTAP
|
