New types of cryptanalytic attacks using related keys View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

1994-12

AUTHORS

Eli Biham

ABSTRACT

In this paper we study the influence of key-scheduling algorithms on the strength of blockciphers. We show that the key-scheduling algorithms of many blockciphers inherit obvious relationships between keys, and use these key relations to attack the blockciphers. Two new types of attacks are described: New chosen plaintext reductions of the complexity of exhaustive search attacks (and the faster variants based on complementation properties), and new low-complexity chosen key attacks. These attacks are independent of the number of rounds of the cryptosystems and of the details of the F-function and may have very small complexities. These attacks show that the key-scheduling algorithm should be carefully designed and that its structure should not be too simple. These attacks are applicable to both variants of LOKI and to Lucifer. DES is not vulnerable to the related keys attacks since the shift pattern in the key-scheduling algorithm is not the same in all the rounds. More... »

PAGES

229-246

References to SciGraph publications

  • 1993. Cryptanalysis of LOKI in ADVANCES IN CRYPTOLOGY — ASIACRYPT '91
  • 1993. Improving resistance to differential cryptanalysis and the redesign of LOKI in ADVANCES IN CRYPTOLOGY — ASIACRYPT '91
  • 1991-01. Differential cryptanalysis of DES-like cryptosystems in JOURNAL OF CRYPTOLOGY
  • 1990. LOKI — A cryptographic primitive for authentication and secrecy applications in ADVANCES IN CRYPTOLOGY — AUSCRYPT '90
  • 1990. Key scheduling in des type cryptosystems in ADVANCES IN CRYPTOLOGY — AUSCRYPT '90
  • 1993. Cryptanalysis of LOKI 91 in ADVANCES IN CRYPTOLOGY — AUSCRYPT '92
  • 2001-05-18. Markov Ciphers and Differential Cryptanalysis in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’91
  • 1993. A general purpose technique for locating key scheduling weaknesses in DES-like cryptosystems in ADVANCES IN CRYPTOLOGY — ASIACRYPT '91
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/bf00203965

    DOI

    http://dx.doi.org/10.1007/bf00203965

    DIMENSIONS

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


    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/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": "Technion \u2013 Israel Institute of Technology", 
              "id": "https://www.grid.ac/institutes/grid.6451.6", 
              "name": [
                "Computer Science Department, Technion\u2014Israel Institute of Technology, 32000, Haifa, Israel"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Biham", 
            "givenName": "Eli", 
            "id": "sg:person.014332733635.97", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014332733635.97"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-57332-1_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006297322", 
              "https://doi.org/10.1007/3-540-57332-1_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46416-6_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012941871", 
              "https://doi.org/10.1007/3-540-46416-6_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46416-6_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012941871", 
              "https://doi.org/10.1007/3-540-46416-6_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-57220-1_62", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024967017", 
              "https://doi.org/10.1007/3-540-57220-1_62"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1080/0161-118491858746", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030743079"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-57332-1_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038105258", 
              "https://doi.org/10.1007/3-540-57332-1_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-57332-1_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040521421", 
              "https://doi.org/10.1007/3-540-57332-1_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0030363", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042487800", 
              "https://doi.org/10.1007/bfb0030363"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00630563", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048571070", 
              "https://doi.org/10.1007/bf00630563"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00630563", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048571070", 
              "https://doi.org/10.1007/bf00630563"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00630563", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048571070", 
              "https://doi.org/10.1007/bf00630563"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0030364", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051754516", 
              "https://doi.org/10.1007/bfb0030364"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "1994-12", 
        "datePublishedReg": "1994-12-01", 
        "description": "In this paper we study the influence of key-scheduling algorithms on the strength of blockciphers. We show that the key-scheduling algorithms of many blockciphers inherit obvious relationships between keys, and use these key relations to attack the blockciphers. Two new types of attacks are described: New chosen plaintext reductions of the complexity of exhaustive search attacks (and the faster variants based on complementation properties), and new low-complexity chosen key attacks. These attacks are independent of the number of rounds of the cryptosystems and of the details of the F-function and may have very small complexities. These attacks show that the key-scheduling algorithm should be carefully designed and that its structure should not be too simple. These attacks are applicable to both variants of LOKI and to Lucifer. DES is not vulnerable to the related keys attacks since the shift pattern in the key-scheduling algorithm is not the same in all the rounds.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/bf00203965", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136278", 
            "issn": [
              "0933-2790", 
              "1432-1378"
            ], 
            "name": "Journal of Cryptology", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "4", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "7"
          }
        ], 
        "name": "New types of cryptanalytic attacks using related keys", 
        "pagination": "229-246", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "d86aa4f3946d131aae36244d21bad1da80eb1137b51e109564dadf1ab85ce235"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/bf00203965"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1045432758"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/bf00203965", 
          "https://app.dimensions.ai/details/publication/pub.1045432758"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T13:58", 
        "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/0000000371_0000000371/records_130820_00000004.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007/BF00203965"
      }
    ]
     

    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/bf00203965'

    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/bf00203965'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf00203965'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf00203965'


     

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

    96 TRIPLES      21 PREDICATES      36 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/bf00203965 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N70f9112bd83e4ce99101f8b61759f6ef
    4 schema:citation sg:pub.10.1007/3-540-46416-6_2
    5 sg:pub.10.1007/3-540-57220-1_62
    6 sg:pub.10.1007/3-540-57332-1_19
    7 sg:pub.10.1007/3-540-57332-1_2
    8 sg:pub.10.1007/3-540-57332-1_3
    9 sg:pub.10.1007/bf00630563
    10 sg:pub.10.1007/bfb0030363
    11 sg:pub.10.1007/bfb0030364
    12 https://doi.org/10.1080/0161-118491858746
    13 schema:datePublished 1994-12
    14 schema:datePublishedReg 1994-12-01
    15 schema:description In this paper we study the influence of key-scheduling algorithms on the strength of blockciphers. We show that the key-scheduling algorithms of many blockciphers inherit obvious relationships between keys, and use these key relations to attack the blockciphers. Two new types of attacks are described: New chosen plaintext reductions of the complexity of exhaustive search attacks (and the faster variants based on complementation properties), and new low-complexity chosen key attacks. These attacks are independent of the number of rounds of the cryptosystems and of the details of the F-function and may have very small complexities. These attacks show that the key-scheduling algorithm should be carefully designed and that its structure should not be too simple. These attacks are applicable to both variants of LOKI and to Lucifer. DES is not vulnerable to the related keys attacks since the shift pattern in the key-scheduling algorithm is not the same in all the rounds.
    16 schema:genre research_article
    17 schema:inLanguage en
    18 schema:isAccessibleForFree true
    19 schema:isPartOf Nbdb06001758c4fed8cd2905c23dcb20c
    20 Nd724d8c84cd64198a82b8c4943c3ae7f
    21 sg:journal.1136278
    22 schema:name New types of cryptanalytic attacks using related keys
    23 schema:pagination 229-246
    24 schema:productId N0e9798a6cb8547fa9d624695662f7e47
    25 N16575d3465e8478faf0dc44ddd404aed
    26 Nd5d7819e786a47f68916d5e4896a7783
    27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045432758
    28 https://doi.org/10.1007/bf00203965
    29 schema:sdDatePublished 2019-04-11T13:58
    30 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    31 schema:sdPublisher Nda5fa45e7fbf462f8b4ab7c938d97004
    32 schema:url http://link.springer.com/10.1007/BF00203965
    33 sgo:license sg:explorer/license/
    34 sgo:sdDataset articles
    35 rdf:type schema:ScholarlyArticle
    36 N0e9798a6cb8547fa9d624695662f7e47 schema:name dimensions_id
    37 schema:value pub.1045432758
    38 rdf:type schema:PropertyValue
    39 N16575d3465e8478faf0dc44ddd404aed schema:name doi
    40 schema:value 10.1007/bf00203965
    41 rdf:type schema:PropertyValue
    42 N70f9112bd83e4ce99101f8b61759f6ef rdf:first sg:person.014332733635.97
    43 rdf:rest rdf:nil
    44 Nbdb06001758c4fed8cd2905c23dcb20c schema:volumeNumber 7
    45 rdf:type schema:PublicationVolume
    46 Nd5d7819e786a47f68916d5e4896a7783 schema:name readcube_id
    47 schema:value d86aa4f3946d131aae36244d21bad1da80eb1137b51e109564dadf1ab85ce235
    48 rdf:type schema:PropertyValue
    49 Nd724d8c84cd64198a82b8c4943c3ae7f schema:issueNumber 4
    50 rdf:type schema:PublicationIssue
    51 Nda5fa45e7fbf462f8b4ab7c938d97004 schema:name Springer Nature - SN SciGraph project
    52 rdf:type schema:Organization
    53 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    54 schema:name Information and Computing Sciences
    55 rdf:type schema:DefinedTerm
    56 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    57 schema:name Computation Theory and Mathematics
    58 rdf:type schema:DefinedTerm
    59 sg:journal.1136278 schema:issn 0933-2790
    60 1432-1378
    61 schema:name Journal of Cryptology
    62 rdf:type schema:Periodical
    63 sg:person.014332733635.97 schema:affiliation https://www.grid.ac/institutes/grid.6451.6
    64 schema:familyName Biham
    65 schema:givenName Eli
    66 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014332733635.97
    67 rdf:type schema:Person
    68 sg:pub.10.1007/3-540-46416-6_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012941871
    69 https://doi.org/10.1007/3-540-46416-6_2
    70 rdf:type schema:CreativeWork
    71 sg:pub.10.1007/3-540-57220-1_62 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024967017
    72 https://doi.org/10.1007/3-540-57220-1_62
    73 rdf:type schema:CreativeWork
    74 sg:pub.10.1007/3-540-57332-1_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006297322
    75 https://doi.org/10.1007/3-540-57332-1_19
    76 rdf:type schema:CreativeWork
    77 sg:pub.10.1007/3-540-57332-1_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038105258
    78 https://doi.org/10.1007/3-540-57332-1_2
    79 rdf:type schema:CreativeWork
    80 sg:pub.10.1007/3-540-57332-1_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040521421
    81 https://doi.org/10.1007/3-540-57332-1_3
    82 rdf:type schema:CreativeWork
    83 sg:pub.10.1007/bf00630563 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048571070
    84 https://doi.org/10.1007/bf00630563
    85 rdf:type schema:CreativeWork
    86 sg:pub.10.1007/bfb0030363 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042487800
    87 https://doi.org/10.1007/bfb0030363
    88 rdf:type schema:CreativeWork
    89 sg:pub.10.1007/bfb0030364 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051754516
    90 https://doi.org/10.1007/bfb0030364
    91 rdf:type schema:CreativeWork
    92 https://doi.org/10.1080/0161-118491858746 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030743079
    93 rdf:type schema:CreativeWork
    94 https://www.grid.ac/institutes/grid.6451.6 schema:alternateName Technion – Israel Institute of Technology
    95 schema:name Computer Science Department, Technion—Israel Institute of Technology, 32000, Haifa, Israel
    96 rdf:type schema:Organization
     




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


    ...