Security Analysis of Key-Alternating Feistel Ciphers View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2015-04-19

AUTHORS

Rodolphe Lampe , Yannick Seurin

ABSTRACT

We study the security of key-alternating Feistel ciphers, a class of key-alternating ciphers with a Feistel structure. Alternatively, this may be viewed as the study of Feistel ciphers where the pseudorandom round functions are of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_i(x\oplus k_i)$$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k_i$$\end{document} is the (secret) round key and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_i$$\end{document} is a public random function that the adversary is allowed to query in a black-box way. Interestingly, our results can be seen as a generalization of traditional results à la Luby-Rackoff in the sense that we can derive results for this model by simply letting the number of queries of the adversary to the public random functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_i$$\end{document} be zero in our general bounds. We make an extensive use of the coupling technique. In particular (and as a result of independent interest), we improve the analysis of the coupling probability for balanced Feistel schemes previously carried out by Hoang and Rogaway (CRYPTO 2010). More... »

PAGES

243-264

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_13

DOI

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

DIMENSIONS

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


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Versailles, Versailles, France", 
          "id": "http://www.grid.ac/institutes/grid.12832.3a", 
          "name": [
            "University of Versailles, Versailles, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lampe", 
        "givenName": "Rodolphe", 
        "id": "sg:person.013502647333.10", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013502647333.10"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ANSSI, Paris, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ANSSI, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Seurin", 
        "givenName": "Yannick", 
        "id": "sg:person.011724731171.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-04-19", 
    "datePublishedReg": "2015-04-19", 
    "description": "We study the security of key-alternating Feistel ciphers, a class of key-alternating ciphers with a Feistel structure. Alternatively, this may be viewed as the study of Feistel ciphers where the pseudorandom round functions are of the form \\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}$$F_i(x\\oplus k_i)$$\\end{document}, where \\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}$$k_i$$\\end{document} is the (secret) round key and \\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}$$F_i$$\\end{document} is a public random function that the adversary is allowed to query in a black-box way. Interestingly, our results can be seen as a generalization of traditional results \u00e0 la Luby-Rackoff in the sense that we can derive results for this model by simply letting the number of queries of the adversary to the public random functions \\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}$$F_i$$\\end{document} be zero in our general bounds. We make an extensive use of the coupling technique. In particular (and as a result of independent interest), we improve the analysis of the coupling probability for balanced Feistel schemes previously carried out by Hoang and Rogaway (CRYPTO 2010).", 
    "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_13", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-46705-3", 
        "978-3-662-46706-0"
      ], 
      "name": "Fast Software Encryption", 
      "type": "Book"
    }, 
    "keywords": [
      "public random function", 
      "number of queries", 
      "black-box way", 
      "security analysis", 
      "Feistel ciphers", 
      "cipher", 
      "key-alternating ciphers", 
      "Feistel structure", 
      "round function", 
      "round keys", 
      "adversary", 
      "random function", 
      "Feistel schemes", 
      "security", 
      "key", 
      "queries", 
      "extensive use", 
      "Rogaway", 
      "scheme", 
      "Hoang", 
      "way", 
      "generalization", 
      "model", 
      "general bounds", 
      "bounds", 
      "technique", 
      "class", 
      "function", 
      "results", 
      "sense", 
      "number", 
      "use", 
      "analysis", 
      "probability", 
      "structure", 
      "form", 
      "coupling technique", 
      "coupling probability", 
      "study"
    ], 
    "name": "Security Analysis of Key-Alternating Feistel Ciphers", 
    "pagination": "243-264", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1031646199"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-46706-0_13"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-46706-0_13", 
      "https://app.dimensions.ai/details/publication/pub.1031646199"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-12-01T06:51", 
    "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_338.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-46706-0_13"
  }
]
 

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_13'

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_13'

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_13'

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_13'


 

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

