MARC Record from marc_nuls

LEADER: 06526pam 22003614a 4500
001 9920118760001661
005 20150423124516.0
008 011102s2002 gw a b 001 0 eng
010 $a 2001055102
015 $aGBA2-41035
016 7 $a962816086$2GyFmDB
020 $a3540426744 (alk. paper)
029 1 $aUKM$bbA241035
035 $a(CSdNU)u106003-01national_inst
035 $a(OCoLC)48390885
035 $a(Sirsi) 01-AAO-7261
040 $aDLC$cDLC$dC#P$dOHX$dUKM$dOrPss
042 $apcc
049 $aCNUM
050 00 $aQA76.9.A25$bB38513 2002
100 1 $aBauer, Friedrich Ludwig,$d1924-
245 10 $aDecrypted secrets :$bmethds and maxims of cryptology /$cFriedrich L. Bauer.
250 $a3rd, rev. and updated ed.
260 $aBerlin ;$aNew York :$bSpringer,$cc2002.
300 $axii, 473 p. :$bill. (some col) ;$c24 cm.
504 $aIncludes bibliographical references (p. [449]-452) and index.
505 0 $aCryptography and Steganography -- Semagrams -- Open Code: Masking -- Cues -- Open Code: Veiling by Nulls -- Open Code: Veiling by Grilles -- Classification of Cryptographic Methods -- Aims and Methods of Cryptography -- The Nature of Cryptography -- Encryption -- Cryptosystems -- Polyphony -- Character Sets -- Keys -- Encryption Steps: Simple Substitution -- Case V[superscript (1)] [right arrow] W (Unipartite Simple Substitutions) -- Special Case V [left and right arrow] V (Permutations) -- Case V[superscript (1)] [right arrow] W[superscript m] (Multipartite Simple Substitutions) -- The General Case V[superscript (1)] [right arrow] W[superscript (m)], Straddling -- Encryption Steps: Polygraphic Substitution and Coding -- Case V[superscript 2] [right arrow] W[superscript (m)] (Digraphic Substitutions) -- Special Cases of Playfair and Delastelle: Tomographic Methods -- Case V[superscript 3] [right arrow] W[superscript (m)] (Trigraphic Substitutions) -- The General Case V[superscript (n)] [right arrow] W[superscript (m)]: Codes -- Encryption Steps: Linear Substitution -- Self-reciprocal Linear Substitutions -- Homogeneous Linear Substitutions -- Binary Linear Substitutions -- General Linear Substitutions -- Decomposed Linear Substitutions -- Decimated Alphabets -- Linear Substitutions with Decimal and Binary Numbers -- Encryption Steps: Transposition -- Simplest Methods -- Columnar Transpositions -- Anagrams -- Polyalphabetic Encryption: Families of Alphabets -- Iterated Substitutions -- Shifted and Rotated Alphabets -- Rotor Crypto Machines -- Shifted Standard Alphabets: Vigenere and Beaufort -- Unrelated Alphabets -- Polyalphabetic Encryption: Keys -- Early Methods with Periodic Keys -- 'Double Key' -- Vernam Encryption -- Quasi-nonperiodic Keys -- Machines that Generate Their Own Key Sequences -- Off-Line Forming of Key Sequences -- Nonperiodic Keys -- Individual, One-Time Keys -- Key Negotiation and Key Management -- Composition of Classes of Methods -- Group Property -- Superencryption -- Similarity of Encryption Methods -- Shannon's 'Pastry Dough Mixing' -- Confusion and Diffusion by Arithmetical Operations -- DES and IDEA -- Open Encryption Key Systems -- Symmetric and Asymmetric Encryption Methods -- One-Way Functions -- RSA Method -- Cryptanalytic Attack upon RSA -- Secrecy Versus Authentication -- Security of Public Key Systems -- Encryption Security -- Cryptographic Faults -- Maxims of Cryptology -- Shannon's Yardsticks -- Cryptology and Human Rights -- Cryptanalysis -- Exhausting Combinatorial Complexity -- Monoalphabetic Simple Encryptions -- Monoalphabetic Polygraphic Encryptions -- Polyalphabetic Encryptions -- General Remarks on Combinatorial Complexity -- Cryptanalysis by Exhaustion -- Unicity Distance -- Practical Execution of Exhaustion -- Mechanizing the Exhaustion -- Anatomy of Language: Patterns -- Invariance of Repetition Patterns -- Exclusion of Encryption Methods -- Pattern Finding -- Finding of Polygraphic Patterns -- The Method of the Probable Word -- Automatic Exhaustion of the Instantiations of a Pattern -- Pangrams -- Polyalphabetic Case: Probable Words -- Non-Coincidence Exhaustion of Probable Word Position -- Binary Non-Coincidence Exhaustion of Probable Word Position -- The De Viaris Attack -- Zig-Zag Exhaustion of Probable Word Position -- The Method of Isomorphs -- Covert Plaintext-Cryptotext Compromise -- Anatomy of Language: Frequencies -- Exclusion of Encryption Methods -- Invariance of Partitions -- Intuitive Method: Frequency Profile -- Frequency Ordering -- Cliques and Matching of Partitions -- Optimal Matching -- Frequency of Multigrams -- The Combined Method of Frequency Matching -- Frequency Matching for Polygraphic Substitutions -- Free-Style Methods -- Unicity Distance Revisited -- Kappa and Chi -- Definition and Invariance of Kappa -- Definition and Invariance of Chi -- The Kappa-Chi Theorem -- The Kappa-Phi Theorem -- Symmetric Functions of Character Frequencies -- Periodicity Examination -- The Kappa Test of Friedman -- Kappa Test for Multigrams -- Cryptanalysis by Machines -- Kasiski Examination -- Building a Depth and Phi Test of Kullback -- Estimating the Period Length -- Alignment of Accompanying Alphabets -- Matching the Profile -- Aligning Against Known Alphabet -- Chi Test: Mutual Alignment of Accompanying Alphabets -- Reconstruction of the Primary Alphabet -- Kerckhoffs' Symmetry of Position -- Stripping off Superencryption: Difference Method -- Decryption of Code -- Reconstruction of the Password -- Compromises -- Kerckhoffs' Superimposition -- Superimposition for Encryptions with a Key Group -- In-Phase Superimposition of Superencrypted Code -- Cryptotext-Cryptotext Compromises -- A Method of Sinkov -- Cryptotext-Cryptotext Compromise: Indicator Doubling -- Plaintext-Cryptotext Compromise: Feedback Cycle -- Linear Basis Analysis -- Reduction of Linear Polygraphic Substitutions -- Reconstruction of the Key -- Reconstruction of a Linear Shift Register -- Anagramming -- Transposition -- Double Columnar Transposition -- Multiple Anagramming -- Success in Breaking -- Mode of Operation of the Unauthorized Decryptor -- Illusory Security -- Importance of Cryptology -- Axiomatic Information Theory.
650 0 $aComputer security.
650 0 $aCryptography.
938 $aOtto Harrassowitz$bHARR$nhar010084887$c42.75 DEM
948 $a08/01/2002$b09/16/2002
982 $aQA76.9.A25$aB38513$a2002
999 $aQA 76.9 .A25 B38513 2002$wLC$c1$i31786101712179$d1/5/2006$e12/3/2005 $f6/15/2004$g1$lCIRCSTACKS$mNULS$n2$rY$sY$tBOOK$u9/16/2002