2012
AUTHORS ABSTRACTDifferential Fault Analysis (DFA) was one of the earliest techniques invented to attack block ciphers by provoking a computational error. In the basic DFA scenario the adversary obtains a pair of ciphertexts both of which encrypt the same plaintext. One of these ciphertexts is the correct result while the other is an erroneous one resulting from a faulty computation. Though applications of DFA to DES and AES have proven to be quite effective, other techniques have also been invented which can threaten block ciphers in different ways. This chapter presents some of these fault analysis methods, including Collision Fault Analysis (CFA) and its close variant Ineffective Fault Analysis (IFA). These methods depart from DFA by the fault model they rely on, by their ability to defeat classical countermeasures against DFA or DPA, or by their application to specific implementations. More... »
PAGES19-35
Fault Analysis in Cryptography
ISBN
978-3-642-29655-0
978-3-642-29656-7
http://scigraph.springernature.com/pub.10.1007/978-3-642-29656-7_2
DOIhttp://dx.doi.org/10.1007/978-3-642-29656-7_2
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1046503038
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/0802",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computation Theory and Mathematics",
"type": "DefinedTerm"
},
{
"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"
}
],
"author": [
{
"affiliation": {
"alternateName": "XLIM",
"id": "https://www.grid.ac/institutes/grid.462736.2",
"name": [
"XLIM (UMR 6172), Universit\u00e9 de Limoges, Limoges, France"
],
"type": "Organization"
},
"familyName": "Clavier",
"givenName": "Christophe",
"id": "sg:person.07562566165.07",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07562566165.07"
],
"type": "Person"
}
],
"datePublished": "2012",
"datePublishedReg": "2012-01-01",
"description": "Differential Fault Analysis (DFA) was one of the earliest techniques invented to attack block ciphers by provoking a computational error. In the basic DFA scenario the adversary obtains a pair of ciphertexts both of which encrypt the same plaintext. One of these ciphertexts is the correct result while the other is an erroneous one resulting from a faulty computation. Though applications of DFA to DES and AES have proven to be quite effective, other techniques have also been invented which can threaten block ciphers in different ways. This chapter presents some of these fault analysis methods, including Collision Fault Analysis (CFA) and its close variant Ineffective Fault Analysis (IFA). These methods depart from DFA by the fault model they rely on, by their ability to defeat classical countermeasures against DFA or DPA, or by their application to specific implementations.",
"editor": [
{
"familyName": "Joye",
"givenName": "Marc",
"type": "Person"
},
{
"familyName": "Tunstall",
"givenName": "Michael",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-29656-7_2",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-642-29655-0",
"978-3-642-29656-7"
],
"name": "Fault Analysis in Cryptography",
"type": "Book"
},
"name": "Attacking Block Ciphers",
"pagination": "19-35",
"productId": [
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-29656-7_2"
]
},
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"dd85b2e6de7d2b263d72b127f4cb0e4d91772798c5bd398c3503294e623ba154"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1046503038"
]
}
],
"publisher": {
"location": "Berlin, Heidelberg",
"name": "Springer Berlin Heidelberg",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-29656-7_2",
"https://app.dimensions.ai/details/publication/pub.1046503038"
],
"sdDataset": "chapters",
"sdDatePublished": "2019-04-16T00:38",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8700_00000080.jsonl",
"type": "Chapter",
"url": "http://link.springer.com/10.1007/978-3-642-29656-7_2"
}
]
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-29656-7_2'
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-29656-7_2'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-29656-7_2'
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-29656-7_2'
This table displays all metadata directly associated to this object as RDF triples.
70 TRIPLES
22 PREDICATES
27 URIs
20 LITERALS
8 BLANK NODES