113 TRIPLES      22 PREDICATES      63 URIs      56 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-46706-0_13 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Na067ab41322a442e95514477291fd45b
4 schema:datePublished 2015-04-19
5 schema:datePublishedReg 2015-04-19
6 schema:description We study the security of key-alternating Feistel ciphers, a class of key-alternating ciphers with a Feistel structure. Alternatively, this may be viewed as the study of Feistel ciphers where the pseudorandom round functions are of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_i(x\oplus k_i)$$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k_i$$\end{document} is the (secret) round key and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_i$$\end{document} is a public random function that the adversary is allowed to query in a black-box way. Interestingly, our results can be seen as a generalization of traditional results à la Luby-Rackoff in the sense that we can derive results for this model by simply letting the number of queries of the adversary to the public random functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_i$$\end{document} be zero in our general bounds. We make an extensive use of the coupling technique. In particular (and as a result of independent interest), we improve the analysis of the coupling probability for balanced Feistel schemes previously carried out by Hoang and Rogaway (CRYPTO 2010).
7 schema:editor N82d39081f5fd4517a3ca1324561ef948
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N64fb42e909c649c594b05ff0c3c41e91
11 schema:keywords Feistel ciphers
12 Feistel schemes
13 Feistel structure
14 Hoang
15 Rogaway
16 adversary
17 analysis
18 black-box way
19 bounds
20 cipher
21 class
22 coupling probability
23 coupling technique
24 extensive use
25 form
26 function
27 general bounds
28 generalization
29 key
30 key-alternating ciphers
31 model
32 number
33 number of queries
34 probability
35 public random function
36 queries
37 random function
38 results
39 round function
40 round keys
41 scheme
42 security
43 security analysis
44 sense
45 structure
46 study
47 technique
48 use
49 way
50 schema:name Security Analysis of Key-Alternating Feistel Ciphers
51 schema:pagination 243-264
52 schema:productId N82d461dc3f864908ace7f6c5bf7b2abe
53 N9957303a045141cd91d8b1e6f01a2198
54 schema:publisher Nf7537988768947158eed92aeb778cd41
55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031646199
56 https://doi.org/10.1007/978-3-662-46706-0_13
57 schema:sdDatePublished 2022-12-01T06:51
58 schema:sdLicense https://scigraph.springernature.com/explorer/license/
59 schema:sdPublisher N65d835d14e244101a4b0ea7ae9769428
60 schema:url https://doi.org/10.1007/978-3-662-46706-0_13
61 sgo:license sg:explorer/license/
62 sgo:sdDataset chapters
63 rdf:type schema:Chapter
64 N64fb42e909c649c594b05ff0c3c41e91 schema:isbn 978-3-662-46705-3
65 978-3-662-46706-0
66 schema:name Fast Software Encryption
67 rdf:type schema:Book
68 N65d835d14e244101a4b0ea7ae9769428 schema:name Springer Nature - SN SciGraph project
69 rdf:type schema:Organization
70 N8120df4b763a4e58b4b96543ab903d74 schema:familyName Cid
71 schema:givenName Carlos
72 rdf:type schema:Person
73 N82d39081f5fd4517a3ca1324561ef948 rdf:first N8120df4b763a4e58b4b96543ab903d74
74 rdf:rest Nb243dfc86df849679bc0985bd15abd9f
75 N82d461dc3f864908ace7f6c5bf7b2abe schema:name doi
76 schema:value 10.1007/978-3-662-46706-0_13
77 rdf:type schema:PropertyValue
78 N9957303a045141cd91d8b1e6f01a2198 schema:name dimensions_id
79 schema:value pub.1031646199
80 rdf:type schema:PropertyValue
81 Na067ab41322a442e95514477291fd45b rdf:first sg:person.013502647333.10
82 rdf:rest Nc153bc75365f4783b230130077ed2c07
83 Nb243dfc86df849679bc0985bd15abd9f rdf:first Ned1370aa8f154f089d422a129ae55fed
84 rdf:rest rdf:nil
85 Nc153bc75365f4783b230130077ed2c07 rdf:first sg:person.011724731171.01
86 rdf:rest rdf:nil
87 Ned1370aa8f154f089d422a129ae55fed schema:familyName Rechberger
88 schema:givenName Christian
89 rdf:type schema:Person
90 Nf7537988768947158eed92aeb778cd41 schema:name Springer Nature
91 rdf:type schema:Organisation
92 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
93 schema:name Information and Computing Sciences
94 rdf:type schema:DefinedTerm
95 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
96 schema:name Data Format
97 rdf:type schema:DefinedTerm
98 sg:person.011724731171.01 schema:affiliation grid-institutes:None
99 schema:familyName Seurin
100 schema:givenName Yannick
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01
102 rdf:type schema:Person
103 sg:person.013502647333.10 schema:affiliation grid-institutes:grid.12832.3a
104 schema:familyName Lampe
105 schema:givenName Rodolphe
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013502647333.10
107 rdf:type schema:Person
108 grid-institutes:None schema:alternateName ANSSI, Paris, France
109 schema:name ANSSI, Paris, France
110 rdf:type schema:Organization
111 grid-institutes:grid.12832.3a schema:alternateName University of Versailles, Versailles, France
112 schema:name University of Versailles, Versailles, France
113 rdf:type schema:Organization
 




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


...