Hash Functions Based on Block Ciphers View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1993

AUTHORS

Xucjia Lai , James L. Massey

ABSTRACT

Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing m-bit and 2m-bit hash round functions from m-bit block ciphers are studied. A principle is formalized for evaluating the strength of hash round functions, viz., that applying computationally simple (in both directions) invertible transformations to the input and output of a hash round function yields a new hash round function with the same security. By applying this principle, four attacks on three previously proposed 2m-bit hash round functions are formulated. Finally, three new hash round functions based on an m-bit block cipher with a 2m-bit key are proposed. More... »

PAGES

55-70

Book

TITLE

Advances in Cryptology — EUROCRYPT’ 92

ISBN

978-3-540-56413-3
978-3-540-47555-2

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-47555-9_5

DOI

http://dx.doi.org/10.1007/3-540-47555-9_5

DIMENSIONS

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


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/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": "Signal and Information Processing Laboratory, Swiss Federal Institute of Technology, CH-8092, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Signal and Information Processing Laboratory, Swiss Federal Institute of Technology, CH-8092, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lai", 
        "givenName": "Xucjia", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Signal and Information Processing Laboratory, Swiss Federal Institute of Technology, CH-8092, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Signal and Information Processing Laboratory, Swiss Federal Institute of Technology, CH-8092, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Massey", 
        "givenName": "James L.", 
        "id": "sg:person.01034572767.77", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01034572767.77"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1993", 
    "datePublishedReg": "1993-01-01", 
    "description": "Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing m-bit and 2m-bit hash round functions from m-bit block ciphers are studied. A principle is formalized for evaluating the strength of hash round functions, viz., that applying computationally simple (in both directions) invertible transformations to the input and output of a hash round function yields a new hash round function with the same security. By applying this principle, four attacks on three previously proposed 2m-bit hash round functions are formulated. Finally, three new hash round functions based on an m-bit block cipher with a 2m-bit key are proposed.", 
    "editor": [
      {
        "familyName": "Rueppel", 
        "givenName": "Rainer A.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-47555-9_5", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-56413-3", 
        "978-3-540-47555-2"
      ], 
      "name": "Advances in Cryptology \u2014 EUROCRYPT\u2019 92", 
      "type": "Book"
    }, 
    "keywords": [
      "hash round function", 
      "hash function", 
      "block cipher", 
      "bit block cipher", 
      "round function", 
      "iterated hash function", 
      "such hash functions", 
      "same security", 
      "cipher", 
      "simple invertible transformation", 
      "attacks", 
      "last block", 
      "security", 
      "messages", 
      "bits", 
      "scheme", 
      "key", 
      "invertible transformation", 
      "input", 
      "principles", 
      "block", 
      "output", 
      "function", 
      "transformation", 
      "wisdom", 
      "viz", 
      "strength"
    ], 
    "name": "Hash Functions Based on Block Ciphers", 
    "pagination": "55-70", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1001052854"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-47555-9_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-47555-9_5", 
      "https://app.dimensions.ai/details/publication/pub.1001052854"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-12-01T06:52", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221201/entities/gbq_results/chapter/chapter_347.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-47555-9_5"
  }
]
 

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/3-540-47555-9_5'

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/3-540-47555-9_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-47555-9_5'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-47555-9_5'


 

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

