Entry Levine:1993:TMP from cryptologia.bib

Last update: Fri Mar 16 02:02:35 MDT 2012                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{Levine:1993:TMP,
  author =       "Jack Levine and Richard Chandler",
  title =        "The Two-message Problem in the {Hill} Cryptographic
                 System with Unknown Cipher Alphabet",
  journal =      j-CRYPTOLOGIA,
  volume =       "17",
  number =       "1",
  pages =        "1--30",
  month =        jan,
  year =         "1993",
  CODEN =        "CRYPE6",
  DOI =          "http://dx.doi.org/10.1080/0161-119391867737",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  MRclass =      "94A60",
  MRnumber =     "93m:94019",
  bibdate =      "Mon Jun 30 15:39:04 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 OCLC Article1st database",
  note =         "Hill cryptographic system; Hill two-message problem;
                 ciphertexts; encipherment; single plaintext; key
                 matrices; cipher alphabet; row-reduced echelon form;
                 linear equations; unknown elements",
  URL =          "http://www.informaworld.com/smpp/content~content=a748639218~db=all~order=page",
  abstract =     "The Hill two-message problem assumes given two
                 ciphertexts obtained by the encipherment of a single
                 plaintext by two different key matrices K/sub 1/, K/sub
                 2/. The problem is to determine the (unknown) K/sub 1/,
                 K/sub 2/ and the cipher alphabet if unknown. J. Levine
                 and J.V. Brawley (1966; 1967) and N.C. Nance (1972),
                 analyzed this problem for the case in which the cipher
                 alphabet is known. The authors continue with the
                 problem and consider the (more difficult) case in which
                 the cipher alphabet is unknown. The method used depends
                 in part on some results obtained by J. Levine and R.
                 Chandler (1989), which determine the matrix A=K/sub
                 1/K/sub 2/. The basic equation AXA=X is then solved for
                 matrix X by use of the row-reduced echelon form of the
                 system of linear equations in the unknown elements of
                 X, the key matrices being among these solutions",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  keywords =     "cryptography; linear algebra",
  language =     "English",
  romanvolume =  "XVII",
}

Related entries