On the Key Schedule Strength of PRESENT View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2012

AUTHORS

Julio Cesar Hernandez-Castro , Pedro Peris-Lopez , Jean-Philippe Aumasson

ABSTRACT

We present here the results of a playful research on how to measure the strength of a key schedule algorithm, with applications to PRESENT, including its two variants with 80 and 128 bit keys. We do not claim to have discovered any devastating weakness, but believe that some of the results presented, albeit controversial, could be of interest for other researchers investigating this cipher, notably for those working in impossible differentials and related key or slide attacks. Furthermore, in the case of PRESENT, key schedule features shown here may be exploited to attack some of the PRESENT-based hash functions. We carried out a probabilistic metaheuristic search for semi-equivalent keys, annihilators and entropy minima, and proposed a simple way of combining these results into a single value with a straightforward mathematical expression that could help in abstracting resistance to the set of presented analysis. Surprisingly, PRESENT− 128 seems weaker than PRESENT− 80 in the light of this new measure. More... »

PAGES

253-263

Book

TITLE

Data Privacy Management and Autonomous Spontaneus Security

ISBN

978-3-642-28878-4
978-3-642-28879-1

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-28879-1_17

DOI

http://dx.doi.org/10.1007/978-3-642-28879-1_17

DIMENSIONS

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


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/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "School of Computing, Portsmouth University, UK", 
          "id": "http://www.grid.ac/institutes/grid.4701.2", 
          "name": [
            "School of Computing, Portsmouth University, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hernandez-Castro", 
        "givenName": "Julio Cesar", 
        "id": "sg:person.012013656616.28", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012013656616.28"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Information Security & Privacy Lab, TU-Delft, The Netherlands", 
          "id": "http://www.grid.ac/institutes/grid.5292.c", 
          "name": [
            "Information Security & Privacy Lab, TU-Delft, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Peris-Lopez", 
        "givenName": "Pedro", 
        "id": "sg:person.016566437667.37", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016566437667.37"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "NagravisionSA, Cheseaux, Switzerland", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "NagravisionSA, Cheseaux, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Aumasson", 
        "givenName": "Jean-Philippe", 
        "id": "sg:person.012606440341.66", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "We present here the results of a playful research on how to measure the strength of a key schedule algorithm, with applications to PRESENT, including its two variants with 80 and 128 bit keys. We do not claim to have discovered any devastating weakness, but believe that some of the results presented, albeit controversial, could be of interest for other researchers investigating this cipher, notably for those working in impossible differentials and related key or slide attacks. Furthermore, in the case of PRESENT, key schedule features shown here may be exploited to attack some of the PRESENT-based hash functions. We carried out a probabilistic metaheuristic search for semi-equivalent keys, annihilators and entropy minima, and proposed a simple way of combining these results into a single value with a straightforward mathematical expression that could help in abstracting resistance to the set of presented analysis. Surprisingly, PRESENT\u2212\u2009128 seems weaker than PRESENT\u2212\u200980 in the light of this new measure.", 
    "editor": [
      {
        "familyName": "Garcia-Alfaro", 
        "givenName": "Joaquin", 
        "type": "Person"
      }, 
      {
        "familyName": "Navarro-Arribas", 
        "givenName": "Guillermo", 
        "type": "Person"
      }, 
      {
        "familyName": "Cuppens-Boulahia", 
        "givenName": "Nora", 
        "type": "Person"
      }, 
      {
        "familyName": "de Capitani di Vimercati", 
        "givenName": "Sabrina", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-28879-1_17", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-28878-4", 
        "978-3-642-28879-1"
      ], 
      "name": "Data Privacy Management and Autonomous Spontaneus Security", 
      "type": "Book"
    }, 
    "keywords": [
      "straightforward mathematical expressions", 
      "mathematical expressions", 
      "entropy minimum", 
      "metaheuristic search", 
      "case of present", 
      "simple way", 
      "single value", 
      "schedule algorithm", 
      "annihilator", 
      "key schedule algorithm", 
      "slide attack", 
      "algorithm", 
      "hash function", 
      "set", 
      "key schedule", 
      "results", 
      "minimum", 
      "impossible differentials", 
      "new measure", 
      "applications", 
      "function", 
      "differential", 
      "related keys", 
      "cipher", 
      "cases", 
      "strength", 
      "schedule", 
      "search", 
      "interest", 
      "values", 
      "way", 
      "analysis", 
      "key", 
      "variants", 
      "researchers", 
      "measures", 
      "attacks", 
      "present", 
      "light", 
      "expression", 
      "weakness", 
      "research", 
      "resistance", 
      "bit keys"
    ], 
    "name": "On the Key Schedule Strength of PRESENT", 
    "pagination": "253-263", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1052860080"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-28879-1_17"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-28879-1_17", 
      "https://app.dimensions.ai/details/publication/pub.1052860080"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:31", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_296.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-28879-1_17"
  }
]
 

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-28879-1_17'

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-28879-1_17'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-28879-1_17'

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-28879-1_17'


 

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

