Improved Rebound Attack on the Finalist Grøstl View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2012

AUTHORS

Jérémy Jean , María Naya-Plasencia , Thomas Peyrin

ABSTRACT

Grøstl is one of the five finalist hash functions of the SHA-3 competition. For entering this final phase, the designers have tweaked the submitted versions. This tweak renders inapplicable the best known distinguishers on the compression function presented by Peyrin [18] that exploited the internal permutation properties. Since the beginning of the final round, very few analysis have been published on Grøstl. Currently, the best known rebound-based results on the permutation and the compression function for the 256-bit version work up to 8 rounds, and up to 7 rounds for the 512-bit version. In this paper, we present new rebound distinguishers that work on a higher number of rounds for the permutations of both 256 and 512-bit versions of this finalist, that is 9 and 10 respectively. Our distinguishers make use of an algorithm that we propose for solving three fully active states in the middle of the differential characteristic, while the Super-Sbox technique only handles two. More... »

PAGES

110-126

Book

TITLE

Fast Software Encryption

ISBN

978-3-642-34046-8
978-3-642-34047-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-34047-5_7

DOI

http://dx.doi.org/10.1007/978-3-642-34047-5_7

DIMENSIONS

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


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/11", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Medical and Health Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Clinical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "\u00c9cole Normale Sup\u00e9rieure, France", 
          "id": "http://www.grid.ac/institutes/grid.5607.4", 
          "name": [
            "\u00c9cole Normale Sup\u00e9rieure, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jean", 
        "givenName": "J\u00e9r\u00e9my", 
        "id": "sg:person.014232271321.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014232271321.52"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Versailles, France", 
          "id": "http://www.grid.ac/institutes/grid.12832.3a", 
          "name": [
            "University of Versailles, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Naya-Plasencia", 
        "givenName": "Mar\u00eda", 
        "id": "sg:person.013206304341.94", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Nanyang Technological University, Singapore", 
          "id": "http://www.grid.ac/institutes/grid.59025.3b", 
          "name": [
            "Nanyang Technological University, Singapore"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Peyrin", 
        "givenName": "Thomas", 
        "id": "sg:person.011167161615.31", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011167161615.31"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "Gr\u00f8stl is one of the five finalist hash functions of the SHA-3 competition. For entering this final phase, the designers have tweaked the submitted versions. This tweak renders inapplicable the best known distinguishers on the compression function presented by Peyrin [18] that exploited the internal permutation properties. Since the beginning of the final round, very few analysis have been published on Gr\u00f8stl. Currently, the best known rebound-based results on the permutation and the compression function for the 256-bit version work up to 8 rounds, and up to 7 rounds for the 512-bit version. In this paper, we present new rebound distinguishers that work on a higher number of rounds for the permutations of both 256 and 512-bit versions of this finalist, that is 9 and 10 respectively. Our distinguishers make use of an algorithm that we propose for solving three fully active states in the middle of the differential characteristic, while the Super-Sbox technique only handles two.", 
    "editor": [
      {
        "familyName": "Canteaut", 
        "givenName": "Anne", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-34047-5_7", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-34046-8", 
        "978-3-642-34047-5"
      ], 
      "name": "Fast Software Encryption", 
      "type": "Book"
    }, 
    "keywords": [
      "final round", 
      "higher number", 
      "function", 
      "rounds", 
      "active state", 
      "differential characteristics", 
      "final phase", 
      "version", 
      "beginning", 
      "analysis", 
      "results", 
      "number", 
      "use", 
      "characteristics", 
      "rebound attack", 
      "phase", 
      "renders", 
      "state", 
      "middle", 
      "technique", 
      "attacks", 
      "Gr\u00f8stl", 
      "SHA-3 competition", 
      "compression function", 
      "properties", 
      "work", 
      "finalists", 
      "competition", 
      "permutations", 
      "paper", 
      "algorithm", 
      "hash function", 
      "designers", 
      "distinguisher", 
      "Peyrin", 
      "permutation properties"
    ], 
    "name": "Improved Rebound Attack on the Finalist Gr\u00f8stl", 
    "pagination": "110-126", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1038127469"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-34047-5_7"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-34047-5_7", 
      "https://app.dimensions.ai/details/publication/pub.1038127469"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-10-01T06:55", 
    "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_278.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-34047-5_7"
  }
]
 

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-34047-5_7'

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-34047-5_7'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-34047-5_7'

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-34047-5_7'


 

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

115 TRIPLES      22 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-34047-5_7 schema:about anzsrc-for:11
2 anzsrc-for:1103
3 schema:author N4f5548d45e334a4597067e597ecfb61a
4 schema:datePublished 2012
5 schema:datePublishedReg 2012-01-01
6 schema:description Grøstl is one of the five finalist hash functions of the SHA-3 competition. For entering this final phase, the designers have tweaked the submitted versions. This tweak renders inapplicable the best known distinguishers on the compression function presented by Peyrin [18] that exploited the internal permutation properties. Since the beginning of the final round, very few analysis have been published on Grøstl. Currently, the best known rebound-based results on the permutation and the compression function for the 256-bit version work up to 8 rounds, and up to 7 rounds for the 512-bit version. In this paper, we present new rebound distinguishers that work on a higher number of rounds for the permutations of both 256 and 512-bit versions of this finalist, that is 9 and 10 respectively. Our distinguishers make use of an algorithm that we propose for solving three fully active states in the middle of the differential characteristic, while the Super-Sbox technique only handles two.
7 schema:editor Nc8dab8567bde465ba8fe6b444830fdcb
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nec855c5c7ba94d82bcf4df0072ca4701
11 schema:keywords Grøstl
12 Peyrin
13 SHA-3 competition
14 active state
15 algorithm
16 analysis
17 attacks
18 beginning
19 characteristics
20 competition
21 compression function
22 designers
23 differential characteristics
24 distinguisher
25 final phase
26 final round
27 finalists
28 function
29 hash function
30 higher number
31 middle
32 number
33 paper
34 permutation properties
35 permutations
36 phase
37 properties
38 rebound attack
39 renders
40 results
41 rounds
42 state
43 technique
44 use
45 version
46 work
47 schema:name Improved Rebound Attack on the Finalist Grøstl
48 schema:pagination 110-126
49 schema:productId N153b4fe873144d9b969225ada3f12136
50 Nd7b3d0749c5d4ba284a2b7883d8b49df
51 schema:publisher N29f0d6a0f4e74df298b53299177708fd
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038127469
53 https://doi.org/10.1007/978-3-642-34047-5_7
54 schema:sdDatePublished 2022-10-01T06:55
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher N92103636b960444f93ce2f03bc3b08c9
57 schema:url https://doi.org/10.1007/978-3-642-34047-5_7
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N153b4fe873144d9b969225ada3f12136 schema:name doi
62 schema:value 10.1007/978-3-642-34047-5_7
63 rdf:type schema:PropertyValue
64 N29f0d6a0f4e74df298b53299177708fd schema:name Springer Nature
65 rdf:type schema:Organisation
66 N3166ed0fcc5045e281840c16956322c1 schema:familyName Canteaut
67 schema:givenName Anne
68 rdf:type schema:Person
69 N4f5548d45e334a4597067e597ecfb61a rdf:first sg:person.014232271321.52
70 rdf:rest N954268e5e6d64194bccacb00fb3ba1b0
71 N92103636b960444f93ce2f03bc3b08c9 schema:name Springer Nature - SN SciGraph project
72 rdf:type schema:Organization
73 N954268e5e6d64194bccacb00fb3ba1b0 rdf:first sg:person.013206304341.94
74 rdf:rest Na83189bc40eb41dabfabb062e367e1b1
75 Na83189bc40eb41dabfabb062e367e1b1 rdf:first sg:person.011167161615.31
76 rdf:rest rdf:nil
77 Nc8dab8567bde465ba8fe6b444830fdcb rdf:first N3166ed0fcc5045e281840c16956322c1
78 rdf:rest rdf:nil
79 Nd7b3d0749c5d4ba284a2b7883d8b49df schema:name dimensions_id
80 schema:value pub.1038127469
81 rdf:type schema:PropertyValue
82 Nec855c5c7ba94d82bcf4df0072ca4701 schema:isbn 978-3-642-34046-8
83 978-3-642-34047-5
84 schema:name Fast Software Encryption
85 rdf:type schema:Book
86 anzsrc-for:11 schema:inDefinedTermSet anzsrc-for:
87 schema:name Medical and Health Sciences
88 rdf:type schema:DefinedTerm
89 anzsrc-for:1103 schema:inDefinedTermSet anzsrc-for:
90 schema:name Clinical Sciences
91 rdf:type schema:DefinedTerm
92 sg:person.011167161615.31 schema:affiliation grid-institutes:grid.59025.3b
93 schema:familyName Peyrin
94 schema:givenName Thomas
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011167161615.31
96 rdf:type schema:Person
97 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.12832.3a
98 schema:familyName Naya-Plasencia
99 schema:givenName María
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
101 rdf:type schema:Person
102 sg:person.014232271321.52 schema:affiliation grid-institutes:grid.5607.4
103 schema:familyName Jean
104 schema:givenName Jérémy
105 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014232271321.52
106 rdf:type schema:Person
107 grid-institutes:grid.12832.3a schema:alternateName University of Versailles, France
108 schema:name University of Versailles, France
109 rdf:type schema:Organization
110 grid-institutes:grid.5607.4 schema:alternateName École Normale Supérieure, France
111 schema:name École Normale Supérieure, France
112 rdf:type schema:Organization
113 grid-institutes:grid.59025.3b schema:alternateName Nanyang Technological University, Singapore
114 schema:name Nanyang Technological University, Singapore
115 rdf:type schema:Organization
 




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


...