92 TRIPLES      22 PREDICATES      52 URIs      45 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-47555-9_5 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Necb266449a294c679e6dbfdd9e7866ef
4 schema:datePublished 1993
5 schema:datePublishedReg 1993-01-01
6 schema:description Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing m-bit and 2m-bit hash round functions from m-bit block ciphers are studied. A principle is formalized for evaluating the strength of hash round functions, viz., that applying computationally simple (in both directions) invertible transformations to the input and output of a hash round function yields a new hash round function with the same security. By applying this principle, four attacks on three previously proposed 2m-bit hash round functions are formulated. Finally, three new hash round functions based on an m-bit block cipher with a 2m-bit key are proposed.
7 schema:editor N247aa8be494a4db28e4bebc6364bf85e
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Ncb06f36cea714cd29fbbdb3891e253bb
11 schema:keywords attacks
12 bit block cipher
13 bits
14 block
15 block cipher
16 cipher
17 function
18 hash function
19 hash round function
20 input
21 invertible transformation
22 iterated hash function
23 key
24 last block
25 messages
26 output
27 principles
28 round function
29 same security
30 scheme
31 security
32 simple invertible transformation
33 strength
34 such hash functions
35 transformation
36 viz
37 wisdom
38 schema:name Hash Functions Based on Block Ciphers
39 schema:pagination 55-70
40 schema:productId N06a52c2f73ca4780b891ecf8fd32d985
41 N59f6f06e64e746e58c948e383c2d23cf
42 schema:publisher N3a97e51213244e6ba9470ff191ddaab4
43 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001052854
44 https://doi.org/10.1007/3-540-47555-9_5
45 schema:sdDatePublished 2022-12-01T06:52
46 schema:sdLicense https://scigraph.springernature.com/explorer/license/
47 schema:sdPublisher N25245978c06b47d4acca28fece58d863
48 schema:url https://doi.org/10.1007/3-540-47555-9_5
49 sgo:license sg:explorer/license/
50 sgo:sdDataset chapters
51 rdf:type schema:Chapter
52 N06a52c2f73ca4780b891ecf8fd32d985 schema:name doi
53 schema:value 10.1007/3-540-47555-9_5
54 rdf:type schema:PropertyValue
55 N247aa8be494a4db28e4bebc6364bf85e rdf:first Nfcf3bb5ca95c4030893e844355e14cff
56 rdf:rest rdf:nil
57 N25245978c06b47d4acca28fece58d863 schema:name Springer Nature - SN SciGraph project
58 rdf:type schema:Organization
59 N3a97e51213244e6ba9470ff191ddaab4 schema:name Springer Nature
60 rdf:type schema:Organisation
61 N59f6f06e64e746e58c948e383c2d23cf schema:name dimensions_id
62 schema:value pub.1001052854
63 rdf:type schema:PropertyValue
64 N8300a6a630e2435a98f4667e909b54f6 schema:affiliation grid-institutes:grid.5801.c
65 schema:familyName Lai
66 schema:givenName Xucjia
67 rdf:type schema:Person
68 Nc81ed071eae849f8a9c53236e4faec28 rdf:first sg:person.01034572767.77
69 rdf:rest rdf:nil
70 Ncb06f36cea714cd29fbbdb3891e253bb schema:isbn 978-3-540-47555-2
71 978-3-540-56413-3
72 schema:name Advances in Cryptology — EUROCRYPT’ 92
73 rdf:type schema:Book
74 Necb266449a294c679e6dbfdd9e7866ef rdf:first N8300a6a630e2435a98f4667e909b54f6
75 rdf:rest Nc81ed071eae849f8a9c53236e4faec28
76 Nfcf3bb5ca95c4030893e844355e14cff schema:familyName Rueppel
77 schema:givenName Rainer A.
78 rdf:type schema:Person
79 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
80 schema:name Information and Computing Sciences
81 rdf:type schema:DefinedTerm
82 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
83 schema:name Data Format
84 rdf:type schema:DefinedTerm
85 sg:person.01034572767.77 schema:affiliation grid-institutes:grid.5801.c
86 schema:familyName Massey
87 schema:givenName James L.
88 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01034572767.77
89 rdf:type schema:Person
90 grid-institutes:grid.5801.c schema:alternateName Signal and Information Processing Laboratory, Swiss Federal Institute of Technology, CH-8092, Zürich, Switzerland
91 schema:name Signal and Information Processing Laboratory, Swiss Federal Institute of Technology, CH-8092, Zürich, Switzerland
92 rdf:type schema:Organization
 




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


...