Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2020-05-01

AUTHORS

Antonio Flórez-Gutiérrez , María Naya-Plasencia

ABSTRACT

Linear cryptanalysis is one of the most important tools in use for the security evaluation of symmetric primitives. Many improvements and refinements have been published since its introduction, and many applications on different ciphers have been found. Among these upgrades, Collard et al. proposed in 2007 an acceleration of the key-recovery part of Algorithm 2 for last-round attacks based on the FFT.In this paper we present a generalized, matrix-based version of the previous algorithm which easily allows us to take into consideration an arbitrary number of key-recovery rounds. We also provide efficient variants that exploit the key-schedule relations and that can be combined with multiple linear attacks.Using our algorithms we provide some new cryptanalysis on PRESENT, including, to the best of our knowledge, the first attack on 28 rounds. More... »

PAGES

221-249

Book

TITLE

Advances in Cryptology – EUROCRYPT 2020

ISBN

978-3-030-45720-4
978-3-030-45721-1

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-030-45721-1_9

DOI

http://dx.doi.org/10.1007/978-3-030-45721-1_9

DIMENSIONS

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


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": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fl\u00f3rez-Guti\u00e9rrez", 
        "givenName": "Antonio", 
        "id": "sg:person.012566014731.55", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012566014731.55"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, 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"
      }
    ], 
    "datePublished": "2020-05-01", 
    "datePublishedReg": "2020-05-01", 
    "description": "Linear cryptanalysis is one of the most important tools in use for the security evaluation of symmetric primitives. Many improvements and refinements have been published since its introduction, and many applications on different ciphers have been found. Among these upgrades, Collard et\u00a0al. proposed in 2007 an acceleration of the key-recovery part of Algorithm\u00a02 for last-round attacks based on the FFT.In this paper we present a generalized, matrix-based version of the previous algorithm which easily allows us to take into consideration an arbitrary number of key-recovery rounds. We also provide efficient variants that exploit the key-schedule relations and that can be combined with multiple linear attacks.Using our algorithms we provide some new cryptanalysis on PRESENT, including, to the best of our knowledge, the first attack on 28 rounds.", 
    "editor": [
      {
        "familyName": "Canteaut", 
        "givenName": "Anne", 
        "type": "Person"
      }, 
      {
        "familyName": "Ishai", 
        "givenName": "Yuval", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-030-45721-1_9", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-030-45720-4", 
        "978-3-030-45721-1"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2020", 
      "type": "Book"
    }, 
    "keywords": [
      "different ciphers", 
      "security evaluation", 
      "linear attack", 
      "symmetric primitives", 
      "key recovery", 
      "previous algorithms", 
      "efficient variant", 
      "new cryptanalysis", 
      "algorithm", 
      "key-recovery part", 
      "attacks", 
      "cryptanalysis", 
      "linear cryptanalysis", 
      "arbitrary number", 
      "primitives", 
      "cipher", 
      "applications", 
      "important tool", 
      "FFT", 
      "tool", 
      "upgrade", 
      "version", 
      "rounds", 
      "knowledge", 
      "refinement", 
      "first attack", 
      "evaluation", 
      "improvement", 
      "number", 
      "use", 
      "acceleration", 
      "part", 
      "variants", 
      "present", 
      "consideration", 
      "introduction", 
      "relation", 
      "et", 
      "al", 
      "paper"
    ], 
    "name": "Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT", 
    "pagination": "221-249", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1127314991"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-45721-1_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-45721-1_9", 
      "https://app.dimensions.ai/details/publication/pub.1127314991"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:10", 
    "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_122.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-030-45721-1_9"
  }
]
 

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-030-45721-1_9'

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-030-45721-1_9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-45721-1_9'

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-030-45721-1_9'


 

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

