Algorithm for SIS and MultiSIS problems
SIS problem has numerous applications in cryptography. Known algorithms for solving that problem are exponential in complexity. A new algorithm is suggested in this note, its complexity is sub-exponential for a range of parameters.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Semaev, Igor |
| description | SIS problem has numerous applications in cryptography. Known algorithms for
solving that problem are exponential in complexity. A new algorithm is
suggested in this note, its complexity is sub-exponential for a range of
parameters. |
| doi_str_mv | 10.48550/arxiv.2008.07216 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2008_07216</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2008_07216</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-30ee39d532b7365c30b3f38490094c16ac06d910e69f5ad163ee9dba0c4412fc3</originalsourceid><addsrcrecordid>eNotzjsPgjAYheEuDkb9AU6yOYFf-dpCR0O8kGAcdCelFyUBIfUS_ffGy3TyLicPIVMKEUs5h4Xyz_oRxQBpBElMxZDMl82p8_Xt3Aau88EhPwTqYoLdvbnVn-h9VzW2vY7JwKnmaif_HZHjenXMtmGx3-TZsgiVSESIYC1KwzGuEhRcI1ToMGUSQDJNhdIgjKRghXRcGSrQWmkqBZoxGjuNIzL73X6lZe_rVvlX-RGXXzG-AfowOXU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Algorithm for SIS and MultiSIS problems</title><source>arXiv.org</source><creator>Semaev, Igor</creator><creatorcontrib>Semaev, Igor</creatorcontrib><description>SIS problem has numerous applications in cryptography. Known algorithms for
solving that problem are exponential in complexity. A new algorithm is
suggested in this note, its complexity is sub-exponential for a range of
parameters.</description><identifier>DOI: 10.48550/arxiv.2008.07216</identifier><language>eng</language><subject>Computer Science - Cryptography and Security ; Computer Science - Data Structures and Algorithms ; Mathematics - Number Theory</subject><creationdate>2020-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2008.07216$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2008.07216$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Semaev, Igor</creatorcontrib><title>Algorithm for SIS and MultiSIS problems</title><description>SIS problem has numerous applications in cryptography. Known algorithms for
solving that problem are exponential in complexity. A new algorithm is
suggested in this note, its complexity is sub-exponential for a range of
parameters.</description><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Data Structures and Algorithms</subject><subject>Mathematics - Number Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzjsPgjAYheEuDkb9AU6yOYFf-dpCR0O8kGAcdCelFyUBIfUS_ffGy3TyLicPIVMKEUs5h4Xyz_oRxQBpBElMxZDMl82p8_Xt3Aau88EhPwTqYoLdvbnVn-h9VzW2vY7JwKnmaif_HZHjenXMtmGx3-TZsgiVSESIYC1KwzGuEhRcI1ToMGUSQDJNhdIgjKRghXRcGSrQWmkqBZoxGjuNIzL73X6lZe_rVvlX-RGXXzG-AfowOXU</recordid><startdate>20200817</startdate><enddate>20200817</enddate><creator>Semaev, Igor</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200817</creationdate><title>Algorithm for SIS and MultiSIS problems</title><author>Semaev, Igor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-30ee39d532b7365c30b3f38490094c16ac06d910e69f5ad163ee9dba0c4412fc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Data Structures and Algorithms</topic><topic>Mathematics - Number Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Semaev, Igor</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Semaev, Igor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Algorithm for SIS and MultiSIS problems</atitle><date>2020-08-17</date><risdate>2020</risdate><abstract>SIS problem has numerous applications in cryptography. Known algorithms for
solving that problem are exponential in complexity. A new algorithm is
suggested in this note, its complexity is sub-exponential for a range of
parameters.</abstract><doi>10.48550/arxiv.2008.07216</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2008.07216 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2008_07216 |
| source | arXiv.org |
| subjects | Computer Science - Cryptography and Security Computer Science - Data Structures and Algorithms Mathematics - Number Theory |
| title | Algorithm for SIS and MultiSIS problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T02%3A17%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Algorithm%20for%20SIS%20and%20MultiSIS%20problems&rft.au=Semaev,%20Igor&rft.date=2020-08-17&rft_id=info:doi/10.48550/arxiv.2008.07216&rft_dat=%3Carxiv_GOX%3E2008_07216%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |