Entry King:1994:ACA from cryptologia.bib

Last update: Mon Nov 28 02:31:08 MST 2011                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{King:1994:ACA,
  author =       "John C. King",
  title =        "An Algorithm for the Complete Automated Cryptanalysis
                 of Periodic Polyalphabetic Substitution Ciphers",
  journal =      j-CRYPTOLOGIA,
  volume =       "18",
  number =       "4",
  pages =        "332--355",
  month =        oct,
  year =         "1994",
  CODEN =        "CRYPE6",
  DOI =          "http://dx.doi.org/10.1080/0161-119491882928",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:39:08 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 OCLC Article1st database",
  note =         "automated cryptanalysis; periodic polyalphabetic
                 substitution ciphers; cryptanalytic algorithm;
                 monoalphabetic ciphers; probabilistic alphabets;
                 probabilistic relaxation; primary alphabet;
                 polyalphabetic ciphers; word divisions; ciphertext-only
                 attack; Vigen{\'e}re ciphers; Variant Beaufort ciphers;
                 Beaufort ciphers",
  URL =          "http://www.informaworld.com/smpp/content~content=a748639271~db=all~order=page",
  abstract =     "FIND-PRIMARY-ALPHABET is a new cryptanalytic algorithm
                 which solves monoalphabetic and periodic polyalphabetic
                 substitution ciphers with 100\% accuracy. The algorithm
                 uses probabilistic alphabets, the one-to-many mappings
                 obtained by probabilistic relaxation, to determine the
                 one-to-one mappings of the primary alphabet. First an
                 algorithm for computing the period based on IC
                 calculations is presented. Probabilistic relaxation is
                 then extended to solve polyalphabetic ciphers without
                 word divisions and of unknown key periods in a
                 ciphertext-only attack. FIND-PRIMARY-ALPHABET is then
                 demonstrated by solving Vigen{\'e}re ciphers encrypted
                 with both standard and mixed primary alphabets,
                 Beaufort, and Variant Beaufort ciphers",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  keywords =     "codes; cryptography",
  language =     "English",
  romanvolume =  "XVIII",
  ZMnumber =     "950.08965",
}

Related entries