111 TRIPLES      22 PREDICATES      64 URIs      57 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-030-45721-1_9 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N3bfa60635098494abd7b31b3a24e4cfc
4 schema:datePublished 2020-05-01
5 schema:datePublishedReg 2020-05-01
6 schema:description Linear cryptanalysis is one of the most important tools in use for the security evaluation of symmetric primitives. Many improvements and refinements have been published since its introduction, and many applications on different ciphers have been found. Among these upgrades, Collard et al. proposed in 2007 an acceleration of the key-recovery part of Algorithm 2 for last-round attacks based on the FFT.In this paper we present a generalized, matrix-based version of the previous algorithm which easily allows us to take into consideration an arbitrary number of key-recovery rounds. We also provide efficient variants that exploit the key-schedule relations and that can be combined with multiple linear attacks.Using our algorithms we provide some new cryptanalysis on PRESENT, including, to the best of our knowledge, the first attack on 28 rounds.
7 schema:editor Na065bc41171d49809fa4250ca637e7d3
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nfdb01d2185864fdea9528ae4287428bc
11 schema:keywords FFT
12 acceleration
13 al
14 algorithm
15 applications
16 arbitrary number
17 attacks
18 cipher
19 consideration
20 cryptanalysis
21 different ciphers
22 efficient variant
23 et
24 evaluation
25 first attack
26 important tool
27 improvement
28 introduction
29 key recovery
30 key-recovery part
31 knowledge
32 linear attack
33 linear cryptanalysis
34 new cryptanalysis
35 number
36 paper
37 part
38 present
39 previous algorithms
40 primitives
41 refinement
42 relation
43 rounds
44 security evaluation
45 symmetric primitives
46 tool
47 upgrade
48 use
49 variants
50 version
51 schema:name Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT
52 schema:pagination 221-249
53 schema:productId N621237dff79345c9bbcbcc1a6a22405b
54 N938efee7ee1f45e0a0fb8b76a680df4f
55 schema:publisher Nc1857b0a30cc4de590c1c7aa87224bfb
56 schema:sameAs https://app.dimensions.ai/details/publication/pub.1127314991
57 https://doi.org/10.1007/978-3-030-45721-1_9
58 schema:sdDatePublished 2022-09-02T16:10
59 schema:sdLicense https://scigraph.springernature.com/explorer/license/
60 schema:sdPublisher N2fe3f8f6b93045ca8151f5efea94bb85
61 schema:url https://doi.org/10.1007/978-3-030-45721-1_9
62 sgo:license sg:explorer/license/
63 sgo:sdDataset chapters
64 rdf:type schema:Chapter
65 N0ddf4befd9c84ac18b5600edbda70302 rdf:first Ndd98652d692d4283b6f6508c3d076484
66 rdf:rest rdf:nil
67 N2fe3f8f6b93045ca8151f5efea94bb85 schema:name Springer Nature - SN SciGraph project
68 rdf:type schema:Organization
69 N3bfa60635098494abd7b31b3a24e4cfc rdf:first sg:person.012566014731.55
70 rdf:rest N6494fbf8e4564beeb5b663f1a387bc2a
71 N621237dff79345c9bbcbcc1a6a22405b schema:name doi
72 schema:value 10.1007/978-3-030-45721-1_9
73 rdf:type schema:PropertyValue
74 N6494fbf8e4564beeb5b663f1a387bc2a rdf:first sg:person.013206304341.94
75 rdf:rest rdf:nil
76 N938efee7ee1f45e0a0fb8b76a680df4f schema:name dimensions_id
77 schema:value pub.1127314991
78 rdf:type schema:PropertyValue
79 Na065bc41171d49809fa4250ca637e7d3 rdf:first Ne98eb053aff5486692c172d90e3c50da
80 rdf:rest N0ddf4befd9c84ac18b5600edbda70302
81 Nc1857b0a30cc4de590c1c7aa87224bfb schema:name Springer Nature
82 rdf:type schema:Organisation
83 Ndd98652d692d4283b6f6508c3d076484 schema:familyName Ishai
84 schema:givenName Yuval
85 rdf:type schema:Person
86 Ne98eb053aff5486692c172d90e3c50da schema:familyName Canteaut
87 schema:givenName Anne
88 rdf:type schema:Person
89 Nfdb01d2185864fdea9528ae4287428bc schema:isbn 978-3-030-45720-4
90 978-3-030-45721-1
91 schema:name Advances in Cryptology – EUROCRYPT 2020
92 rdf:type schema:Book
93 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
94 schema:name Information and Computing Sciences
95 rdf:type schema:DefinedTerm
96 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
97 schema:name Data Format
98 rdf:type schema:DefinedTerm
99 sg:person.012566014731.55 schema:affiliation grid-institutes:grid.5328.c
100 schema:familyName Flórez-Gutiérrez
101 schema:givenName Antonio
102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012566014731.55
103 rdf:type schema:Person
104 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.5328.c
105 schema:familyName Naya-Plasencia
106 schema:givenName María
107 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
108 rdf:type schema:Person
109 grid-institutes:grid.5328.c schema:alternateName Inria, Paris, France
110 schema:name Inria, Paris, France
111 rdf:type schema:Organization
 




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


...