A New Public Key Signature Scheme Based on Quadratic Polynomials
This paper proposes a new public key signature scheme based on multivariate quadratic polynomials over a finite field with odd prime characteristic. This signature scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the sche...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 11 |
|---|---|
| container_issue | |
| container_start_page | 8 |
| container_title | |
| container_volume | |
| creator | Feng Yuan Shangwei Zhao Haiwen Ou Shengwei Xu |
| description | This paper proposes a new public key signature scheme based on multivariate quadratic polynomials over a finite field with odd prime characteristic. This signature scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the scheme is analyzed in detail. The result indicates that the new signature scheme can withstand all known attacks effectively. |
| doi_str_mv | 10.1109/MINES.2012.39 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6407391</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6407391</ieee_id><sourcerecordid>6407391</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-fc3d4462b733d80fba3bee0214c60488cac60259664d8516a15803f3a9bd0553</originalsourceid><addsrcrecordid>eNotzl1LwzAYBeCICo7ZS6-8yR9ofZM3SZM759h0OOekux9pk2pkbaUfSP-9Rb16OHA4HEJuGCSMgbl72exWWcKB8QTNGYlMqiFVRgotuTj_zUyoFBEMwgWZcaZ4rI3RVyTquk8AQKa10Tgj9wu68990P-SnUNBnP9IsvNe2H1pPs-LDV54-2M472tT0bbCutf3U2zensW6qYE_dNbksJ3z075wc1qvD8inevj5ulottHFgq-7gs0AmheD69chrK3GLuPXAmCgVC68JOcmmUEk5LpiyTGrBEa3IHUuKc3P7NBu_98asNlW3HoxKQomH4A7q0Sm4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A New Public Key Signature Scheme Based on Quadratic Polynomials</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Feng Yuan ; Shangwei Zhao ; Haiwen Ou ; Shengwei Xu</creator><creatorcontrib>Feng Yuan ; Shangwei Zhao ; Haiwen Ou ; Shengwei Xu</creatorcontrib><description>This paper proposes a new public key signature scheme based on multivariate quadratic polynomials over a finite field with odd prime characteristic. This signature scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the scheme is analyzed in detail. The result indicates that the new signature scheme can withstand all known attacks effectively.</description><identifier>ISSN: 2162-8998</identifier><identifier>ISBN: 9781467330930</identifier><identifier>ISBN: 1467330930</identifier><identifier>EISBN: 9780769548524</identifier><identifier>EISBN: 0769548520</identifier><identifier>DOI: 10.1109/MINES.2012.39</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Galois fields ; Polynomials ; Public key cryptography ; public key cryptography; polynomials; mapping; attack; finite field</subject><ispartof>2012 Fourth International Conference on Multimedia Information Networking and Security, 2012, p.8-11</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6407391$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6407391$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Feng Yuan</creatorcontrib><creatorcontrib>Shangwei Zhao</creatorcontrib><creatorcontrib>Haiwen Ou</creatorcontrib><creatorcontrib>Shengwei Xu</creatorcontrib><title>A New Public Key Signature Scheme Based on Quadratic Polynomials</title><title>2012 Fourth International Conference on Multimedia Information Networking and Security</title><addtitle>mines</addtitle><description>This paper proposes a new public key signature scheme based on multivariate quadratic polynomials over a finite field with odd prime characteristic. This signature scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the scheme is analyzed in detail. The result indicates that the new signature scheme can withstand all known attacks effectively.</description><subject>Galois fields</subject><subject>Polynomials</subject><subject>Public key cryptography</subject><subject>public key cryptography; polynomials; mapping; attack; finite field</subject><issn>2162-8998</issn><isbn>9781467330930</isbn><isbn>1467330930</isbn><isbn>9780769548524</isbn><isbn>0769548520</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzl1LwzAYBeCICo7ZS6-8yR9ofZM3SZM759h0OOekux9pk2pkbaUfSP-9Rb16OHA4HEJuGCSMgbl72exWWcKB8QTNGYlMqiFVRgotuTj_zUyoFBEMwgWZcaZ4rI3RVyTquk8AQKa10Tgj9wu68990P-SnUNBnP9IsvNe2H1pPs-LDV54-2M472tT0bbCutf3U2zensW6qYE_dNbksJ3z075wc1qvD8inevj5ulottHFgq-7gs0AmheD69chrK3GLuPXAmCgVC68JOcmmUEk5LpiyTGrBEa3IHUuKc3P7NBu_98asNlW3HoxKQomH4A7q0Sm4</recordid><startdate>201211</startdate><enddate>201211</enddate><creator>Feng Yuan</creator><creator>Shangwei Zhao</creator><creator>Haiwen Ou</creator><creator>Shengwei Xu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201211</creationdate><title>A New Public Key Signature Scheme Based on Quadratic Polynomials</title><author>Feng Yuan ; Shangwei Zhao ; Haiwen Ou ; Shengwei Xu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-fc3d4462b733d80fba3bee0214c60488cac60259664d8516a15803f3a9bd0553</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Galois fields</topic><topic>Polynomials</topic><topic>Public key cryptography</topic><topic>public key cryptography; polynomials; mapping; attack; finite field</topic><toplevel>online_resources</toplevel><creatorcontrib>Feng Yuan</creatorcontrib><creatorcontrib>Shangwei Zhao</creatorcontrib><creatorcontrib>Haiwen Ou</creatorcontrib><creatorcontrib>Shengwei Xu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Feng Yuan</au><au>Shangwei Zhao</au><au>Haiwen Ou</au><au>Shengwei Xu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A New Public Key Signature Scheme Based on Quadratic Polynomials</atitle><btitle>2012 Fourth International Conference on Multimedia Information Networking and Security</btitle><stitle>mines</stitle><date>2012-11</date><risdate>2012</risdate><spage>8</spage><epage>11</epage><pages>8-11</pages><issn>2162-8998</issn><isbn>9781467330930</isbn><isbn>1467330930</isbn><eisbn>9780769548524</eisbn><eisbn>0769548520</eisbn><coden>IEEPAD</coden><abstract>This paper proposes a new public key signature scheme based on multivariate quadratic polynomials over a finite field with odd prime characteristic. This signature scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the scheme is analyzed in detail. The result indicates that the new signature scheme can withstand all known attacks effectively.</abstract><pub>IEEE</pub><doi>10.1109/MINES.2012.39</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2162-8998 |
| ispartof | 2012 Fourth International Conference on Multimedia Information Networking and Security, 2012, p.8-11 |
| issn | 2162-8998 |
| language | eng |
| recordid | cdi_ieee_primary_6407391 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Galois fields Polynomials Public key cryptography public key cryptography polynomials mapping attack finite field |
| title | A New Public Key Signature Scheme Based on Quadratic Polynomials |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T05%3A05%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20New%20Public%20Key%20Signature%20Scheme%20Based%20on%20Quadratic%20Polynomials&rft.btitle=2012%20Fourth%20International%20Conference%20on%20Multimedia%20Information%20Networking%20and%20Security&rft.au=Feng%20Yuan&rft.date=2012-11&rft.spage=8&rft.epage=11&rft.pages=8-11&rft.issn=2162-8998&rft.isbn=9781467330930&rft.isbn_list=1467330930&rft.coden=IEEPAD&rft_id=info:doi/10.1109/MINES.2012.39&rft_dat=%3Cieee_6IE%3E6407391%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769548524&rft.eisbn_list=0769548520&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6407391&rfr_iscdi=true |