Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2014

AUTHORS

Christina Boura , María Naya-Plasencia , Valentin Suder

ABSTRACT

Impossible differential cryptanalysis has shown to be a very powerful form of cryptanalysis against block ciphers. These attacks, even if extensively used, remain not fully understood because of their high technicality. Indeed, numerous are the applications where mistakes have been discovered or where the attacks lack optimality. This paper aims in a first step at formalizing and improving this type of attacks and in a second step at applying our work to block ciphers based on the Feistel construction. In this context, we derive generic complexity analysis formulas for mounting such attacks and develop new ideas for optimizing impossible differential cryptanalysis. These ideas include for example the testing of parts of the internal state for reducing the number of involved key bits. We also develop in a more general way the concept of using multiple differential paths, an idea introduced before in a more restrained context. These advances lead to the improvement of previous attacks against well known ciphers such as CLEFIA-128 and Camellia, while also to new attacks against 23-round LBlock and all members of the Simon family. More... »

PAGES

179-199

Book

TITLE

Advances in Cryptology – ASIACRYPT 2014

ISBN

978-3-662-45610-1
978-3-662-45611-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-45611-8_10

DOI

http://dx.doi.org/10.1007/978-3-662-45611-8_10

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Versailles Saint-Quentin-en-Yvelines University, France", 
          "id": "http://www.grid.ac/institutes/grid.12832.3a", 
          "name": [
            "Versailles Saint-Quentin-en-Yvelines University, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Boura", 
        "givenName": "Christina", 
        "id": "sg:person.015244215073.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015244215073.45"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, 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": "Inria, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Suder", 
        "givenName": "Valentin", 
        "id": "sg:person.010107336631.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010107336631.95"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2014", 
    "datePublishedReg": "2014-01-01", 
    "description": "Impossible differential cryptanalysis has shown to be a very powerful form of cryptanalysis against block ciphers. These attacks, even if extensively used, remain not fully understood because of their high technicality. Indeed, numerous are the applications where mistakes have been discovered or where the attacks lack optimality. This paper aims in a first step at formalizing and improving this type of attacks and in a second step at applying our work to block ciphers based on the Feistel construction. In this context, we derive generic complexity analysis formulas for mounting such attacks and develop new ideas for optimizing impossible differential cryptanalysis. These ideas include for example the testing of parts of the internal state for reducing the number of involved key bits. We also develop in a more general way the concept of using multiple differential paths, an idea introduced before in a more restrained context. These advances lead to the improvement of previous attacks against well known ciphers such as CLEFIA-128 and Camellia, while also to new attacks against 23-round LBlock and all members of the Simon family.", 
    "editor": [
      {
        "familyName": "Sarkar", 
        "givenName": "Palash", 
        "type": "Person"
      }, 
      {
        "familyName": "Iwata", 
        "givenName": "Tetsu", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-45611-8_10", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-45610-1", 
        "978-3-662-45611-8"
      ], 
      "name": "Advances in Cryptology \u2013 ASIACRYPT 2014", 
      "type": "Book"
    }, 
    "keywords": [
      "types of attacks", 
      "impossible differential cryptanalysis", 
      "differential cryptanalysis", 
      "such attacks", 
      "new attacks", 
      "block cipher", 
      "differential attacks", 
      "cipher", 
      "cryptanalysis", 
      "key bits", 
      "attacks", 
      "Feistel construction", 
      "previous attacks", 
      "high technicality", 
      "CLEFIA-128", 
      "LBlock", 
      "impossible differential attack", 
      "internal states", 
      "differential path", 
      "new ideas", 
      "CLEFIA", 
      "first step", 
      "second step", 
      "idea", 
      "applications", 
      "general way", 
      "bits", 
      "powerful form", 
      "optimality", 
      "context", 
      "SIMON family", 
      "step", 
      "path", 
      "technicalities", 
      "concept", 
      "mistakes", 
      "analysis formula", 
      "example", 
      "way", 
      "work", 
      "advances", 
      "construction", 
      "improvement", 
      "number", 
      "testing", 
      "part", 
      "state", 
      "Simon", 
      "Camellia", 
      "types", 
      "form", 
      "formula", 
      "members", 
      "family", 
      "paper", 
      "testing of parts"
    ], 
    "name": "Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon", 
    "pagination": "179-199", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1041804262"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-45611-8_10"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-45611-8_10", 
      "https://app.dimensions.ai/details/publication/pub.1041804262"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:16", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/chapter/chapter_459.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-45611-8_10"
  }
]
 

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-662-45611-8_10'

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-662-45611-8_10'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-45611-8_10'

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-662-45611-8_10'


 

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

