Rebound Attack on the Full Lane Compression Function View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2009

AUTHORS

Krystian Matusiewicz , María Naya-Plasencia , Ivica Nikolić , Yu Sasaki , Martin Schläffer

ABSTRACT

In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 296 compression function evaluations and 288 memory, and for full Lane-512 with 2224 compression function evaluations and 2128 memory. More... »

PAGES

106-125

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-10366-7_7

DOI

http://dx.doi.org/10.1007/978-3-642-10366-7_7

DIMENSIONS

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


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": "Department of Mathematics, Technical University of Denmark, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.5170.3", 
          "name": [
            "Department of Mathematics, Technical University of Denmark, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Matusiewicz", 
        "givenName": "Krystian", 
        "id": "sg:person.013523765031.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013523765031.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "INRIA project-team SECRET, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "INRIA project-team SECRET, 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": "University of Luxembourg, Luxembourg", 
          "id": "http://www.grid.ac/institutes/grid.16008.3f", 
          "name": [
            "University of Luxembourg, Luxembourg"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Nikoli\u0107", 
        "givenName": "Ivica", 
        "id": "sg:person.013715004754.76", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013715004754.76"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "NTT Corporation, Japan", 
          "id": "http://www.grid.ac/institutes/grid.419819.c", 
          "name": [
            "NTT Corporation, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sasaki", 
        "givenName": "Yu", 
        "id": "sg:person.014072424160.79", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014072424160.79"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IAIK, Graz University of Technology, Austria", 
          "id": "http://www.grid.ac/institutes/grid.410413.3", 
          "name": [
            "IAIK, Graz University of Technology, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Schl\u00e4ffer", 
        "givenName": "Martin", 
        "id": "sg:person.015166313415.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015166313415.52"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2009", 
    "datePublishedReg": "2009-01-01", 
    "description": "In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 296 compression function evaluations and 288 memory, and for full Lane-512 with 2224 compression function evaluations and 2128 memory.", 
    "editor": [
      {
        "familyName": "Matsui", 
        "givenName": "Mitsuru", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-10366-7_7", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-10365-0", 
        "978-3-642-10366-7"
      ], 
      "name": "Advances in Cryptology \u2013 ASIACRYPT 2009", 
      "type": "Book"
    }, 
    "keywords": [
      "full compression function", 
      "compression function evaluations", 
      "evaluation", 
      "rebound attack", 
      "function", 
      "new technique", 
      "function evaluations", 
      "attacks", 
      "memory", 
      "expansion", 
      "technique", 
      "degree", 
      "phase", 
      "state", 
      "work", 
      "AES", 
      "compression function", 
      "parallel lanes", 
      "freedom", 
      "start collisions", 
      "candidate lanes", 
      "lanes", 
      "message expansion", 
      "inbound phase", 
      "degrees of freedom", 
      "AES state", 
      "permutations", 
      "collisions", 
      "differential path", 
      "path"
    ], 
    "name": "Rebound Attack on the Full Lane Compression Function", 
    "pagination": "106-125", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1030176070"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-10366-7_7"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-10366-7_7", 
      "https://app.dimensions.ai/details/publication/pub.1030176070"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-10-01T06:58", 
    "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_384.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-10366-7_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-10366-7_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-10366-7_7'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-10366-7_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-10366-7_7'


 

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

129 TRIPLES      22 PREDICATES      55 URIs      48 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-10366-7_7 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N7d9c6cab50cb46a0ba0a9a8d2a1da8c0
4 schema:datePublished 2009
5 schema:datePublishedReg 2009-01-01
6 schema:description In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 296 compression function evaluations and 288 memory, and for full Lane-512 with 2224 compression function evaluations and 2128 memory.
7 schema:editor Nbc7c3bbe2a2b404d9515ff6387e70e34
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N767632f0a6154921b2cb472e442a88ad
11 schema:keywords AES
12 AES state
13 attacks
14 candidate lanes
15 collisions
16 compression function
17 compression function evaluations
18 degree
19 degrees of freedom
20 differential path
21 evaluation
22 expansion
23 freedom
24 full compression function
25 function
26 function evaluations
27 inbound phase
28 lanes
29 memory
30 message expansion
31 new technique
32 parallel lanes
33 path
34 permutations
35 phase
36 rebound attack
37 start collisions
38 state
39 technique
40 work
41 schema:name Rebound Attack on the Full Lane Compression Function
42 schema:pagination 106-125
43 schema:productId N2bc1c96ec17744208853d17acdd23aaf
44 Ne7c642524d5f496c87e5467250725c08
45 schema:publisher Nda2177d801ca4d468d97907427f0fc7a
46 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030176070
47 https://doi.org/10.1007/978-3-642-10366-7_7
48 schema:sdDatePublished 2022-10-01T06:58
49 schema:sdLicense https://scigraph.springernature.com/explorer/license/
50 schema:sdPublisher N88b6c91b863048deb31f9ee33c106167
51 schema:url https://doi.org/10.1007/978-3-642-10366-7_7
52 sgo:license sg:explorer/license/
53 sgo:sdDataset chapters
54 rdf:type schema:Chapter
55 N21a14c833ee74dd6a48093e98a02aec4 rdf:first sg:person.014072424160.79
56 rdf:rest N78609a24e8ff494b8205f504fdb6bbdf
57 N2bc1c96ec17744208853d17acdd23aaf schema:name dimensions_id
58 schema:value pub.1030176070
59 rdf:type schema:PropertyValue
60 N4e6162e6da66496ca6d9eb7da13cdcd4 rdf:first sg:person.013206304341.94
61 rdf:rest Na580b5ecf8954069b8e205cd4d2e1e39
62 N55c99b5a34d944f9b464161ad99bfa6b schema:familyName Matsui
63 schema:givenName Mitsuru
64 rdf:type schema:Person
65 N767632f0a6154921b2cb472e442a88ad schema:isbn 978-3-642-10365-0
66 978-3-642-10366-7
67 schema:name Advances in Cryptology – ASIACRYPT 2009
68 rdf:type schema:Book
69 N78609a24e8ff494b8205f504fdb6bbdf rdf:first sg:person.015166313415.52
70 rdf:rest rdf:nil
71 N7d9c6cab50cb46a0ba0a9a8d2a1da8c0 rdf:first sg:person.013523765031.38
72 rdf:rest N4e6162e6da66496ca6d9eb7da13cdcd4
73 N88b6c91b863048deb31f9ee33c106167 schema:name Springer Nature - SN SciGraph project
74 rdf:type schema:Organization
75 Na580b5ecf8954069b8e205cd4d2e1e39 rdf:first sg:person.013715004754.76
76 rdf:rest N21a14c833ee74dd6a48093e98a02aec4
77 Nbc7c3bbe2a2b404d9515ff6387e70e34 rdf:first N55c99b5a34d944f9b464161ad99bfa6b
78 rdf:rest rdf:nil
79 Nda2177d801ca4d468d97907427f0fc7a schema:name Springer Nature
80 rdf:type schema:Organisation
81 Ne7c642524d5f496c87e5467250725c08 schema:name doi
82 schema:value 10.1007/978-3-642-10366-7_7
83 rdf:type schema:PropertyValue
84 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
85 schema:name Information and Computing Sciences
86 rdf:type schema:DefinedTerm
87 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
88 schema:name Data Format
89 rdf:type schema:DefinedTerm
90 sg:person.013206304341.94 schema:affiliation grid-institutes:None
91 schema:familyName Naya-Plasencia
92 schema:givenName María
93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
94 rdf:type schema:Person
95 sg:person.013523765031.38 schema:affiliation grid-institutes:grid.5170.3
96 schema:familyName Matusiewicz
97 schema:givenName Krystian
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013523765031.38
99 rdf:type schema:Person
100 sg:person.013715004754.76 schema:affiliation grid-institutes:grid.16008.3f
101 schema:familyName Nikolić
102 schema:givenName Ivica
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013715004754.76
104 rdf:type schema:Person
105 sg:person.014072424160.79 schema:affiliation grid-institutes:grid.419819.c
106 schema:familyName Sasaki
107 schema:givenName Yu
108 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014072424160.79
109 rdf:type schema:Person
110 sg:person.015166313415.52 schema:affiliation grid-institutes:grid.410413.3
111 schema:familyName Schläffer
112 schema:givenName Martin
113 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015166313415.52
114 rdf:type schema:Person
115 grid-institutes:None schema:alternateName INRIA project-team SECRET, France
116 schema:name INRIA project-team SECRET, France
117 rdf:type schema:Organization
118 grid-institutes:grid.16008.3f schema:alternateName University of Luxembourg, Luxembourg
119 schema:name University of Luxembourg, Luxembourg
120 rdf:type schema:Organization
121 grid-institutes:grid.410413.3 schema:alternateName IAIK, Graz University of Technology, Austria
122 schema:name IAIK, Graz University of Technology, Austria
123 rdf:type schema:Organization
124 grid-institutes:grid.419819.c schema:alternateName NTT Corporation, Japan
125 schema:name NTT Corporation, Japan
126 rdf:type schema:Organization
127 grid-institutes:grid.5170.3 schema:alternateName Department of Mathematics, Technical University of Denmark, Denmark
128 schema:name Department of Mathematics, Technical University of Denmark, Denmark
129 rdf:type schema:Organization
 




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


...