Ontology type: schema:Chapter Open Access: True
2010
AUTHORSJean-Philippe Aumasson , Emilia Käsper , Lars Ramkilde Knudsen , Krystian Matusiewicz , Rune Ødegård , Thomas Peyrin , Martin Schläffer
ABSTRACTHamsi is one of 14 remaining candidates in NIST’s Hash Competition for the future hash standard SHA-3. Until now, little analysis has been published on its resistance to differential cryptanalysis, the main technique used to attack hash functions. We present a study of Hamsi’s resistance to differential and higher-order differential cryptanalysis, with focus on the 256-bit version of Hamsi. Our main results are efficient distinguishers and near-collisions for its full (3-round) compression function, and distinguishers for its full (6-round) finalization function, indicating that Hamsi’s building blocks do not behave ideally. More... »
PAGES87-103
Information Security and Privacy
ISBN
978-3-642-14080-8
978-3-642-14081-5
http://scigraph.springernature.com/pub.10.1007/978-3-642-14081-5_6
DOIhttp://dx.doi.org/10.1007/978-3-642-14081-5_6
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1049266616
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": "Nagravision SA, Cheseaux, Switzerland",
"id": "http://www.grid.ac/institutes/grid.480244.e",
"name": [
"Nagravision SA, 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"
},
{
"affiliation": {
"alternateName": "Katholieke Universiteit Leuven, ESAT-COSIC, Belgium",
"id": "http://www.grid.ac/institutes/grid.5596.f",
"name": [
"Katholieke Universiteit Leuven, ESAT-COSIC, Belgium"
],
"type": "Organization"
},
"familyName": "K\u00e4sper",
"givenName": "Emilia",
"id": "sg:person.016446167031.85",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016446167031.85"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Mathematics, Technical University of Denmark",
"id": "http://www.grid.ac/institutes/grid.5170.3",
"name": [
"Department of Mathematics, Technical University of Denmark"
],
"type": "Organization"
},
"familyName": "Knudsen",
"givenName": "Lars Ramkilde",
"id": "sg:person.011360461372.82",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011360461372.82"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Mathematics and Computer Science, Wroclaw University of Technology",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Institute of Mathematics and Computer Science, Wroclaw University of Technology"
],
"type": "Organization"
},
"familyName": "Matusiewicz",
"givenName": "Krystian",
"id": "sg:person.013523765031.38",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013523765031.38"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Centre for Quantifiable Quality of Service in Communication Systems at the Norwegian University of Science and Technology",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Centre for Quantifiable Quality of Service in Communication Systems at the Norwegian University of Science and Technology"
],
"type": "Organization"
},
"familyName": "\u00d8deg\u00e5rd",
"givenName": "Rune",
"type": "Person"
},
{
"affiliation": {
"alternateName": "Ingenico, France",
"id": "http://www.grid.ac/institutes/grid.435187.c",
"name": [
"Ingenico, France"
],
"type": "Organization"
},
"familyName": "Peyrin",
"givenName": "Thomas",
"id": "sg:person.011167161615.31",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011167161615.31"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "IAIK, TU Graz, Austria",
"id": "http://www.grid.ac/institutes/grid.410413.3",
"name": [
"IAIK, TU Graz, Austria"
],
"type": "Organization"
},
"familyName": "Schl\u00e4ffer",
"givenName": "Martin",
"id": "sg:person.015166313415.52",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015166313415.52"
],
"type": "Person"
}
],
"datePublished": "2010",
"datePublishedReg": "2010-01-01",
"description": "Hamsi is one of 14 remaining candidates in NIST\u2019s Hash Competition for the future hash standard SHA-3. Until now, little analysis has been published on its resistance to differential cryptanalysis, the main technique used to attack hash functions. We present a study of Hamsi\u2019s resistance to differential and higher-order differential cryptanalysis, with focus on the 256-bit version of Hamsi. Our main results are efficient distinguishers and near-collisions for its full (3-round) compression function, and distinguishers for its full (6-round) finalization function, indicating that Hamsi\u2019s building blocks do not behave ideally.",
"editor": [
{
"familyName": "Steinfeld",
"givenName": "Ron",
"type": "Person"
},
{
"familyName": "Hawkes",
"givenName": "Philip",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-14081-5_6",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-642-14080-8",
"978-3-642-14081-5"
],
"name": "Information Security and Privacy",
"type": "Book"
},
"keywords": [
"full compression function",
"resistance",
"function",
"main results",
"Hamsi-256",
"study",
"Hamsi",
"candidates",
"analysis",
"focus",
"results",
"block",
"main techniques",
"technique",
"version",
"NIST Hash Competition",
"little analysis",
"output transformation",
"compression function",
"transformation",
"competition",
"differential cryptanalysis",
"efficient distinguisher",
"distinguisher",
"building blocks",
"SHA-3",
"cryptanalysis",
"hash function",
"higher-order differential cryptanalysis"
],
"name": "Distinguishers for the Compression Function and Output Transformation of Hamsi-256",
"pagination": "87-103",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1049266616"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-14081-5_6"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-14081-5_6",
"https://app.dimensions.ai/details/publication/pub.1049266616"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-08-04T17:15",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_153.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-642-14081-5_6"
}
]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-14081-5_6'
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-14081-5_6'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-14081-5_6'
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-14081-5_6'
This table displays all metadata directly associated to this object as RDF triples.
151 TRIPLES
22 PREDICATES
54 URIs
47 LITERALS
7 BLANK NODES