137 TRIPLES      22 PREDICATES      81 URIs      74 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-45611-8_10 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nbec9920b11f544b79c46df7177b7f062
4 schema:datePublished 2014
5 schema:datePublishedReg 2014-01-01
6 schema:description Impossible differential cryptanalysis has shown to be a very powerful form of cryptanalysis against block ciphers. These attacks, even if extensively used, remain not fully understood because of their high technicality. Indeed, numerous are the applications where mistakes have been discovered or where the attacks lack optimality. This paper aims in a first step at formalizing and improving this type of attacks and in a second step at applying our work to block ciphers based on the Feistel construction. In this context, we derive generic complexity analysis formulas for mounting such attacks and develop new ideas for optimizing impossible differential cryptanalysis. These ideas include for example the testing of parts of the internal state for reducing the number of involved key bits. We also develop in a more general way the concept of using multiple differential paths, an idea introduced before in a more restrained context. These advances lead to the improvement of previous attacks against well known ciphers such as CLEFIA-128 and Camellia, while also to new attacks against 23-round LBlock and all members of the Simon family.
7 schema:editor N1bebdee80852486783be50c07d4b3731
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nec9ce81e426748248b0dfb62c755d3b0
11 schema:keywords CLEFIA
12 CLEFIA-128
13 Camellia
14 Feistel construction
15 LBlock
16 SIMON family
17 Simon
18 advances
19 analysis formula
20 applications
21 attacks
22 bits
23 block cipher
24 cipher
25 concept
26 construction
27 context
28 cryptanalysis
29 differential attacks
30 differential cryptanalysis
31 differential path
32 example
33 family
34 first step
35 form
36 formula
37 general way
38 high technicality
39 idea
40 impossible differential attack
41 impossible differential cryptanalysis
42 improvement
43 internal states
44 key bits
45 members
46 mistakes
47 new attacks
48 new ideas
49 number
50 optimality
51 paper
52 part
53 path
54 powerful form
55 previous attacks
56 second step
57 state
58 step
59 such attacks
60 technicalities
61 testing
62 testing of parts
63 types
64 types of attacks
65 way
66 work
67 schema:name Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon
68 schema:pagination 179-199
69 schema:productId N3d2af97a8af74e83bda93d5d815f2719
70 Nfd5a045a1ff84d5d8ef07906be0e2d24
71 schema:publisher N4843e96b730b45e2a9c26dfbcf9b1108
72 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041804262
73 https://doi.org/10.1007/978-3-662-45611-8_10
74 schema:sdDatePublished 2022-09-02T16:16
75 schema:sdLicense https://scigraph.springernature.com/explorer/license/
76 schema:sdPublisher Na2b2467034a94feb9d720cb9db920fe3
77 schema:url https://doi.org/10.1007/978-3-662-45611-8_10
78 sgo:license sg:explorer/license/
79 sgo:sdDataset chapters
80 rdf:type schema:Chapter
81 N1bebdee80852486783be50c07d4b3731 rdf:first N5f87948a830d40a08f9dac8028782b90
82 rdf:rest N913cdcf2b9204fddb18512f73e7b57cc
83 N3d2af97a8af74e83bda93d5d815f2719 schema:name doi
84 schema:value 10.1007/978-3-662-45611-8_10
85 rdf:type schema:PropertyValue
86 N4843e96b730b45e2a9c26dfbcf9b1108 schema:name Springer Nature
87 rdf:type schema:Organisation
88 N5f87948a830d40a08f9dac8028782b90 schema:familyName Sarkar
89 schema:givenName Palash
90 rdf:type schema:Person
91 N913cdcf2b9204fddb18512f73e7b57cc rdf:first Na548f7c3fc554810a8f5e4a84d72ccca
92 rdf:rest rdf:nil
93 N98a48e5dfa7c4fc383bb311de739a887 rdf:first sg:person.013206304341.94
94 rdf:rest Na36045c3b11c494d8bdcacfb5a0469e5
95 Na2b2467034a94feb9d720cb9db920fe3 schema:name Springer Nature - SN SciGraph project
96 rdf:type schema:Organization
97 Na36045c3b11c494d8bdcacfb5a0469e5 rdf:first sg:person.010107336631.95
98 rdf:rest rdf:nil
99 Na548f7c3fc554810a8f5e4a84d72ccca schema:familyName Iwata
100 schema:givenName Tetsu
101 rdf:type schema:Person
102 Nbec9920b11f544b79c46df7177b7f062 rdf:first sg:person.015244215073.45
103 rdf:rest N98a48e5dfa7c4fc383bb311de739a887
104 Nec9ce81e426748248b0dfb62c755d3b0 schema:isbn 978-3-662-45610-1
105 978-3-662-45611-8
106 schema:name Advances in Cryptology – ASIACRYPT 2014
107 rdf:type schema:Book
108 Nfd5a045a1ff84d5d8ef07906be0e2d24 schema:name dimensions_id
109 schema:value pub.1041804262
110 rdf:type schema:PropertyValue
111 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
112 schema:name Information and Computing Sciences
113 rdf:type schema:DefinedTerm
114 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
115 schema:name Computation Theory and Mathematics
116 rdf:type schema:DefinedTerm
117 sg:person.010107336631.95 schema:affiliation grid-institutes:grid.5328.c
118 schema:familyName Suder
119 schema:givenName Valentin
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010107336631.95
121 rdf:type schema:Person
122 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.5328.c
123 schema:familyName Naya-Plasencia
124 schema:givenName María
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
126 rdf:type schema:Person
127 sg:person.015244215073.45 schema:affiliation grid-institutes:grid.12832.3a
128 schema:familyName Boura
129 schema:givenName Christina
130 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015244215073.45
131 rdf:type schema:Person
132 grid-institutes:grid.12832.3a schema:alternateName Versailles Saint-Quentin-en-Yvelines University, France
133 schema:name Versailles Saint-Quentin-en-Yvelines University, France
134 rdf:type schema:Organization
135 grid-institutes:grid.5328.c schema:alternateName Inria, France
136 schema:name Inria, France
137 rdf:type schema:Organization
 




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


...