Entry Avoine:2008:CIT from tissec.bib

Last update: Sun Oct 15 02:58:48 MDT 2017                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{Avoine:2008:CIT,
  author =       "Gildas Avoine and Pascal Junod and Philippe
                 Oechslin",
  title =        "Characterization and Improvement of Time-Memory
                 Trade-Off Based on Perfect Tables",
  journal =      j-TISSEC,
  volume =       "11",
  number =       "4",
  pages =        "17:1--17:??",
  month =        jul,
  year =         "2008",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1380564.1380565",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Tue Aug 5 19:37:22 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "Cryptanalytic time-memory trade-offs have been studied
                 for 25 years and have benefited from several
                 improvements since the original work of Hellman. The
                 ensuing variants definitely improve the original
                 trade-off but their real impact has never been
                 evaluated in practice. We fill this lack by analyzing
                 the {\em perfect\/} form of classic tables,
                 distinguished point-based tables, and rainbow tables.
                 We especially provide a thorough analysis of the latter
                 variant, whose performances have never been formally
                 calculated yet. Our analysis leads to the concept of a
                 {\em characteristic\/} that enables to measure the
                 intrinsic quality of a trade-off. We finally introduce
                 a new technique based on {\em checkpoints\/} that still
                 reduces the cryptanalysis time by ruling out false
                 alarms probabilistically. Our analysis yields the exact
                 gain of this approach and establishes its efficiency
                 when applied on rainbow tables.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "cryptography; Hellman's time-memory trade-off;
                 password cracking; rainbow tables",
}

Related entries