How to Improve Rebound Attacks View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2011

AUTHORS

María Naya-Plasencia

ABSTRACT

Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions from the SHA-3 competition, providing the best known analysis in these cases. In this paper we study rebound attacks in detail and find for a large number of cases that the complexities of existing attacks can be improved.This is done by identifying problems that optimally adapt to the cryptanalytic situation, and by using better algorithms to find solutions for the differential path. Our improvements affect one particular operation that appears in most rebound attacks and which is often the bottleneck of the attacks. This operation, which varies depending on the attack, can be roughly described as merging large lists. As a result, we introduce new general purpose algorithms for enabling further rebound analysis to be as performant as possible. We illustrate our new algorithms on real hash functions. More... »

PAGES

188-205

Book

TITLE

Advances in Cryptology – CRYPTO 2011

ISBN

978-3-642-22791-2
978-3-642-22792-9

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-22792-9_11

DOI

http://dx.doi.org/10.1007/978-3-642-22792-9_11

DIMENSIONS

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


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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "FHNW, Windisch, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.410380.e", 
          "name": [
            "FHNW, Windisch, Switzerland"
          ], 
          "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"
      }
    ], 
    "datePublished": "2011", 
    "datePublishedReg": "2011-01-01", 
    "description": "Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions from the SHA-3 competition, providing the best known analysis in these cases. In this paper we study rebound attacks in detail and find for a large number of cases that the complexities of existing attacks can be improved.This is done by identifying problems that optimally adapt to the cryptanalytic situation, and by using better algorithms to find solutions for the differential path. Our improvements affect one particular operation that appears in most rebound attacks and which is often the bottleneck of the attacks. This operation, which varies depending on the attack, can be roughly described as merging large lists. As a result, we introduce new general purpose algorithms for enabling further rebound analysis to be as performant as possible. We illustrate our new algorithms on real hash functions.", 
    "editor": [
      {
        "familyName": "Rogaway", 
        "givenName": "Phillip", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-22792-9_11", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-22791-2", 
        "978-3-642-22792-9"
      ], 
      "name": "Advances in Cryptology \u2013 CRYPTO 2011", 
      "type": "Book"
    }, 
    "keywords": [
      "hash function", 
      "new general-purpose algorithm", 
      "general-purpose algorithm", 
      "purpose algorithm", 
      "art analysis methods", 
      "rebound attack", 
      "cryptanalysis methods", 
      "SHA-3 competition", 
      "best algorithm", 
      "new algorithm", 
      "algorithm", 
      "attacks", 
      "differential path", 
      "analysis method", 
      "particular operation", 
      "large list", 
      "large number", 
      "function", 
      "path", 
      "problem", 
      "solution", 
      "bottleneck", 
      "complexity", 
      "operation", 
      "cases", 
      "method", 
      "detail", 
      "number", 
      "state", 
      "analysis", 
      "list", 
      "situation", 
      "results", 
      "improvement", 
      "competition", 
      "paper"
    ], 
    "name": "How to Improve Rebound Attacks", 
    "pagination": "188-205", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1001341652"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-22792-9_11"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-22792-9_11", 
      "https://app.dimensions.ai/details/publication/pub.1001341652"
    ], 
    "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_4.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-22792-9_11"
  }
]
 

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-22792-9_11'

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-22792-9_11'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-22792-9_11'

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-22792-9_11'


 

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

95 TRIPLES      22 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-22792-9_11 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N3584b7414d3442609ccf06527e85a5e8
4 schema:datePublished 2011
5 schema:datePublishedReg 2011-01-01
6 schema:description Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions from the SHA-3 competition, providing the best known analysis in these cases. In this paper we study rebound attacks in detail and find for a large number of cases that the complexities of existing attacks can be improved.This is done by identifying problems that optimally adapt to the cryptanalytic situation, and by using better algorithms to find solutions for the differential path. Our improvements affect one particular operation that appears in most rebound attacks and which is often the bottleneck of the attacks. This operation, which varies depending on the attack, can be roughly described as merging large lists. As a result, we introduce new general purpose algorithms for enabling further rebound analysis to be as performant as possible. We illustrate our new algorithms on real hash functions.
7 schema:editor Nb2c8bb8feb354196a50d3ab4e0756a98
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N725dfd5d452e4f97bd1cdbab3c38c278
11 schema:keywords SHA-3 competition
12 algorithm
13 analysis
14 analysis method
15 art analysis methods
16 attacks
17 best algorithm
18 bottleneck
19 cases
20 competition
21 complexity
22 cryptanalysis methods
23 detail
24 differential path
25 function
26 general-purpose algorithm
27 hash function
28 improvement
29 large list
30 large number
31 list
32 method
33 new algorithm
34 new general-purpose algorithm
35 number
36 operation
37 paper
38 particular operation
39 path
40 problem
41 purpose algorithm
42 rebound attack
43 results
44 situation
45 solution
46 state
47 schema:name How to Improve Rebound Attacks
48 schema:pagination 188-205
49 schema:productId N4c6f1bcbf29b4dc9a4ffbad2c2001b0d
50 Ndd692c72dab94e82af025ac9ca91c140
51 schema:publisher Nae80042d4b7b47a5ac47ba3d77bd4dd4
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001341652
53 https://doi.org/10.1007/978-3-642-22792-9_11
54 schema:sdDatePublished 2022-10-01T06:58
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher Nd7de0b89d99c461d919e6f163b43c264
57 schema:url https://doi.org/10.1007/978-3-642-22792-9_11
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N0d3da4ba31694c0aa529e87f21713334 schema:familyName Rogaway
62 schema:givenName Phillip
63 rdf:type schema:Person
64 N3584b7414d3442609ccf06527e85a5e8 rdf:first sg:person.013206304341.94
65 rdf:rest rdf:nil
66 N4c6f1bcbf29b4dc9a4ffbad2c2001b0d schema:name dimensions_id
67 schema:value pub.1001341652
68 rdf:type schema:PropertyValue
69 N725dfd5d452e4f97bd1cdbab3c38c278 schema:isbn 978-3-642-22791-2
70 978-3-642-22792-9
71 schema:name Advances in Cryptology – CRYPTO 2011
72 rdf:type schema:Book
73 Nae80042d4b7b47a5ac47ba3d77bd4dd4 schema:name Springer Nature
74 rdf:type schema:Organisation
75 Nb2c8bb8feb354196a50d3ab4e0756a98 rdf:first N0d3da4ba31694c0aa529e87f21713334
76 rdf:rest rdf:nil
77 Nd7de0b89d99c461d919e6f163b43c264 schema:name Springer Nature - SN SciGraph project
78 rdf:type schema:Organization
79 Ndd692c72dab94e82af025ac9ca91c140 schema:name doi
80 schema:value 10.1007/978-3-642-22792-9_11
81 rdf:type schema:PropertyValue
82 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
83 schema:name Information and Computing Sciences
84 rdf:type schema:DefinedTerm
85 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
86 schema:name Artificial Intelligence and Image Processing
87 rdf:type schema:DefinedTerm
88 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.410380.e
89 schema:familyName Naya-Plasencia
90 schema:givenName María
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
92 rdf:type schema:Person
93 grid-institutes:grid.410380.e schema:alternateName FHNW, Windisch, Switzerland
94 schema:name FHNW, Windisch, Switzerland
95 rdf:type schema:Organization
 




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


...