Entry Ritter:1991:EGC 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:EGC,
  author =       "Terry Ritter",
  title =        "The Efficient Generation of Cryptographic Confusion
                 Sequences",
  journal =      j-CRYPTOLOGIA,
  volume =       "15",
  number =       "2",
  pages =        "81--139",
  month =        apr,
  year =         "1991",
  CODEN =        "CRYPE6",
  DOI =          "http://dx.doi.org/10.1080/0161-119191865812",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  MRclass =      "94A60 (65C10)",
  MRnumber =     "92b:94035",
  bibdate =      "Mon Jun 30 15:38:59 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 OCLC Article1st database",
  note =         "cryptographic confusion sequences; pseudo-random
                 sequence; random number generators; cryptographic
                 applications; random sequences; incompleteness theorem;
                 deterministic implementation; external analysis; RNG
                 comparison; chaos; Cebysev mixing; cellular automata;
                 linear congruential; linear feedback shift register;
                 nonlinear shift register; generalized feedback shift
                 register; additive types; isolator mechanisms; one-way
                 functions; combined sequences; random permutations;
                 primitive mod 2 polynomials; empirical state-trajectory
                 approach; RNG design analysis; GFSR",
  URL =          "http://fizz.sys.uea.ac.uk/~rs/ritter.html;
                 http://www.ciphersbyritter.com/ARTS/CRNG2ART.HTM;
                 http://www.informaworld.com/smpp/content~content=a741902748~db=all~order=page",
  abstract =     "A survey is given of pseudo-random sequence or random
                 number generators (RNGs) for cryptographic
                 applications, with extensive reference to the
                 literature, and seemingly unresolved issues discussed
                 throughout. An introduction to random sequences is
                 presented, with some speculative consequences suggested
                 by G{\"o}del's incompleteness theorem (G. Chaitin,
                 1987). Implications of a necessarily deterministic
                 implementation, techniques of external analysis, and
                 ways to complicate such analysis are discussed. A basis
                 for RNG comparison is suggested. Various RNGs are
                 described, including chaos, Cebysev mixing, cellular
                 automata, x/sup 2/ mod N, linear congruential, linear
                 feedback shift register, nonlinear shift register,
                 generalized feedback shift register and additive types.
                 Randomizer and isolator mechanisms, one-way functions,
                 the combined sequences from multiple RNGs, random
                 permutations, and methods for finding primitive mod 2
                 polynomials are also described. An empirical
                 state-trajectory approach to RNG design analysis is
                 given, and experimental results tabulated for several
                 cellular automata, x/sup 2/ mod N, GFSR, and additive
                 designs",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  keywords =     "automata theory; cryptography; random number
                 generation; shift registers",
  language =     "English",
  romanvolume =  "XV",
}

Related entries