Entry OConnor:1993:IEP 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{OConnor:1993:IEP,
  author =       "Luke O'Connor",
  title =        "The Inclusion--Exclusion Principle and its
                 Applications to Cryptography",
  journal =      j-CRYPTOLOGIA,
  volume =       "17",
  number =       "1",
  pages =        "63--79",
  month =        jan,
  year =         "1993",
  CODEN =        "CRYPE6",
  DOI =          "http://dx.doi.org/10.1080/0161-119391867773",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  MRclass =      "94A60 (05A15)",
  MRnumber =     "93i:94013",
  bibdate =      "Mon Jun 30 15:39:04 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 OCLC Article1st database",
  note =         "inclusion-exclusion principle; combinatorial method;
                 cardinality; cryptography; Boolean functions;
                 permutations; cryptographic mapping; nonlinearity;
                 nondegeneracy; confusion; diffusion",
  URL =          "http://www.informaworld.com/smpp/content~content=a748639215~db=all~order=page;
                 http://www.zurich.ibm.com/~oco/pub/iep.html;
                 http://www.zurich.ibm.com/~oco/pub/iep.ps.Z",
  abstract =     "The inclusion-exclusion principle is a combinatorial
                 method for determining the cardinality of a set where
                 each element X in U satisfies a list of properties
                 u/sub 1/, u/sub 2/,. . .,u/sub n/. The author displays
                 the usefulness of the inclusion-exclusion principle by
                 solving eight problems of interest to cryptography.
                 These problems concentrate on the enumeration of
                 Boolean functions and permutations that have properties
                 which are considered to be necessary for a
                 cryptographic mapping to be secure. In particular the
                 author is concerned with the properties of nonlinearity
                 and nondegeneracy as these properties correspond to
                 Shannon's notions of confusion and diffusion,
                 respectively",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  keywords =     "Boolean functions; cryptography",
  language =     "English",
  romanvolume =  "XVII",
}

Related entries