Multiple Differential Cryptanalysis of Round-Reduced PRINCE View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2015-04-19

AUTHORS

Anne Canteaut , Thomas Fuhr , Henri Gilbert , María Naya-Plasencia , Jean-René Reinhard

ABSTRACT

PRINCE is a lightweight block cipher proposed by Borghoff et al. at Asiacrypt 2012. Due to its originality, novel design and low number of rounds, it has already attracted the attention of a large number of cryptanalysts. Several results on reduced versions have been published to date; the best one is an attack on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$8$$\end{document} rounds out of the total number of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$12$$\end{document}. In this paper we improve this result by two rounds: we provide an attack on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$10$$\end{document} rounds of the cipher with a data complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{57.94}$$\end{document} and a time complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{60.62}$$\end{document}, corresponding to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$118.56$$\end{document} security bits, instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$126$$\end{document} for the generic attacks. Our attack uses multiple differentials and exploits some properties of PRINCE for recovering the whole key. PRINCE is defined as a member of a family of ciphers, differing by the choice of an Sbox among a distinguished set. We also show that the security offered by all the members of the family is not equivalent, by identifying an Sbox for which our attack can be extended up to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$11$$\end{document} rounds with a data complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{59.81}$$\end{document} and a time complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{62.43}$$\end{document}. More... »

PAGES

591-610

Book

TITLE

Fast Software Encryption

ISBN

978-3-662-46705-3
978-3-662-46706-0

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-46706-0_30

DOI

http://dx.doi.org/10.1007/978-3-662-46706-0_30

DIMENSIONS

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


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/11", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Medical and Health Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1117", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Public Health and Health Services", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Inria, Rocquencourt, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Rocquencourt, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Canteaut", 
        "givenName": "Anne", 
        "id": "sg:person.012730266023.08", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012730266023.08"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ANSSI, Paris, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ANSSI, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fuhr", 
        "givenName": "Thomas", 
        "id": "sg:person.010445664364.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010445664364.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ANSSI, Paris, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ANSSI, Paris, 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"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Rocquencourt, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Rocquencourt, 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": "ANSSI, Paris, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ANSSI, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Reinhard", 
        "givenName": "Jean-Ren\u00e9", 
        "id": "sg:person.011071447265.99", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011071447265.99"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-04-19", 
    "datePublishedReg": "2015-04-19", 
    "description": "PRINCE is a lightweight block cipher proposed by Borghoff et al. at Asiacrypt 2012. Due to its originality, novel design and low number of rounds, it has already attracted the attention of a large number of cryptanalysts. Several results on reduced versions have been published to date; the best one is an attack on \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$8$$\\end{document}\u00a0rounds out of the total number of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$12$$\\end{document}. In this paper we improve this result by two rounds: we provide an attack on \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$10$$\\end{document} rounds of the cipher with a data complexity of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2^{57.94}$$\\end{document} and a time complexity of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2^{60.62}$$\\end{document}, corresponding to \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$118.56$$\\end{document}\u00a0security bits, instead of\u00a0\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$126$$\\end{document} for the generic attacks. Our attack uses multiple differentials and exploits some properties of PRINCE for recovering the whole key. PRINCE is defined as a member of a family of ciphers, differing by the choice of an Sbox among a distinguished set. We also show that the security offered by all the members of the family is not equivalent, by identifying an Sbox for which our attack can be extended up\u00a0to \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$11$$\\end{document} rounds with a data complexity of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2^{59.81}$$\\end{document} and a time complexity of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2^{62.43}$$\\end{document}.", 
    "editor": [
      {
        "familyName": "Cid", 
        "givenName": "Carlos", 
        "type": "Person"
      }, 
      {
        "familyName": "Rechberger", 
        "givenName": "Christian", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-46706-0_30", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-46705-3", 
        "978-3-662-46706-0"
      ], 
      "name": "Fast Software Encryption", 
      "type": "Book"
    }, 
    "keywords": [
      "total number", 
      "low number", 
      "rounds", 
      "multiple differentials", 
      "family", 
      "number", 
      "members", 
      "date", 
      "large number", 
      "results", 
      "attacks", 
      "differential", 
      "choice", 
      "attention", 
      "et al", 
      "version", 
      "reduced versions", 
      "Prince", 
      "design", 
      "complexity", 
      "one", 
      "key", 
      "best ones", 
      "properties", 
      "set", 
      "al", 
      "novel design", 
      "paper", 
      "differential cryptanalysis", 
      "originality", 
      "data complexity", 
      "security", 
      "bits", 
      "whole key", 
      "generic attacks", 
      "block cipher", 
      "distinguished set", 
      "lightweight block ciphers", 
      "cipher", 
      "cryptanalysis", 
      "Sboxes", 
      "cryptanalyst", 
      "time complexity", 
      "Asiacrypt 2012", 
      "security bits", 
      "family of ciphers", 
      "multiple differential cryptanalysis"
    ], 
    "name": "Multiple Differential Cryptanalysis of Round-Reduced PRINCE", 
    "pagination": "591-610", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1052589722"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-46706-0_30"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-46706-0_30", 
      "https://app.dimensions.ai/details/publication/pub.1052589722"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:16", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/chapter/chapter_459.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-46706-0_30"
  }
]
 

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/978-3-662-46706-0_30'

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-662-46706-0_30'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-46706-0_30'

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-662-46706-0_30'


 

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

