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-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_391.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 N0971123798254ffab745788dffbe5112
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 Nab59d9dbdf4148c3998d7e2572f46466
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N53b476de4c92409f91521e1801b2a3d3
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 N732cf04c7a5a4993ab9acedb12757370
61 Ne6e6fac544b44940af4a10780cdfc9d0
62 schema:publisher Na94f5cdbdf114175b8154805ad10cfd4
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-12-01T06:52
66 schema:sdLicense https://scigraph.springernature.com/explorer/license/
67 schema:sdPublisher N88fef87eaa084157b2dcf22653a5d6c7
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 N0971123798254ffab745788dffbe5112 rdf:first sg:person.012730266023.08
73 rdf:rest Nff26e19711434c189b5a9a4424c07d72
74 N35a4ef0f0cbd411489d6b06840494060 rdf:first sg:person.012771236207.08
75 rdf:rest N47fcd9fc55444823b1f2cd57d47c0af7
76 N3a510a69d35c4815a9d4cd29028fdd7e rdf:first sg:person.011071447265.99
77 rdf:rest rdf:nil
78 N47fcd9fc55444823b1f2cd57d47c0af7 rdf:first sg:person.013206304341.94
79 rdf:rest N3a510a69d35c4815a9d4cd29028fdd7e
80 N53b476de4c92409f91521e1801b2a3d3 schema:isbn 978-3-662-46705-3
81 978-3-662-46706-0
82 schema:name Fast Software Encryption
83 rdf:type schema:Book
84 N732cf04c7a5a4993ab9acedb12757370 schema:name doi
85 schema:value 10.1007/978-3-662-46706-0_30
86 rdf:type schema:PropertyValue
87 N88fef87eaa084157b2dcf22653a5d6c7 schema:name Springer Nature - SN SciGraph project
88 rdf:type schema:Organization
89 Na94f5cdbdf114175b8154805ad10cfd4 schema:name Springer Nature
90 rdf:type schema:Organisation
91 Nab59d9dbdf4148c3998d7e2572f46466 rdf:first Nc0d6749b606b4bf2a23219918f0ae66c
92 rdf:rest Ncadc731218e14b9ebad2bd6c130d1670
93 Nc0d6749b606b4bf2a23219918f0ae66c schema:familyName Cid
94 schema:givenName Carlos
95 rdf:type schema:Person
96 Ncadc731218e14b9ebad2bd6c130d1670 rdf:first Necd491befb36437c862b66563d2cb2be
97 rdf:rest rdf:nil
98 Ne6e6fac544b44940af4a10780cdfc9d0 schema:name dimensions_id
99 schema:value pub.1052589722
100 rdf:type schema:PropertyValue
101 Necd491befb36437c862b66563d2cb2be schema:familyName Rechberger
102 schema:givenName Christian
103 rdf:type schema:Person
104 Nff26e19711434c189b5a9a4424c07d72 rdf:first sg:person.010445664364.38
105 rdf:rest N35a4ef0f0cbd411489d6b06840494060
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)


...