Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2001-07-13

AUTHORS

Jacques Patarin

ABSTRACT

In [6] T. Matsumoto and H. Imai described a new asymmet- ric algorithm based on multivariate polynomials of degree two over a finite field, which was subsequently broken in [9]. Here we present two new families of Asymmetric Algorithms that so far have resisted all at- tacks, if properly used: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP). These algorithms can be seen as two candidate ways to repair the Matsumoto-Imai Algorithm. HFE can be used to do sig- natures, encryption or authentication in an asymmetric way, with very short signatures and short encryptions of short messages. IP can be used for signatures and for zero knowledge authentication. An extended version of this paper can be obtained from the author. Another way to repair the Matsumoto-Imai Algorithm will be presented in [10]. More... »

PAGES

33-48

References to SciGraph publications

  • 1989. Some computational aspects of root finding in GF(qm) in SYMBOLIC AND ALGEBRAIC COMPUTATION
  • Book

    TITLE

    Advances in Cryptology — EUROCRYPT ’96

    ISBN

    978-3-540-61186-8
    978-3-540-68339-1

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/3-540-68339-9_4

    DOI

    http://dx.doi.org/10.1007/3-540-68339-9_4

    DIMENSIONS

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


    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/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "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": {
              "name": [
                "CP8 Transac, BP 45, 68 route de Versailles, 78431, Louveciennes Cedex, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Patarin", 
            "givenName": "Jacques", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-51084-2_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024521202", 
              "https://doi.org/10.1007/3-540-51084-2_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/129712.129722", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025643350"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0747-7171(08)80013-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033876399"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/18.32139", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061099270"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tit.1979.1056010", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061648209"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2001-07-13", 
        "datePublishedReg": "2001-07-13", 
        "description": "In [6] T. Matsumoto and H. Imai described a new asymmet- ric algorithm based on multivariate polynomials of degree two over a finite field, which was subsequently broken in [9]. Here we present two new families of Asymmetric Algorithms that so far have resisted all at- tacks, if properly used: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP). These algorithms can be seen as two candidate ways to repair the Matsumoto-Imai Algorithm. HFE can be used to do sig- natures, encryption or authentication in an asymmetric way, with very short signatures and short encryptions of short messages. IP can be used for signatures and for zero knowledge authentication. An extended version of this paper can be obtained from the author. Another way to repair the Matsumoto-Imai Algorithm will be presented in [10].", 
        "editor": [
          {
            "familyName": "Maurer", 
            "givenName": "Ueli", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/3-540-68339-9_4", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-61186-8", 
            "978-3-540-68339-1"
          ], 
          "name": "Advances in Cryptology \u2014 EUROCRYPT \u201996", 
          "type": "Book"
        }, 
        "name": "Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms", 
        "pagination": "33-48", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/3-540-68339-9_4"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "f731ab91f5a9b466e930c0369d0b6c34e58cc05d8e8c4b3047d125952210bdb4"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1051894160"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/3-540-68339-9_4", 
          "https://app.dimensions.ai/details/publication/pub.1051894160"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T05:22", 
        "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/0000000339_0000000339/records_109518_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F3-540-68339-9_4"
      }
    ]
     

    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/3-540-68339-9_4'

    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/3-540-68339-9_4'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-68339-9_4'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-68339-9_4'


     

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

    79 TRIPLES      23 PREDICATES      31 URIs      19 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/3-540-68339-9_4 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author Nd99c69c697284362a59adac92100728a
    4 schema:citation sg:pub.10.1007/3-540-51084-2_24
    5 https://doi.org/10.1016/s0747-7171(08)80013-2
    6 https://doi.org/10.1109/18.32139
    7 https://doi.org/10.1109/tit.1979.1056010
    8 https://doi.org/10.1145/129712.129722
    9 schema:datePublished 2001-07-13
    10 schema:datePublishedReg 2001-07-13
    11 schema:description In [6] T. Matsumoto and H. Imai described a new asymmet- ric algorithm based on multivariate polynomials of degree two over a finite field, which was subsequently broken in [9]. Here we present two new families of Asymmetric Algorithms that so far have resisted all at- tacks, if properly used: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP). These algorithms can be seen as two candidate ways to repair the Matsumoto-Imai Algorithm. HFE can be used to do sig- natures, encryption or authentication in an asymmetric way, with very short signatures and short encryptions of short messages. IP can be used for signatures and for zero knowledge authentication. An extended version of this paper can be obtained from the author. Another way to repair the Matsumoto-Imai Algorithm will be presented in [10].
    12 schema:editor N84bc15223d4246cd9070dd761a483ad9
    13 schema:genre chapter
    14 schema:inLanguage en
    15 schema:isAccessibleForFree true
    16 schema:isPartOf N43cbd77021fd4ec8a83ed26cae365de5
    17 schema:name Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
    18 schema:pagination 33-48
    19 schema:productId N202aa5419e19497fa7a4963f57c0ad50
    20 N7f541dcdd5f044af853e9acbefe9f46f
    21 Nf788afa337f04362bffcdee8f8413d93
    22 schema:publisher N651f723703d34c3c9ea72d7dc255934e
    23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051894160
    24 https://doi.org/10.1007/3-540-68339-9_4
    25 schema:sdDatePublished 2019-04-16T05:22
    26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    27 schema:sdPublisher N05908c2b0ace4874aa9dc543ab11d0ea
    28 schema:url https://link.springer.com/10.1007%2F3-540-68339-9_4
    29 sgo:license sg:explorer/license/
    30 sgo:sdDataset chapters
    31 rdf:type schema:Chapter
    32 N05908c2b0ace4874aa9dc543ab11d0ea schema:name Springer Nature - SN SciGraph project
    33 rdf:type schema:Organization
    34 N202aa5419e19497fa7a4963f57c0ad50 schema:name doi
    35 schema:value 10.1007/3-540-68339-9_4
    36 rdf:type schema:PropertyValue
    37 N43cbd77021fd4ec8a83ed26cae365de5 schema:isbn 978-3-540-61186-8
    38 978-3-540-68339-1
    39 schema:name Advances in Cryptology — EUROCRYPT ’96
    40 rdf:type schema:Book
    41 N651f723703d34c3c9ea72d7dc255934e schema:location Berlin, Heidelberg
    42 schema:name Springer Berlin Heidelberg
    43 rdf:type schema:Organisation
    44 N7f541dcdd5f044af853e9acbefe9f46f schema:name readcube_id
    45 schema:value f731ab91f5a9b466e930c0369d0b6c34e58cc05d8e8c4b3047d125952210bdb4
    46 rdf:type schema:PropertyValue
    47 N84bc15223d4246cd9070dd761a483ad9 rdf:first Nd2d0797833c149c496c87c256bfa4273
    48 rdf:rest rdf:nil
    49 N90941de1e8c842ad9318b4da136bf72c schema:name CP8 Transac, BP 45, 68 route de Versailles, 78431, Louveciennes Cedex, France
    50 rdf:type schema:Organization
    51 Nb139fba4e3784b118024b679b5ee99cd schema:affiliation N90941de1e8c842ad9318b4da136bf72c
    52 schema:familyName Patarin
    53 schema:givenName Jacques
    54 rdf:type schema:Person
    55 Nd2d0797833c149c496c87c256bfa4273 schema:familyName Maurer
    56 schema:givenName Ueli
    57 rdf:type schema:Person
    58 Nd99c69c697284362a59adac92100728a rdf:first Nb139fba4e3784b118024b679b5ee99cd
    59 rdf:rest rdf:nil
    60 Nf788afa337f04362bffcdee8f8413d93 schema:name dimensions_id
    61 schema:value pub.1051894160
    62 rdf:type schema:PropertyValue
    63 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    64 schema:name Information and Computing Sciences
    65 rdf:type schema:DefinedTerm
    66 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    67 schema:name Data Format
    68 rdf:type schema:DefinedTerm
    69 sg:pub.10.1007/3-540-51084-2_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024521202
    70 https://doi.org/10.1007/3-540-51084-2_24
    71 rdf:type schema:CreativeWork
    72 https://doi.org/10.1016/s0747-7171(08)80013-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033876399
    73 rdf:type schema:CreativeWork
    74 https://doi.org/10.1109/18.32139 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061099270
    75 rdf:type schema:CreativeWork
    76 https://doi.org/10.1109/tit.1979.1056010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061648209
    77 rdf:type schema:CreativeWork
    78 https://doi.org/10.1145/129712.129722 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025643350
    79 rdf:type schema:CreativeWork
     




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


    ...