Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2012

AUTHORS

Elena Andreeva , Bart Mennink , Bart Preneel , Marjan Škrobot

ABSTRACT

In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to the vulnerabilities identified in widely employed hash functions, such as MD5 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathrm{SHA\text{-}1}$\end{document}. NIST received many submissions, 51 of which got accepted to the first round. At present, 5 candidates are left in the third round of the competition. At NIST’s second SHA-3 Candidate Conference 2010, Andreeva et al. provided a provable security classification of the second round SHA-3 candidates in the ideal model. In this work, we revisit this classification for the five SHA-3 finalists. We evaluate recent provable security results on the candidates, and resolve remaining open problems for Grøstl, JH, and Skein. More... »

PAGES

287-305

Book

TITLE

Progress in Cryptology - AFRICACRYPT 2012

ISBN

978-3-642-31409-4
978-3-642-31410-0

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-31410-0_18

DOI

http://dx.doi.org/10.1007/978-3-642-31410-0_18

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1047339054


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Andreeva", 
        "givenName": "Elena", 
        "id": "sg:person.010624232445.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mennink", 
        "givenName": "Bart", 
        "id": "sg:person.012130641461.76", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Preneel", 
        "givenName": "Bart", 
        "id": "sg:person.011115044357.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "\u0160krobot", 
        "givenName": "Marjan", 
        "id": "sg:person.010312765463.12", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010312765463.12"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to the vulnerabilities identified in widely employed hash functions, such as MD5 and \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\mathrm{SHA\\text{-}1}$\\end{document}. NIST received many submissions, 51 of which got accepted to the first round. At present, 5 candidates are left in the third round of the competition. At NIST\u2019s second SHA-3 Candidate Conference 2010, Andreeva et al.\u00a0provided a provable security classification of the second round SHA-3 candidates in the ideal model. In this work, we revisit this classification for the five SHA-3 finalists. We evaluate recent provable security results on the candidates, and resolve remaining open problems for Gr\u00f8stl, JH, and Skein.", 
    "editor": [
      {
        "familyName": "Mitrokotsa", 
        "givenName": "Aikaterini", 
        "type": "Person"
      }, 
      {
        "familyName": "Vaudenay", 
        "givenName": "Serge", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-31410-0_18", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-31409-4", 
        "978-3-642-31410-0"
      ], 
      "name": "Progress in Cryptology - AFRICACRYPT 2012", 
      "type": "Book"
    }, 
    "keywords": [
      "cryptographic hash algorithm", 
      "new cryptographic hash algorithm", 
      "SHA-3 finalists", 
      "provable security results", 
      "SHA-3 finalist BLAKE", 
      "hash algorithm", 
      "security analysis", 
      "hash function", 
      "security classification", 
      "SHA-3 candidates", 
      "Andreeva et al", 
      "security results", 
      "second round SHA-3 candidates", 
      "open problem", 
      "Gr\u00f8stl", 
      "classification", 
      "MD5", 
      "Keccak", 
      "algorithm", 
      "technology", 
      "NIST", 
      "finalists", 
      "US National Institutes", 
      "submission", 
      "vulnerability", 
      "rounds", 
      "design", 
      "calls", 
      "work", 
      "standards", 
      "model", 
      "skein", 
      "et al", 
      "candidates", 
      "first round", 
      "results", 
      "ideal model", 
      "National Institute", 
      "competition", 
      "function", 
      "analysis", 
      "comparison", 
      "Institute", 
      "third round", 
      "Blake", 
      "al", 
      "response", 
      "JH", 
      "problem"
    ], 
    "name": "Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Gr\u00f8stl, JH, Keccak, and Skein", 
    "pagination": "287-305", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047339054"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-31410-0_18"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-31410-0_18", 
      "https://app.dimensions.ai/details/publication/pub.1047339054"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-10-01T06:52", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221001/entities/gbq_results/chapter/chapter_120.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-31410-0_18"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-31410-0_18'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-31410-0_18'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-31410-0_18'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-31410-0_18'


 

This table displays all metadata directly associated to this object as RDF triples.

