Improved Cryptanalysis of AES-like Permutations View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2013-07-17

AUTHORS

Jérémy Jean, María Naya-Plasencia, Thomas Peyrin

ABSTRACT

AES-based functions have attracted of a lot of analysis in the recent years, mainly due to the SHA-3 hash function competition. In particular, the rebound attack allowed to break several proposals and many improvements/variants of this method have been published. Yet, it remained an open question whether it was possible to reach one more round with this type of technique compared to the state-of-the-art. In this article, we close this open problem by providing a further improvement over the original rebound attack and its variants, that allows the attacker to control one more round in the middle of a differential path for an AES-like permutation. Our algorithm is based on lists merging as defined in (Naya-Plasencia in Advances in Cryptology: CRYPTO 2011, pp. 188–205, 2011) and we generalized the concept to non-full active truncated differential paths (Sasaki et al. in Lecture Notes in Computer Science, pp. 38–55, 2010).As an illustration, we applied our method to the internal permutations used in Grøstl, one of the five finalist hash functions of the SHA-3 competition. When entering this final phase, the designers tweaked the function so as to thwart attacks from Peyrin (Peyrin in Lecture Notes in Computer Science, pp. 370–392, 2010) that exploited relations between the internal permutations. Until our results, no analysis was published on Grøstl and the best results reached 8 and 7 rounds for the 256-bit and 512-bit versions, respectively. By applying our algorithm, we present new internal permutation distinguishers on 9 and 10 rounds, respectively. More... »

PAGES

772-798

