The RIPEMDL and RIPEMDR Improved Variants of MD4 Are Not Collision Free View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2002-06-21

AUTHORS

Christophe Debaert , Henri Gilbert

ABSTRACT

In 1992, the cryptographic hash function RIPEMD, a European proposal, was introduced as an improved variant of the MD4 hash function. RIPEMD involves two parallel lines of modified versions of the MD4 compression function. Three years later, an attack against a reduced version of RIPEMD in which the first or the last round of the RIPEMD compression function is omitted was described by Hans Dobbertin, who also published in 1998 a cryptanalysis of MD4. In this paper, we present a method for finding collisions in each of the parallel lines of RIPEMD. The collision search procedure requires only a few seconds computing time. We show that although the modifications of the MD4 compression function Used in RIPEMD introduce additional constraints in the cryptanalysis as Compared with Dobbertin’s attack of MD4, these modifications do not result in an increase of the collision search computation time. It is still an open question whether collisions can be found for the full RIPEMD function. More... »

PAGES

52-65

Book

TITLE

Fast Software Encryption

ISBN

978-3-540-43869-4
978-3-540-45473-1

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-45473-x_5

DOI

http://dx.doi.org/10.1007/3-540-45473-x_5

DIMENSIONS

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


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": "DGA/DCE/CELAR, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "DGA/DCE/CELAR, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Debaert", 
        "givenName": "Christophe", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "France T\u00e9l\u00e9com R&D, France", 
          "id": "http://www.grid.ac/institutes/grid.89485.38", 
          "name": [
            "France T\u00e9l\u00e9com R&D, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gilbert", 
        "givenName": "Henri", 
        "id": "sg:person.012771236207.08", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012771236207.08"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2002-06-21", 
    "datePublishedReg": "2002-06-21", 
    "description": "In 1992, the cryptographic hash function RIPEMD, a European proposal, was introduced as an improved variant of the MD4 hash function. RIPEMD involves two parallel lines of modified versions of the MD4 compression function. Three years later, an attack against a reduced version of RIPEMD in which the first or the last round of the RIPEMD compression function is omitted was described by Hans Dobbertin, who also published in 1998 a cryptanalysis of MD4. In this paper, we present a method for finding collisions in each of the parallel lines of RIPEMD. The collision search procedure requires only a few seconds computing time. We show that although the modifications of the MD4 compression function Used in RIPEMD introduce additional constraints in the cryptanalysis as Compared with Dobbertin\u2019s attack of MD4, these modifications do not result in an increase of the collision search computation time. It is still an open question whether collisions can be found for the full RIPEMD function.", 
    "editor": [
      {
        "familyName": "Matsui", 
        "givenName": "Mitsuru", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45473-x_5", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-43869-4", 
        "978-3-540-45473-1"
      ], 
      "name": "Fast Software Encryption", 
      "type": "Book"
    }, 
    "keywords": [
      "compression function", 
      "versions of RIPEMD", 
      "hash function", 
      "computation time", 
      "search procedure", 
      "MD4", 
      "RIPEMD", 
      "cryptanalysis", 
      "attacks", 
      "improved variant", 
      "parallel lines", 
      "additional constraints", 
      "version", 
      "last round", 
      "open question", 
      "constraints", 
      "proposal", 
      "European proposal", 
      "collisions", 
      "seconds", 
      "time", 
      "method", 
      "variants", 
      "function", 
      "rounds", 
      "Dobbertin", 
      "modification", 
      "questions", 
      "lines", 
      "procedure", 
      "years", 
      "increase", 
      "paper"
    ], 
    "name": "The RIPEMDL and RIPEMDR Improved Variants of MD4 Are Not Collision Free", 
    "pagination": "52-65", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1045695209"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45473-x_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45473-x_5", 
      "https://app.dimensions.ai/details/publication/pub.1045695209"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-12-01T06:49", 
    "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_241.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-45473-x_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-45473-x_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-45473-x_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-45473-x_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-45473-x_5'


 

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

101 TRIPLES      22 PREDICATES      57 URIs      50 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-45473-x_5 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Nb7e1d1cb1e774b6498117d583cf23a75
4 schema:datePublished 2002-06-21
5 schema:datePublishedReg 2002-06-21
6 schema:description In 1992, the cryptographic hash function RIPEMD, a European proposal, was introduced as an improved variant of the MD4 hash function. RIPEMD involves two parallel lines of modified versions of the MD4 compression function. Three years later, an attack against a reduced version of RIPEMD in which the first or the last round of the RIPEMD compression function is omitted was described by Hans Dobbertin, who also published in 1998 a cryptanalysis of MD4. In this paper, we present a method for finding collisions in each of the parallel lines of RIPEMD. The collision search procedure requires only a few seconds computing time. We show that although the modifications of the MD4 compression function Used in RIPEMD introduce additional constraints in the cryptanalysis as Compared with Dobbertin’s attack of MD4, these modifications do not result in an increase of the collision search computation time. It is still an open question whether collisions can be found for the full RIPEMD function.
7 schema:editor N2aee573812234c4f849a1292cfa5eaf2
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N9b4aa7f6378e420cbeee051fe823cd12
11 schema:keywords Dobbertin
12 European proposal
13 MD4
14 RIPEMD
15 additional constraints
16 attacks
17 collisions
18 compression function
19 computation time
20 constraints
21 cryptanalysis
22 function
23 hash function
24 improved variant
25 increase
26 last round
27 lines
28 method
29 modification
30 open question
31 paper
32 parallel lines
33 procedure
34 proposal
35 questions
36 rounds
37 search procedure
38 seconds
39 time
40 variants
41 version
42 versions of RIPEMD
43 years
44 schema:name The RIPEMDL and RIPEMDR Improved Variants of MD4 Are Not Collision Free
45 schema:pagination 52-65
46 schema:productId N659c3eff55f849c8bb22eb170f19f1fb
47 Nb43158cebf3c4a5094a691029f63663d
48 schema:publisher N9ca260ee61994d5083b7f7e9fb4eb296
49 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045695209
50 https://doi.org/10.1007/3-540-45473-x_5
51 schema:sdDatePublished 2022-12-01T06:49
52 schema:sdLicense https://scigraph.springernature.com/explorer/license/
53 schema:sdPublisher N85b7f221b11b476aaa84151d946c8e14
54 schema:url https://doi.org/10.1007/3-540-45473-x_5
55 sgo:license sg:explorer/license/
56 sgo:sdDataset chapters
57 rdf:type schema:Chapter
58 N2aee573812234c4f849a1292cfa5eaf2 rdf:first Nd7ae6068c66f4526b70b97c26a297a18
59 rdf:rest rdf:nil
60 N659c3eff55f849c8bb22eb170f19f1fb schema:name dimensions_id
61 schema:value pub.1045695209
62 rdf:type schema:PropertyValue
63 N740ce4aef810454f8fd2d5661f47375e rdf:first sg:person.012771236207.08
64 rdf:rest rdf:nil
65 N85b7f221b11b476aaa84151d946c8e14 schema:name Springer Nature - SN SciGraph project
66 rdf:type schema:Organization
67 N9b4aa7f6378e420cbeee051fe823cd12 schema:isbn 978-3-540-43869-4
68 978-3-540-45473-1
69 schema:name Fast Software Encryption
70 rdf:type schema:Book
71 N9ca260ee61994d5083b7f7e9fb4eb296 schema:name Springer Nature
72 rdf:type schema:Organisation
73 Nb43158cebf3c4a5094a691029f63663d schema:name doi
74 schema:value 10.1007/3-540-45473-x_5
75 rdf:type schema:PropertyValue
76 Nb7e1d1cb1e774b6498117d583cf23a75 rdf:first Nbcea627d36a947ae9d679936174a51c9
77 rdf:rest N740ce4aef810454f8fd2d5661f47375e
78 Nbcea627d36a947ae9d679936174a51c9 schema:affiliation grid-institutes:None
79 schema:familyName Debaert
80 schema:givenName Christophe
81 rdf:type schema:Person
82 Nd7ae6068c66f4526b70b97c26a297a18 schema:familyName Matsui
83 schema:givenName Mitsuru
84 rdf:type schema:Person
85 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
86 schema:name Information and Computing Sciences
87 rdf:type schema:DefinedTerm
88 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
89 schema:name Data Format
90 rdf:type schema:DefinedTerm
91 sg:person.012771236207.08 schema:affiliation grid-institutes:grid.89485.38
92 schema:familyName Gilbert
93 schema:givenName Henri
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012771236207.08
95 rdf:type schema:Person
96 grid-institutes:None schema:alternateName DGA/DCE/CELAR, France
97 schema:name DGA/DCE/CELAR, France
98 rdf:type schema:Organization
99 grid-institutes:grid.89485.38 schema:alternateName France Télécom R&D, France
100 schema:name France Télécom R&D, France
101 rdf:type schema:Organization
 




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


...