134 TRIPLES      22 PREDICATES      74 URIs      67 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-31410-0_18 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Na26b32de865348e0a38f2acdac433c48
4 schema:datePublished 2012
5 schema:datePublishedReg 2012-01-01
6 schema:description In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to the vulnerabilities identified in widely employed hash functions, such as MD5 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathrm{SHA\text{-}1}$\end{document}. NIST received many submissions, 51 of which got accepted to the first round. At present, 5 candidates are left in the third round of the competition. At NIST’s second SHA-3 Candidate Conference 2010, Andreeva et al. provided a provable security classification of the second round SHA-3 candidates in the ideal model. In this work, we revisit this classification for the five SHA-3 finalists. We evaluate recent provable security results on the candidates, and resolve remaining open problems for Grøstl, JH, and Skein.
7 schema:editor N1a0387506db74ede966022bcf1f0fe3d
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Ne888ca27d263407ab20c193efe573e0f
11 schema:keywords Andreeva et al
12 Blake
13 Grøstl
14 Institute
15 JH
16 Keccak
17 MD5
18 NIST
19 National Institute
20 SHA-3 candidates
21 SHA-3 finalist BLAKE
22 SHA-3 finalists
23 US National Institutes
24 al
25 algorithm
26 analysis
27 calls
28 candidates
29 classification
30 comparison
31 competition
32 cryptographic hash algorithm
33 design
34 et al
35 finalists
36 first round
37 function
38 hash algorithm
39 hash function
40 ideal model
41 model
42 new cryptographic hash algorithm
43 open problem
44 problem
45 provable security results
46 response
47 results
48 rounds
49 second round SHA-3 candidates
50 security analysis
51 security classification
52 security results
53 skein
54 standards
55 submission
56 technology
57 third round
58 vulnerability
59 work
60 schema:name Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
61 schema:pagination 287-305
62 schema:productId N19219c488fea44708a9f216d49ee66a5
63 Nbf85490a19b844bdb7cdd62b5c98d2e4
64 schema:publisher N1667fcd6ef8646dbbf0a9516e9fdc83d
65 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047339054
66 https://doi.org/10.1007/978-3-642-31410-0_18
67 schema:sdDatePublished 2022-10-01T06:52
68 schema:sdLicense https://scigraph.springernature.com/explorer/license/
69 schema:sdPublisher Ndeaa3cfa4b664a888ce70a087d169404
70 schema:url https://doi.org/10.1007/978-3-642-31410-0_18
71 sgo:license sg:explorer/license/
72 sgo:sdDataset chapters
73 rdf:type schema:Chapter
74 N09551698320b47ce9343f1509b7f0348 rdf:first sg:person.012130641461.76
75 rdf:rest N12f31e1648d241d7a94ddb7331d14dec
76 N12f31e1648d241d7a94ddb7331d14dec rdf:first sg:person.011115044357.39
77 rdf:rest N4b6e5e4b58f04366957262837f3b2663
78 N1667fcd6ef8646dbbf0a9516e9fdc83d schema:name Springer Nature
79 rdf:type schema:Organisation
80 N19219c488fea44708a9f216d49ee66a5 schema:name dimensions_id
81 schema:value pub.1047339054
82 rdf:type schema:PropertyValue
83 N1a0387506db74ede966022bcf1f0fe3d rdf:first Nb468cd9825874a2b91fc1ae360df0646
84 rdf:rest Na2ca6692f8224ed0a507d9cf98428aab
85 N4b6e5e4b58f04366957262837f3b2663 rdf:first sg:person.010312765463.12
86 rdf:rest rdf:nil
87 N783356b1dcf64aa0a511657c8775a5db schema:familyName Vaudenay
88 schema:givenName Serge
89 rdf:type schema:Person
90 Na26b32de865348e0a38f2acdac433c48 rdf:first sg:person.010624232445.91
91 rdf:rest N09551698320b47ce9343f1509b7f0348
92 Na2ca6692f8224ed0a507d9cf98428aab rdf:first N783356b1dcf64aa0a511657c8775a5db
93 rdf:rest rdf:nil
94 Nb468cd9825874a2b91fc1ae360df0646 schema:familyName Mitrokotsa
95 schema:givenName Aikaterini
96 rdf:type schema:Person
97 Nbf85490a19b844bdb7cdd62b5c98d2e4 schema:name doi
98 schema:value 10.1007/978-3-642-31410-0_18
99 rdf:type schema:PropertyValue
100 Ndeaa3cfa4b664a888ce70a087d169404 schema:name Springer Nature - SN SciGraph project
101 rdf:type schema:Organization
102 Ne888ca27d263407ab20c193efe573e0f schema:isbn 978-3-642-31409-4
103 978-3-642-31410-0
104 schema:name Progress in Cryptology - AFRICACRYPT 2012
105 rdf:type schema:Book
106 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
107 schema:name Information and Computing Sciences
108 rdf:type schema:DefinedTerm
109 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
110 schema:name Data Format
111 rdf:type schema:DefinedTerm
112 sg:person.010312765463.12 schema:affiliation grid-institutes:grid.5596.f
113 schema:familyName Škrobot
114 schema:givenName Marjan
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010312765463.12
116 rdf:type schema:Person
117 sg:person.010624232445.91 schema:affiliation grid-institutes:grid.5596.f
118 schema:familyName Andreeva
119 schema:givenName Elena
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91
121 rdf:type schema:Person
122 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.5596.f
123 schema:familyName Preneel
124 schema:givenName Bart
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
126 rdf:type schema:Person
127 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.5596.f
128 schema:familyName Mennink
129 schema:givenName Bart
130 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
131 rdf:type schema:Person
132 grid-institutes:grid.5596.f schema:alternateName Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium
133 schema:name Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium
134 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...