2012
AUTHORSJulio Cesar Hernandez-Castro , Pedro Peris-Lopez , Jean-Philippe Aumasson
ABSTRACTWe 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... »
PAGES253-263
Data Privacy Management and Autonomous Spontaneus Security
ISBN
978-3-642-28878-4
978-3-642-28879-1
http://scigraph.springernature.com/pub.10.1007/978-3-642-28879-1_17
DOIhttp://dx.doi.org/10.1007/978-3-642-28879-1_17
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1052860080
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
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