Entry Wang:2005:FCF from lncs2005a.bib

Last update: Fri Mar 15 02:12:13 MDT 2019                Valid HTML 4.0!

Index sections

Top | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | Y | Z

BibTeX entry

@Article{Wang:2005:FCF,
  author =       "Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu",
  title =        "Finding Collisions in the Full {SHA-1}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "3621",
  pages =        "17--??",
  year =         "2005",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11535218_2",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Apr 3 08:32:34 2006",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2005a.bib",
  abstract =     "In this paper, we present new collision search attacks
                 on the hash function SHA-1. We show that collisions of
                 SHA-1 can be found with complexity less than $ 2^{69} $
                 hash operations. This is the first attack on the full
                 80-step SHA-1 with complexity less than the $ 2^{80} $
                 theoretical bound.",
  acknowledgement = ack-nhfb,
  keywords =     "Collision search attacks; Hash functions; SHA-0;
                 SHA-1.",
}

Related entries