139 TRIPLES      23 PREDICATES      70 URIs      63 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-28879-1_17 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author N83eb0f9ac4bb4526a270f4e98b41fc3c
4 schema:datePublished 2012
5 schema:datePublishedReg 2012-01-01
6 schema:description We present here the results of a playful research on how to measure the strength of a key schedule algorithm, with applications to PRESENT, including its two variants with 80 and 128 bit keys. We do not claim to have discovered any devastating weakness, but believe that some of the results presented, albeit controversial, could be of interest for other researchers investigating this cipher, notably for those working in impossible differentials and related key or slide attacks. Furthermore, in the case of PRESENT, key schedule features shown here may be exploited to attack some of the PRESENT-based hash functions. We carried out a probabilistic metaheuristic search for semi-equivalent keys, annihilators and entropy minima, and proposed a simple way of combining these results into a single value with a straightforward mathematical expression that could help in abstracting resistance to the set of presented analysis. Surprisingly, PRESENT− 128 seems weaker than PRESENT− 80 in the light of this new measure.
7 schema:editor Nf2fd3a87e4124536946e3fc4c74210f5
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N4a4e36750f3543e3ab8ab2e280499ee7
12 schema:keywords algorithm
13 analysis
14 annihilator
15 applications
16 attacks
17 bit keys
18 case of present
19 cases
20 cipher
21 differential
22 entropy minimum
23 expression
24 function
25 hash function
26 impossible differentials
27 interest
28 key
29 key schedule
30 key schedule algorithm
31 light
32 mathematical expressions
33 measures
34 metaheuristic search
35 minimum
36 new measure
37 present
38 related keys
39 research
40 researchers
41 resistance
42 results
43 schedule
44 schedule algorithm
45 search
46 set
47 simple way
48 single value
49 slide attack
50 straightforward mathematical expressions
51 strength
52 values
53 variants
54 way
55 weakness
56 schema:name On the Key Schedule Strength of PRESENT
57 schema:pagination 253-263
58 schema:productId N0e2c2f3aa3b1446f94cffdcc928a5147
59 Nac890a81c5034a1e98eeb24ca413a2a7
60 schema:publisher Nbb5fe8d04eb04ca2bced11d63bf87f84
61 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052860080
62 https://doi.org/10.1007/978-3-642-28879-1_17
63 schema:sdDatePublished 2022-06-01T22:31
64 schema:sdLicense https://scigraph.springernature.com/explorer/license/
65 schema:sdPublisher N205d4866e2824ec485e7b56c0e351d9f
66 schema:url https://doi.org/10.1007/978-3-642-28879-1_17
67 sgo:license sg:explorer/license/
68 sgo:sdDataset chapters
69 rdf:type schema:Chapter
70 N0e2c2f3aa3b1446f94cffdcc928a5147 schema:name doi
71 schema:value 10.1007/978-3-642-28879-1_17
72 rdf:type schema:PropertyValue
73 N205d4866e2824ec485e7b56c0e351d9f schema:name Springer Nature - SN SciGraph project
74 rdf:type schema:Organization
75 N232d594f45fe4f508d22616d0d193b53 rdf:first N385d8bfce8c241d79e462a5d41fefd76
76 rdf:rest N98ce4013490843dd8d462ca4616efcdd
77 N2dc8bd7e36d54136a7d70a95c9cb176c rdf:first N836a333169d9440eae4a9bce7306ff43
78 rdf:rest rdf:nil
79 N385d8bfce8c241d79e462a5d41fefd76 schema:familyName Navarro-Arribas
80 schema:givenName Guillermo
81 rdf:type schema:Person
82 N42d9c72fe16c4f5ca0c69e129c4e38ee schema:familyName Garcia-Alfaro
83 schema:givenName Joaquin
84 rdf:type schema:Person
85 N4a4e36750f3543e3ab8ab2e280499ee7 schema:isbn 978-3-642-28878-4
86 978-3-642-28879-1
87 schema:name Data Privacy Management and Autonomous Spontaneus Security
88 rdf:type schema:Book
89 N61d50c9be3434710aed631450fe444b5 rdf:first sg:person.012606440341.66
90 rdf:rest rdf:nil
91 N7037a2caa21c4ca990825e2f04d443e5 schema:familyName Cuppens-Boulahia
92 schema:givenName Nora
93 rdf:type schema:Person
94 N836a333169d9440eae4a9bce7306ff43 schema:familyName de Capitani di Vimercati
95 schema:givenName Sabrina
96 rdf:type schema:Person
97 N83eb0f9ac4bb4526a270f4e98b41fc3c rdf:first sg:person.012013656616.28
98 rdf:rest Ned87337451f24f37803f1d295388088f
99 N98ce4013490843dd8d462ca4616efcdd rdf:first N7037a2caa21c4ca990825e2f04d443e5
100 rdf:rest N2dc8bd7e36d54136a7d70a95c9cb176c
101 Nac890a81c5034a1e98eeb24ca413a2a7 schema:name dimensions_id
102 schema:value pub.1052860080
103 rdf:type schema:PropertyValue
104 Nbb5fe8d04eb04ca2bced11d63bf87f84 schema:name Springer Nature
105 rdf:type schema:Organisation
106 Ned87337451f24f37803f1d295388088f rdf:first sg:person.016566437667.37
107 rdf:rest N61d50c9be3434710aed631450fe444b5
108 Nf2fd3a87e4124536946e3fc4c74210f5 rdf:first N42d9c72fe16c4f5ca0c69e129c4e38ee
109 rdf:rest N232d594f45fe4f508d22616d0d193b53
110 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
111 schema:name Mathematical Sciences
112 rdf:type schema:DefinedTerm
113 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
114 schema:name Pure Mathematics
115 rdf:type schema:DefinedTerm
116 sg:person.012013656616.28 schema:affiliation grid-institutes:grid.4701.2
117 schema:familyName Hernandez-Castro
118 schema:givenName Julio Cesar
119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012013656616.28
120 rdf:type schema:Person
121 sg:person.012606440341.66 schema:affiliation grid-institutes:None
122 schema:familyName Aumasson
123 schema:givenName Jean-Philippe
124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66
125 rdf:type schema:Person
126 sg:person.016566437667.37 schema:affiliation grid-institutes:grid.5292.c
127 schema:familyName Peris-Lopez
128 schema:givenName Pedro
129 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016566437667.37
130 rdf:type schema:Person
131 grid-institutes:None schema:alternateName NagravisionSA, Cheseaux, Switzerland
132 schema:name NagravisionSA, Cheseaux, Switzerland
133 rdf:type schema:Organization
134 grid-institutes:grid.4701.2 schema:alternateName School of Computing, Portsmouth University, UK
135 schema:name School of Computing, Portsmouth University, UK
136 rdf:type schema:Organization
137 grid-institutes:grid.5292.c schema:alternateName Information Security & Privacy Lab, TU-Delft, The Netherlands
138 schema:name Information Security & Privacy Lab, TU-Delft, The Netherlands
139 rdf:type schema:Organization
 




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


...