Hardware Framework for the Rabbit Stream Cipher View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2010

AUTHORS

Deian Stefan

ABSTRACT

Rabbit is a software-oriented synchronous stream cipher with very strong security properties and support for 128-bit keys. Rabbit is part of the European Union’s eSTREAM portfolio of stream ciphers addressing the need for strong and computationally efficient (i.e., fast) ciphers. Extensive cryptanalysis confirms Rabbit’s strength against modern attacks; attacks with complexity lower than an exhaustive key search have not been found. Previous software implementations have demonstrated Rabbit’s high throughput, however, the performance in hardware has only been estimated. Three reconfigurable hardware designs of the Rabbit stream cipher – direct, interleaved and generalized folded structure (GFS) – are presented. On the Xilinx Virtex-5 LXT FPGA, a direct, resource-efficient (568 slices) implementation delivers throughputs of up to 9.16 Gbits/s, a 4-slow interleaved design reaches 25.62 Gbits/s using 1163 slices, and a 3-slow 8-GFS implementations delivers throughputs of up to 3.46 Gbits/s using only 233 slices. More... »

PAGES

230-247

References to SciGraph publications

  • 2003. Rabbit: A New High-Performance Stream Cipher in FAST SOFTWARE ENCRYPTION
  • 2008. Implementation of the AES-128 on Virtex-5 FPGAs in PROGRESS IN CRYPTOLOGY – AFRICACRYPT 2008
  • 2008. The Rabbit Stream Cipher in NEW STREAM CIPHER DESIGNS
  • 2008. Cryptanalysis of Rabbit in INFORMATION SECURITY
  • 2003. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback in ADVANCES IN CRYPTOLOGY - CRYPTO 2003
  • Book

    TITLE

    Information Security and Cryptology

    ISBN

    978-3-642-16341-8
    978-3-642-16342-5

    Author Affiliations

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-642-16342-5_17

    DOI

    http://dx.doi.org/10.1007/978-3-642-16342-5_17

    DIMENSIONS

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


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

    JSON-LD is the canonical representation for SciGraph data.

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

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Cooper Union", 
              "id": "https://www.grid.ac/institutes/grid.254672.0", 
              "name": [
                "S*ProCom2, Dept. of Electrical Engineering, The Cooper Union, 10003, New York, NY, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Stefan", 
            "givenName": "Deian", 
            "id": "sg:person.012620432773.74", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012620432773.74"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-45146-4_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020782332", 
              "https://doi.org/10.1007/978-3-540-45146-4_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-45146-4_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020782332", 
              "https://doi.org/10.1007/978-3-540-45146-4_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-68351-3_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041390533", 
              "https://doi.org/10.1007/978-3-540-68351-3_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/611817.611845", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042404083"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39887-5_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042494507", 
              "https://doi.org/10.1007/978-3-540-39887-5_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39887-5_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042494507", 
              "https://doi.org/10.1007/978-3-540-39887-5_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-68164-9_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049679997", 
              "https://doi.org/10.1007/978-3-540-68164-9_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85886-7_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051744247", 
              "https://doi.org/10.1007/978-3-540-85886-7_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85886-7_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051744247", 
              "https://doi.org/10.1007/978-3-540-85886-7_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/mwc.2005.1404569", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061431960"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/fccm.2004.1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094018699"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/mwscas.2003.1562548", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094709009"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/fpl.2006.311310", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095162730"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2010", 
        "datePublishedReg": "2010-01-01", 
        "description": "Rabbit is a software-oriented synchronous stream cipher with very strong security properties and support for 128-bit keys. Rabbit is part of the European Union\u2019s eSTREAM portfolio of stream ciphers addressing the need for strong and computationally efficient (i.e., fast) ciphers. Extensive cryptanalysis confirms Rabbit\u2019s strength against modern attacks; attacks with complexity lower than an exhaustive key search have not been found. Previous software implementations have demonstrated Rabbit\u2019s high throughput, however, the performance in hardware has only been estimated. Three reconfigurable hardware designs of the Rabbit stream cipher \u2013 direct, interleaved and generalized folded structure (GFS) \u2013 are presented. On the Xilinx Virtex-5 LXT FPGA, a direct, resource-efficient (568 slices) implementation delivers throughputs of up to 9.16 Gbits/s, a 4-slow interleaved design reaches 25.62 Gbits/s using 1163 slices, and a 3-slow 8-GFS implementations delivers throughputs of up to 3.46 Gbits/s using only 233 slices.", 
        "editor": [
          {
            "familyName": "Bao", 
            "givenName": "Feng", 
            "type": "Person"
          }, 
          {
            "familyName": "Yung", 
            "givenName": "Moti", 
            "type": "Person"
          }, 
          {
            "familyName": "Lin", 
            "givenName": "Dongdai", 
            "type": "Person"
          }, 
          {
            "familyName": "Jing", 
            "givenName": "Jiwu", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-642-16342-5_17", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-642-16341-8", 
            "978-3-642-16342-5"
          ], 
          "name": "Information Security and Cryptology", 
          "type": "Book"
        }, 
        "name": "Hardware Framework for the Rabbit Stream Cipher", 
        "pagination": "230-247", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1039758672"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-642-16342-5_17"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "bd6469c1b57cc85d62b6a48d06acae13111e62e672fcd724e554dd402d42cc58"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-642-16342-5_17", 
          "https://app.dimensions.ai/details/publication/pub.1039758672"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T08:33", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000364_0000000364/records_72868_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-642-16342-5_17"
      }
    ]
     

    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-642-16342-5_17'

    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-642-16342-5_17'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-16342-5_17'

    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-642-16342-5_17'


     

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

    115 TRIPLES      23 PREDICATES      37 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-642-16342-5_17 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N4ad210343a0e4fa1a1f1eba7b33fc4f6
    4 schema:citation sg:pub.10.1007/978-3-540-39887-5_23
    5 sg:pub.10.1007/978-3-540-45146-4_11
    6 sg:pub.10.1007/978-3-540-68164-9_2
    7 sg:pub.10.1007/978-3-540-68351-3_7
    8 sg:pub.10.1007/978-3-540-85886-7_14
    9 https://doi.org/10.1109/fccm.2004.1
    10 https://doi.org/10.1109/fpl.2006.311310
    11 https://doi.org/10.1109/mwc.2005.1404569
    12 https://doi.org/10.1109/mwscas.2003.1562548
    13 https://doi.org/10.1145/611817.611845
    14 schema:datePublished 2010
    15 schema:datePublishedReg 2010-01-01
    16 schema:description Rabbit is a software-oriented synchronous stream cipher with very strong security properties and support for 128-bit keys. Rabbit is part of the European Union’s eSTREAM portfolio of stream ciphers addressing the need for strong and computationally efficient (i.e., fast) ciphers. Extensive cryptanalysis confirms Rabbit’s strength against modern attacks; attacks with complexity lower than an exhaustive key search have not been found. Previous software implementations have demonstrated Rabbit’s high throughput, however, the performance in hardware has only been estimated. Three reconfigurable hardware designs of the Rabbit stream cipher – direct, interleaved and generalized folded structure (GFS) – are presented. On the Xilinx Virtex-5 LXT FPGA, a direct, resource-efficient (568 slices) implementation delivers throughputs of up to 9.16 Gbits/s, a 4-slow interleaved design reaches 25.62 Gbits/s using 1163 slices, and a 3-slow 8-GFS implementations delivers throughputs of up to 3.46 Gbits/s using only 233 slices.
    17 schema:editor N69949842753740348f3d10858fcc3e9e
    18 schema:genre chapter
    19 schema:inLanguage en
    20 schema:isAccessibleForFree true
    21 schema:isPartOf N7b8976a615264dbfb14c7c67fcbd83c3
    22 schema:name Hardware Framework for the Rabbit Stream Cipher
    23 schema:pagination 230-247
    24 schema:productId N65397e149d6f4cec9d53625f2d8d3bc8
    25 N8770fd79b22440b39a3b7027b85d9168
    26 Nd074543c285f493cb840c7ff4caa3b7b
    27 schema:publisher Nb373c9503c3f41c3a90b803ba4a15960
    28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039758672
    29 https://doi.org/10.1007/978-3-642-16342-5_17
    30 schema:sdDatePublished 2019-04-16T08:33
    31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    32 schema:sdPublisher N17fd8647ce20466e9d66e4fde75f1b25
    33 schema:url https://link.springer.com/10.1007%2F978-3-642-16342-5_17
    34 sgo:license sg:explorer/license/
    35 sgo:sdDataset chapters
    36 rdf:type schema:Chapter
    37 N17fd8647ce20466e9d66e4fde75f1b25 schema:name Springer Nature - SN SciGraph project
    38 rdf:type schema:Organization
    39 N2f8e0d31d03f4828af1eb296204a8f9b schema:familyName Bao
    40 schema:givenName Feng
    41 rdf:type schema:Person
    42 N47b3a86666de4e89950ac9e829630049 rdf:first Nb33836911c97482994a4e3e2b9ecee90
    43 rdf:rest N627ce08486124947a3e2b59e22d5c9ef
    44 N4ad210343a0e4fa1a1f1eba7b33fc4f6 rdf:first sg:person.012620432773.74
    45 rdf:rest rdf:nil
    46 N52fd1a81b78d4036bdc789efa2e5ad3b rdf:first N82a52bbe7de34b918feea42a5300ec98
    47 rdf:rest N47b3a86666de4e89950ac9e829630049
    48 N627ce08486124947a3e2b59e22d5c9ef rdf:first Nc04ac9f8bb6d437189455d7a9d74e3fa
    49 rdf:rest rdf:nil
    50 N65397e149d6f4cec9d53625f2d8d3bc8 schema:name dimensions_id
    51 schema:value pub.1039758672
    52 rdf:type schema:PropertyValue
    53 N69949842753740348f3d10858fcc3e9e rdf:first N2f8e0d31d03f4828af1eb296204a8f9b
    54 rdf:rest N52fd1a81b78d4036bdc789efa2e5ad3b
    55 N7b8976a615264dbfb14c7c67fcbd83c3 schema:isbn 978-3-642-16341-8
    56 978-3-642-16342-5
    57 schema:name Information Security and Cryptology
    58 rdf:type schema:Book
    59 N82a52bbe7de34b918feea42a5300ec98 schema:familyName Yung
    60 schema:givenName Moti
    61 rdf:type schema:Person
    62 N8770fd79b22440b39a3b7027b85d9168 schema:name doi
    63 schema:value 10.1007/978-3-642-16342-5_17
    64 rdf:type schema:PropertyValue
    65 Nb33836911c97482994a4e3e2b9ecee90 schema:familyName Lin
    66 schema:givenName Dongdai
    67 rdf:type schema:Person
    68 Nb373c9503c3f41c3a90b803ba4a15960 schema:location Berlin, Heidelberg
    69 schema:name Springer Berlin Heidelberg
    70 rdf:type schema:Organisation
    71 Nc04ac9f8bb6d437189455d7a9d74e3fa schema:familyName Jing
    72 schema:givenName Jiwu
    73 rdf:type schema:Person
    74 Nd074543c285f493cb840c7ff4caa3b7b schema:name readcube_id
    75 schema:value bd6469c1b57cc85d62b6a48d06acae13111e62e672fcd724e554dd402d42cc58
    76 rdf:type schema:PropertyValue
    77 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    78 schema:name Information and Computing Sciences
    79 rdf:type schema:DefinedTerm
    80 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    81 schema:name Computation Theory and Mathematics
    82 rdf:type schema:DefinedTerm
    83 sg:person.012620432773.74 schema:affiliation https://www.grid.ac/institutes/grid.254672.0
    84 schema:familyName Stefan
    85 schema:givenName Deian
    86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012620432773.74
    87 rdf:type schema:Person
    88 sg:pub.10.1007/978-3-540-39887-5_23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042494507
    89 https://doi.org/10.1007/978-3-540-39887-5_23
    90 rdf:type schema:CreativeWork
    91 sg:pub.10.1007/978-3-540-45146-4_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020782332
    92 https://doi.org/10.1007/978-3-540-45146-4_11
    93 rdf:type schema:CreativeWork
    94 sg:pub.10.1007/978-3-540-68164-9_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049679997
    95 https://doi.org/10.1007/978-3-540-68164-9_2
    96 rdf:type schema:CreativeWork
    97 sg:pub.10.1007/978-3-540-68351-3_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041390533
    98 https://doi.org/10.1007/978-3-540-68351-3_7
    99 rdf:type schema:CreativeWork
    100 sg:pub.10.1007/978-3-540-85886-7_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051744247
    101 https://doi.org/10.1007/978-3-540-85886-7_14
    102 rdf:type schema:CreativeWork
    103 https://doi.org/10.1109/fccm.2004.1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094018699
    104 rdf:type schema:CreativeWork
    105 https://doi.org/10.1109/fpl.2006.311310 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095162730
    106 rdf:type schema:CreativeWork
    107 https://doi.org/10.1109/mwc.2005.1404569 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061431960
    108 rdf:type schema:CreativeWork
    109 https://doi.org/10.1109/mwscas.2003.1562548 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094709009
    110 rdf:type schema:CreativeWork
    111 https://doi.org/10.1145/611817.611845 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042404083
    112 rdf:type schema:CreativeWork
    113 https://www.grid.ac/institutes/grid.254672.0 schema:alternateName Cooper Union
    114 schema:name S*ProCom2, Dept. of Electrical Engineering, The Cooper Union, 10003, New York, NY, USA
    115 rdf:type schema:Organization
     




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


    ...