2009
AUTHORSJean-Philippe Aumasson , Orr Dunkelman , Sebastiaan Indesteege , Bart Preneel
ABSTRACTIn this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash functions rely heavily on data-dependent rotations, similar to certain block ciphers, e.g., RC5. Our analysis suggests that in the case of hash functions, where the attacker has more control over the rotations, this approach is less favorable than in block ciphers. We present practical, or close to practical, collision attacks on both Dynamic SHA and Dynamic SHA2. Moreover, we present a preimage attack on Dynamic SHA that is faster than exhaustive search. More... »
PAGES415-432
Selected Areas in Cryptography
ISBN
978-3-642-05443-3
978-3-642-05445-7
http://scigraph.springernature.com/pub.10.1007/978-3-642-05445-7_26
DOIhttp://dx.doi.org/10.1007/978-3-642-05445-7_26
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1026977466
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": "FHNW, Windisch, Switzerland",
"id": "http://www.grid.ac/institutes/grid.410380.e",
"name": [
"FHNW, Windisch, 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"
},
{
"affiliation": {
"alternateName": "\u00c9cole Normale Sup\u00e9rieure, INRIA, CNRS, Paris, France",
"id": "http://www.grid.ac/institutes/grid.4444.0",
"name": [
"\u00c9cole Normale Sup\u00e9rieure, INRIA, CNRS, Paris, France"
],
"type": "Organization"
},
"familyName": "Dunkelman",
"givenName": "Orr",
"id": "sg:person.016523255235.34",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016523255235.34"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium",
"id": "http://www.grid.ac/institutes/grid.56912.39",
"name": [
"Department of Electrical Engineering ESAT/COSIC, Katholieke Universiteit Leuven, Belgium",
"Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium"
],
"type": "Organization"
},
"familyName": "Indesteege",
"givenName": "Sebastiaan",
"id": "sg:person.013404144515.21",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013404144515.21"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium",
"id": "http://www.grid.ac/institutes/grid.56912.39",
"name": [
"Department of Electrical Engineering ESAT/COSIC, Katholieke Universiteit Leuven, Belgium",
"Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium"
],
"type": "Organization"
},
"familyName": "Preneel",
"givenName": "Bart",
"id": "sg:person.011115044357.39",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39"
],
"type": "Person"
}
],
"datePublished": "2009",
"datePublishedReg": "2009-01-01",
"description": "In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash functions rely heavily on data-dependent rotations, similar to certain block ciphers, e.g., RC5. Our analysis suggests that in the case of hash functions, where the attacker has more control over the rotations, this approach is less favorable than in block ciphers. We present practical, or close to practical, collision attacks on both Dynamic SHA and Dynamic SHA2. Moreover, we present a preimage attack on Dynamic SHA that is faster than exhaustive search.",
"editor": [
{
"familyName": "Jacobson",
"givenName": "Michael J.",
"type": "Person"
},
{
"familyName": "Rijmen",
"givenName": "Vincent",
"type": "Person"
},
{
"familyName": "Safavi-Naini",
"givenName": "Reihaneh",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-05445-7_26",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-642-05443-3",
"978-3-642-05445-7"
],
"name": "Selected Areas in Cryptography",
"type": "Book"
},
"keywords": [
"hash function",
"block cipher",
"data-dependent rotations",
"first round candidates",
"exhaustive search",
"SHA2",
"collision attack",
"preimage attack",
"cipher",
"attacks",
"more control",
"attacker",
"RC5",
"cryptanalysis",
"SHA",
"search",
"function",
"control",
"rotation",
"competition",
"analysis",
"candidates",
"dynamics",
"cases",
"paper",
"approach"
],
"name": "Cryptanalysis of Dynamic SHA(2)",
"pagination": "415-432",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1026977466"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-05445-7_26"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-05445-7_26",
"https://app.dimensions.ai/details/publication/pub.1026977466"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-06-01T22:33",
"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_376.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-642-05445-7_26"
}
]
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-05445-7_26'
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-05445-7_26'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-05445-7_26'
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-05445-7_26'
This table displays all metadata directly associated to this object as RDF triples.
124 TRIPLES
23 PREDICATES
52 URIs
45 LITERALS
7 BLANK NODES