Entry Ritter:1991:TCP 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{Ritter:1991:TCP,
  author =       "Terry Ritter",
  title =        "Transposition Cipher with Pseudo-random Shuffling: The
                 Dynamic Transposition Combiner",
  journal =      j-CRYPTOLOGIA,
  volume =       "15",
  number =       "1",
  pages =        "1--17",
  month =        jan,
  year =         "1991",
  CODEN =        "CRYPE6",
  DOI =          "http://dx.doi.org/10.1080/0161-119191865731",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:58 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 OCLC Article1st database",
  note =         "pseudorandom shuffling; dynamic transposition
                 combiner; transposition cipher; cryptographic
                 shuffling; bit-balancing data; usage-frequency
                 statistics; exclusive-OR combining function; Vernam
                 stream ciphers",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902738~db=all~order=page;
                 http://www.io.com/~ritter/ARTS/DYNTRAN2.HTM",
  abstract =     "Extensions are made to a class of transposition cipher
                 based on continued shuffling. These ciphers permute
                 plaintext into ciphertext by swapping every message
                 element with some message element selected at
                 pseudo-random; elements can be characters (e.g., bytes)
                 or bits. Extensions include operation on very large
                 data blocks, cryptographic shuffling variations, and
                 the efficient extraction of plaintext from ciphertext.
                 In addition, selected extra data can be adjoined to the
                 plaintext to eliminate the data-dependent weak
                 encipherings otherwise inherent in transposition. This
                 bit-balancing data is supposed to completely eliminate
                 all normal usage-frequency statistics from
                 bit-transposition ciphertext. The same mechanism can
                 also be viewed as a cryptographic combiner, and, with
                 sequence-to-block and block-to-sequence conversions,
                 can generally replace the exclusive-OR combining
                 function used in Vernam stream ciphers",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  keywords =     "cryptography",
  language =     "English",
  romanvolume =  "XV",
}

Related entries