References to SciGraph publications

  • 2009. The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl in FAST SOFTWARE ENCRYPTION
  • 2010. Improved Differential Attacks for ECHO and Grøstl in ADVANCES IN CRYPTOLOGY – CRYPTO 2010
  • 2012. Improved Analysis of ECHO-256 in SELECTED AREAS IN CRYPTOGRAPHY
  • 2005. How to Break MD5 and Other Hash Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2011. Whirlpool in ENCYCLOPEDIA OF CRYPTOGRAPHY AND SECURITY
  • 2011. How to Improve Rebound Attacks in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2007. Cryptanalysis of Grindahl in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2007
  • 2011. Known and Chosen Key Differential Distinguishers for Block Ciphers in INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2010
  • 2010. Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations in FAST SOFTWARE ENCRYPTION
  • 2011. The PHOTON Family of Lightweight Hash Functions in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2005. Finding Collisions in the Full SHA-1 in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 2011. Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function in FAST SOFTWARE ENCRYPTION
  • 2009. Improved Cryptanalysis of the Reduced Grøstl Compression Function, ECHO Permutation and AES Block Cipher in SELECTED AREAS IN CRYPTOGRAPHY
  • 2010. Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010
  • 2009. Rebound Attack on the Full Lane Compression Function in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 2012. Improved Rebound Attack on the Finalist Grøstl in FAST SOFTWARE ENCRYPTION
  • 2010. Rebound Attacks on the Reduced Grøstl Hash Function in TOPICS IN CRYPTOLOGY - CT-RSA 2010
  • 2009. Rebound Distinguishers: Results on the Full Whirlpool Compression Function in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 1995. Truncated and higher order differentials in FAST SOFTWARE ENCRYPTION
  • 2011. Higher-Order Differential Properties of Keccak and Luffa in FAST SOFTWARE ENCRYPTION
  • 2011. The LED Block Cipher in CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS – CHES 2011
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00145-013-9156-7

    DOI

    http://dx.doi.org/10.1007/s00145-013-9156-7

    DIMENSIONS

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


    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/01", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Mathematical Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Pure Mathematics", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "\u00c9cole Normale Sup\u00e9rieure, Paris, France", 
              "id": "http://www.grid.ac/institutes/grid.5607.4", 
              "name": [
                "\u00c9cole Normale Sup\u00e9rieure, Paris, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Jean", 
            "givenName": "J\u00e9r\u00e9my", 
            "id": "sg:person.014232271321.52", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014232271321.52"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "INRIA Paris-Rocquencourt, Paris, France", 
              "id": "http://www.grid.ac/institutes/grid.5328.c", 
              "name": [
                "INRIA Paris-Rocquencourt, Paris, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Naya-Plasencia", 
            "givenName": "Mar\u00eda", 
            "id": "sg:person.013206304341.94", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Nanyang Technological University, Singapore, Singapore", 
              "id": "http://www.grid.ac/institutes/grid.59025.3b", 
              "name": [
                "Nanyang Technological University, Singapore, Singapore"
              ], 
              "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"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-642-23951-9_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018695446", 
              "https://doi.org/10.1007/978-3-642-23951-9_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-14623-7_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014932648", 
              "https://doi.org/10.1007/978-3-642-14623-7_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-60590-8_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018329205", 
              "https://doi.org/10.1007/3-540-60590-8_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-17373-8_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002094508", 
              "https://doi.org/10.1007/978-3-642-17373-8_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11535218_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002819603", 
              "https://doi.org/10.1007/11535218_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-13858-4_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003313281", 
              "https://doi.org/10.1007/978-3-642-13858-4_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-76900-2_34", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027379152", 
              "https://doi.org/10.1007/978-3-540-76900-2_34"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-05445-7_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028766519", 
              "https://doi.org/10.1007/978-3-642-05445-7_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-21702-9_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045624330", 
              "https://doi.org/10.1007/978-3-642-21702-9_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-11925-5_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042102975", 
              "https://doi.org/10.1007/978-3-642-11925-5_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03317-9_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008871290", 
              "https://doi.org/10.1007/978-3-642-03317-9_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-22792-9_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001341652", 
              "https://doi.org/10.1007/978-3-642-22792-9_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-10366-7_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052635964", 
              "https://doi.org/10.1007/978-3-642-10366-7_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-21702-9_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002263742", 
              "https://doi.org/10.1007/978-3-642-21702-9_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11426639_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043264875", 
              "https://doi.org/10.1007/11426639_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4419-5906-5_626", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031813455", 
              "https://doi.org/10.1007/978-1-4419-5906-5_626"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-24209-0_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010581078", 
              "https://doi.org/10.1007/978-3-642-24209-0_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-34047-5_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038127469", 
              "https://doi.org/10.1007/978-3-642-34047-5_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-28496-0_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000169108", 
              "https://doi.org/10.1007/978-3-642-28496-0_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-22792-9_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016551572", 
              "https://doi.org/10.1007/978-3-642-22792-9_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-10366-7_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030176070", 
              "https://doi.org/10.1007/978-3-642-10366-7_7"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2013-07-17", 
        "datePublishedReg": "2013-07-17", 
        "description": "AES-based functions have attracted of a lot of analysis in the recent years, mainly due to the SHA-3 hash function competition. In particular, the rebound attack allowed to break several proposals and many improvements/variants of this method have been published. Yet, it remained an open question whether it was possible to reach one more round with this type of technique compared to the state-of-the-art. In this article, we close this open problem by providing a further improvement over the original rebound attack and its variants, that allows the attacker to control one more round in the middle of a differential path for an AES-like permutation. Our algorithm is based on lists merging as defined in (Naya-Plasencia in Advances in Cryptology: CRYPTO 2011, pp.\u00a0188\u2013205, 2011) and we generalized the concept to non-full active truncated differential paths\u00a0(Sasaki et al. in Lecture Notes in Computer Science, pp.\u00a038\u201355, 2010).As an illustration, we applied our method to the internal permutations used in Gr\u00f8stl, one of the five finalist hash functions of the SHA-3 competition. When entering this final phase, the designers tweaked the function so as to thwart attacks from Peyrin\u00a0(Peyrin in Lecture Notes in Computer Science, pp.\u00a0370\u2013392, 2010) that exploited relations between the internal permutations. Until our results, no analysis was published on Gr\u00f8stl and the best results reached 8 and 7 rounds for the 256-bit and 512-bit versions, respectively. By applying our algorithm, we present new internal permutation distinguishers on 9 and 10 rounds, respectively.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s00145-013-9156-7", 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136278", 
            "issn": [
              "0933-2790", 
              "1432-1378"
            ], 
            "name": "Journal of Cryptology", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "4", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "27"
          }
        ], 
        "keywords": [
          "AES-like permutations", 
          "open problem", 
          "permutations", 
          "algorithm", 
          "open question", 
          "types of techniques", 
          "differential path", 
          "function", 
          "hash function", 
          "path", 
          "internal permutation", 
          "problem", 
          "better results", 
          "illustration", 
          "rebound attack", 
          "SHA-3 competition", 
          "version", 
          "further improvement", 
          "more rounds", 
          "results", 
          "cryptanalysis", 
          "distinguisher", 
          "technique", 
          "recent years", 
          "analysis", 
          "state", 
          "attacker", 
          "concept", 
          "variants", 
          "designers", 
          "relation", 
          "attacks", 
          "proposal", 
          "phase", 
          "types", 
          "rounds", 
          "art", 
          "article", 
          "questions", 
          "Gr\u00f8stl", 
          "competition", 
          "improvement", 
          "final phase", 
          "AES", 
          "list", 
          "middle", 
          "years", 
          "method", 
          "Peyrin"
        ], 
        "name": "Improved Cryptanalysis of AES-like Permutations", 
        "pagination": "772-798", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1046537059"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00145-013-9156-7"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00145-013-9156-7", 
          "https://app.dimensions.ai/details/publication/pub.1046537059"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-10-01T06:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221001/entities/gbq_results/article/article_606.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s00145-013-9156-7"
      }
    ]
     

    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/s00145-013-9156-7'

    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/s00145-013-9156-7'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00145-013-9156-7'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00145-013-9156-7'


     

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

    210 TRIPLES      21 PREDICATES      93 URIs      64 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00145-013-9156-7 schema:about anzsrc-for:01
    2 anzsrc-for:0101
    3 schema:author N6f14126171674fb2a54ceebb9b01fdb6
    4 schema:citation sg:pub.10.1007/11426639_2
    5 sg:pub.10.1007/11535218_2
    6 sg:pub.10.1007/3-540-60590-8_16
    7 sg:pub.10.1007/978-1-4419-5906-5_626
    8 sg:pub.10.1007/978-3-540-76900-2_34
    9 sg:pub.10.1007/978-3-642-03317-9_16
    10 sg:pub.10.1007/978-3-642-05445-7_2
    11 sg:pub.10.1007/978-3-642-10366-7_7
    12 sg:pub.10.1007/978-3-642-10366-7_8
    13 sg:pub.10.1007/978-3-642-11925-5_24
    14 sg:pub.10.1007/978-3-642-13858-4_21
    15 sg:pub.10.1007/978-3-642-14623-7_20
    16 sg:pub.10.1007/978-3-642-17373-8_3
    17 sg:pub.10.1007/978-3-642-21702-9_15
    18 sg:pub.10.1007/978-3-642-21702-9_7
    19 sg:pub.10.1007/978-3-642-22792-9_11
    20 sg:pub.10.1007/978-3-642-22792-9_13
    21 sg:pub.10.1007/978-3-642-23951-9_22
    22 sg:pub.10.1007/978-3-642-24209-0_3
    23 sg:pub.10.1007/978-3-642-28496-0_2
    24 sg:pub.10.1007/978-3-642-34047-5_7
    25 schema:datePublished 2013-07-17
    26 schema:datePublishedReg 2013-07-17
    27 schema:description AES-based functions have attracted of a lot of analysis in the recent years, mainly due to the SHA-3 hash function competition. In particular, the rebound attack allowed to break several proposals and many improvements/variants of this method have been published. Yet, it remained an open question whether it was possible to reach one more round with this type of technique compared to the state-of-the-art. In this article, we close this open problem by providing a further improvement over the original rebound attack and its variants, that allows the attacker to control one more round in the middle of a differential path for an AES-like permutation. Our algorithm is based on lists merging as defined in (Naya-Plasencia in Advances in Cryptology: CRYPTO 2011, pp. 188–205, 2011) and we generalized the concept to non-full active truncated differential paths (Sasaki et al. in Lecture Notes in Computer Science, pp. 38–55, 2010).As an illustration, we applied our method to the internal permutations used in Grøstl, one of the five finalist hash functions of the SHA-3 competition. When entering this final phase, the designers tweaked the function so as to thwart attacks from Peyrin (Peyrin in Lecture Notes in Computer Science, pp. 370–392, 2010) that exploited relations between the internal permutations. Until our results, no analysis was published on Grøstl and the best results reached 8 and 7 rounds for the 256-bit and 512-bit versions, respectively. By applying our algorithm, we present new internal permutation distinguishers on 9 and 10 rounds, respectively.
    28 schema:genre article
    29 schema:isAccessibleForFree false
    30 schema:isPartOf N0fb3abd4e6434b0f925e680b3e7c8f0e
    31 N5365f174653941d9af61e5e7d0229d0d
    32 sg:journal.1136278
    33 schema:keywords AES
    34 AES-like permutations
    35 Grøstl
    36 Peyrin
    37 SHA-3 competition
    38 algorithm
    39 analysis
    40 art
    41 article
    42 attacker
    43 attacks
    44 better results
    45 competition
    46 concept
    47 cryptanalysis
    48 designers
    49 differential path
    50 distinguisher
    51 final phase
    52 function
    53 further improvement
    54 hash function
    55 illustration
    56 improvement
    57 internal permutation
    58 list
    59 method
    60 middle
    61 more rounds
    62 open problem
    63 open question
    64 path
    65 permutations
    66 phase
    67 problem
    68 proposal
    69 questions
    70 rebound attack
    71 recent years
    72 relation
    73 results
    74 rounds
    75 state
    76 technique
    77 types
    78 types of techniques
    79 variants
    80 version
    81 years
    82 schema:name Improved Cryptanalysis of AES-like Permutations
    83 schema:pagination 772-798
    84 schema:productId N45740ca8123c4c3a85ee62548bb296a1
    85 Ndd37b130ed5943c2931707b4fffa5577
    86 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046537059
    87 https://doi.org/10.1007/s00145-013-9156-7
    88 schema:sdDatePublished 2022-10-01T06:38
    89 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    90 schema:sdPublisher Ncf40293deb114997ad553fa851d0c1d1
    91 schema:url https://doi.org/10.1007/s00145-013-9156-7
    92 sgo:license sg:explorer/license/
    93 sgo:sdDataset articles
    94 rdf:type schema:ScholarlyArticle
    95 N0fb3abd4e6434b0f925e680b3e7c8f0e schema:volumeNumber 27
    96 rdf:type schema:PublicationVolume
    97 N45740ca8123c4c3a85ee62548bb296a1 schema:name dimensions_id
    98 schema:value pub.1046537059
    99 rdf:type schema:PropertyValue
    100 N5365f174653941d9af61e5e7d0229d0d schema:issueNumber 4
    101 rdf:type schema:PublicationIssue
    102 N6da391abae744be2b86b0b8d3d8cfdce rdf:first sg:person.013206304341.94
    103 rdf:rest Nf39e42528339456d85786c00ce0ac958
    104 N6f14126171674fb2a54ceebb9b01fdb6 rdf:first sg:person.014232271321.52
    105 rdf:rest N6da391abae744be2b86b0b8d3d8cfdce
    106 Ncf40293deb114997ad553fa851d0c1d1 schema:name Springer Nature - SN SciGraph project
    107 rdf:type schema:Organization
    108 Ndd37b130ed5943c2931707b4fffa5577 schema:name doi
    109 schema:value 10.1007/s00145-013-9156-7
    110 rdf:type schema:PropertyValue
    111 Nf39e42528339456d85786c00ce0ac958 rdf:first sg:person.011167161615.31
    112 rdf:rest rdf:nil
    113 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
    114 schema:name Mathematical Sciences
    115 rdf:type schema:DefinedTerm
    116 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
    117 schema:name Pure Mathematics
    118 rdf:type schema:DefinedTerm
    119 sg:journal.1136278 schema:issn 0933-2790
    120 1432-1378
    121 schema:name Journal of Cryptology
    122 schema:publisher Springer Nature
    123 rdf:type schema:Periodical
    124 sg:person.011167161615.31 schema:affiliation grid-institutes:grid.59025.3b
    125 schema:familyName Peyrin
    126 schema:givenName Thomas
    127 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011167161615.31
    128 rdf:type schema:Person
    129 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.5328.c
    130 schema:familyName Naya-Plasencia
    131 schema:givenName María
    132 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
    133 rdf:type schema:Person
    134 sg:person.014232271321.52 schema:affiliation grid-institutes:grid.5607.4
    135 schema:familyName Jean
    136 schema:givenName Jérémy
    137 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014232271321.52
    138 rdf:type schema:Person
    139 sg:pub.10.1007/11426639_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043264875
    140 https://doi.org/10.1007/11426639_2
    141 rdf:type schema:CreativeWork
    142 sg:pub.10.1007/11535218_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002819603
    143 https://doi.org/10.1007/11535218_2
    144 rdf:type schema:CreativeWork
    145 sg:pub.10.1007/3-540-60590-8_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018329205
    146 https://doi.org/10.1007/3-540-60590-8_16
    147 rdf:type schema:CreativeWork
    148 sg:pub.10.1007/978-1-4419-5906-5_626 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031813455
    149 https://doi.org/10.1007/978-1-4419-5906-5_626
    150 rdf:type schema:CreativeWork
    151 sg:pub.10.1007/978-3-540-76900-2_34 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027379152
    152 https://doi.org/10.1007/978-3-540-76900-2_34
    153 rdf:type schema:CreativeWork
    154 sg:pub.10.1007/978-3-642-03317-9_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008871290
    155 https://doi.org/10.1007/978-3-642-03317-9_16
    156 rdf:type schema:CreativeWork
    157 sg:pub.10.1007/978-3-642-05445-7_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028766519
    158 https://doi.org/10.1007/978-3-642-05445-7_2
    159 rdf:type schema:CreativeWork
    160 sg:pub.10.1007/978-3-642-10366-7_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030176070
    161 https://doi.org/10.1007/978-3-642-10366-7_7
    162 rdf:type schema:CreativeWork
    163 sg:pub.10.1007/978-3-642-10366-7_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052635964
    164 https://doi.org/10.1007/978-3-642-10366-7_8
    165 rdf:type schema:CreativeWork
    166 sg:pub.10.1007/978-3-642-11925-5_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042102975
    167 https://doi.org/10.1007/978-3-642-11925-5_24
    168 rdf:type schema:CreativeWork
    169 sg:pub.10.1007/978-3-642-13858-4_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003313281
    170 https://doi.org/10.1007/978-3-642-13858-4_21
    171 rdf:type schema:CreativeWork
    172 sg:pub.10.1007/978-3-642-14623-7_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014932648
    173 https://doi.org/10.1007/978-3-642-14623-7_20
    174 rdf:type schema:CreativeWork
    175 sg:pub.10.1007/978-3-642-17373-8_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002094508
    176 https://doi.org/10.1007/978-3-642-17373-8_3
    177 rdf:type schema:CreativeWork
    178 sg:pub.10.1007/978-3-642-21702-9_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002263742
    179 https://doi.org/10.1007/978-3-642-21702-9_15
    180 rdf:type schema:CreativeWork
    181 sg:pub.10.1007/978-3-642-21702-9_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045624330
    182 https://doi.org/10.1007/978-3-642-21702-9_7
    183 rdf:type schema:CreativeWork
    184 sg:pub.10.1007/978-3-642-22792-9_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001341652
    185 https://doi.org/10.1007/978-3-642-22792-9_11
    186 rdf:type schema:CreativeWork
    187 sg:pub.10.1007/978-3-642-22792-9_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016551572
    188 https://doi.org/10.1007/978-3-642-22792-9_13
    189 rdf:type schema:CreativeWork
    190 sg:pub.10.1007/978-3-642-23951-9_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018695446
    191 https://doi.org/10.1007/978-3-642-23951-9_22
    192 rdf:type schema:CreativeWork
    193 sg:pub.10.1007/978-3-642-24209-0_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010581078
    194 https://doi.org/10.1007/978-3-642-24209-0_3
    195 rdf:type schema:CreativeWork
    196 sg:pub.10.1007/978-3-642-28496-0_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000169108
    197 https://doi.org/10.1007/978-3-642-28496-0_2
    198 rdf:type schema:CreativeWork
    199 sg:pub.10.1007/978-3-642-34047-5_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038127469
    200 https://doi.org/10.1007/978-3-642-34047-5_7
    201 rdf:type schema:CreativeWork
    202 grid-institutes:grid.5328.c schema:alternateName INRIA Paris-Rocquencourt, Paris, France
    203 schema:name INRIA Paris-Rocquencourt, Paris, France
    204 rdf:type schema:Organization
    205 grid-institutes:grid.5607.4 schema:alternateName École Normale Supérieure, Paris, France
    206 schema:name École Normale Supérieure, Paris, France
    207 rdf:type schema:Organization
    208 grid-institutes:grid.59025.3b schema:alternateName Nanyang Technological University, Singapore, Singapore
    209 schema:name Nanyang Technological University, Singapore, Singapore
    210 rdf:type schema:Organization
     




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


    ...