142 TRIPLES      22 PREDICATES      71 URIs      64 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-46706-0_30 schema:about anzsrc-for:11
2 anzsrc-for:1117
3 schema:author N5e74de3ab4db47ada73c475724f0898d
4 schema:datePublished 2015-04-19
5 schema:datePublishedReg 2015-04-19
6 schema:description PRINCE is a lightweight block cipher proposed by Borghoff et al. at Asiacrypt 2012. Due to its originality, novel design and low number of rounds, it has already attracted the attention of a large number of cryptanalysts. Several results on reduced versions have been published to date; the best one is an attack on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$8$$\end{document} rounds out of the total number of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$12$$\end{document}. In this paper we improve this result by two rounds: we provide an attack on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$10$$\end{document} rounds of the cipher with a data complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{57.94}$$\end{document} and a time complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{60.62}$$\end{document}, corresponding to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$118.56$$\end{document} security bits, instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$126$$\end{document} for the generic attacks. Our attack uses multiple differentials and exploits some properties of PRINCE for recovering the whole key. PRINCE is defined as a member of a family of ciphers, differing by the choice of an Sbox among a distinguished set. We also show that the security offered by all the members of the family is not equivalent, by identifying an Sbox for which our attack can be extended up to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$11$$\end{document} rounds with a data complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{59.81}$$\end{document} and a time complexity of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{62.43}$$\end{document}.
7 schema:editor N66f4966f0d1d4cdfa1f188e770909702
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf Nbd3c78c70fff4cc69195038c68440173
11 schema:keywords Asiacrypt 2012
12 Prince
13 Sboxes
14 al
15 attacks
16 attention
17 best ones
18 bits
19 block cipher
20 choice
21 cipher
22 complexity
23 cryptanalysis
24 cryptanalyst
25 data complexity
26 date
27 design
28 differential
29 differential cryptanalysis
30 distinguished set
31 et al
32 family
33 family of ciphers
34 generic attacks
35 key
36 large number
37 lightweight block ciphers
38 low number
39 members
40 multiple differential cryptanalysis
41 multiple differentials
42 novel design
43 number
44 one
45 originality
46 paper
47 properties
48 reduced versions
49 results
50 rounds
51 security
52 security bits
53 set
54 time complexity
55 total number
56 version
57 whole key
58 schema:name Multiple Differential Cryptanalysis of Round-Reduced PRINCE
59 schema:pagination 591-610
60 schema:productId N60342f574edf422dbd723247da5ba224
61 Ne2e94645c7aa4024a0c47293cb076e3f
62 schema:publisher N5046ce6ac4354dbf818728872a8a357c
63 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052589722
64 https://doi.org/10.1007/978-3-662-46706-0_30
65 schema:sdDatePublished 2022-09-02T16:16
66 schema:sdLicense https://scigraph.springernature.com/explorer/license/
67 schema:sdPublisher N9e7cce7602214e2491bee1674e5dc5de
68 schema:url https://doi.org/10.1007/978-3-662-46706-0_30
69 sgo:license sg:explorer/license/
70 sgo:sdDataset chapters
71 rdf:type schema:Chapter
72 N0be1b2a6ecbb412a9236a99da6798e34 rdf:first sg:person.011071447265.99
73 rdf:rest rdf:nil
74 N0e52e484ee764c07850b3c4d2cf53bec schema:familyName Cid
75 schema:givenName Carlos
76 rdf:type schema:Person
77 N10675ea51daf4370aa0f6bb0647abd52 rdf:first sg:person.012771236207.08
78 rdf:rest N994c7ea9aa254ff4a61c3359bad054a8
79 N357e5e14876549cebf309a7fd2fc8bd4 schema:familyName Rechberger
80 schema:givenName Christian
81 rdf:type schema:Person
82 N5046ce6ac4354dbf818728872a8a357c schema:name Springer Nature
83 rdf:type schema:Organisation
84 N5e74de3ab4db47ada73c475724f0898d rdf:first sg:person.012730266023.08
85 rdf:rest Ndfff2e9a395c4693a3b2ddac4e9ef586
86 N60342f574edf422dbd723247da5ba224 schema:name doi
87 schema:value 10.1007/978-3-662-46706-0_30
88 rdf:type schema:PropertyValue
89 N66f4966f0d1d4cdfa1f188e770909702 rdf:first N0e52e484ee764c07850b3c4d2cf53bec
90 rdf:rest Naa152bb1b56a4aa195206e63d4af8060
91 N994c7ea9aa254ff4a61c3359bad054a8 rdf:first sg:person.013206304341.94
92 rdf:rest N0be1b2a6ecbb412a9236a99da6798e34
93 N9e7cce7602214e2491bee1674e5dc5de schema:name Springer Nature - SN SciGraph project
94 rdf:type schema:Organization
95 Naa152bb1b56a4aa195206e63d4af8060 rdf:first N357e5e14876549cebf309a7fd2fc8bd4
96 rdf:rest rdf:nil
97 Nbd3c78c70fff4cc69195038c68440173 schema:isbn 978-3-662-46705-3
98 978-3-662-46706-0
99 schema:name Fast Software Encryption
100 rdf:type schema:Book
101 Ndfff2e9a395c4693a3b2ddac4e9ef586 rdf:first sg:person.010445664364.38
102 rdf:rest N10675ea51daf4370aa0f6bb0647abd52
103 Ne2e94645c7aa4024a0c47293cb076e3f schema:name dimensions_id
104 schema:value pub.1052589722
105 rdf:type schema:PropertyValue
106 anzsrc-for:11 schema:inDefinedTermSet anzsrc-for:
107 schema:name Medical and Health Sciences
108 rdf:type schema:DefinedTerm
109 anzsrc-for:1117 schema:inDefinedTermSet anzsrc-for:
110 schema:name Public Health and Health Services
111 rdf:type schema:DefinedTerm
112 sg:person.010445664364.38 schema:affiliation grid-institutes:None
113 schema:familyName Fuhr
114 schema:givenName Thomas
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010445664364.38
116 rdf:type schema:Person
117 sg:person.011071447265.99 schema:affiliation grid-institutes:None
118 schema:familyName Reinhard
119 schema:givenName Jean-René
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011071447265.99
121 rdf:type schema:Person
122 sg:person.012730266023.08 schema:affiliation grid-institutes:grid.5328.c
123 schema:familyName Canteaut
124 schema:givenName Anne
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012730266023.08
126 rdf:type schema:Person
127 sg:person.012771236207.08 schema:affiliation grid-institutes:None
128 schema:familyName Gilbert
129 schema:givenName Henri
130 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012771236207.08
131 rdf:type schema:Person
132 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.5328.c
133 schema:familyName Naya-Plasencia
134 schema:givenName María
135 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
136 rdf:type schema:Person
137 grid-institutes:None schema:alternateName ANSSI, Paris, France
138 schema:name ANSSI, Paris, France
139 rdf:type schema:Organization
140 grid-institutes:grid.5328.c schema:alternateName Inria, Rocquencourt, France
141 schema:name Inria, Rocquencourt, France
142 rdf:type schema:Organization
 




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


...