A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation
This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanaly...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 214 |
|---|---|
| container_issue | |
| container_start_page | 203 |
| container_title | |
| container_volume | |
| creator | Mihaljević, Miodrag J. Fossorier, Marc P. C. Imai, Hideki |
| description | This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify time instances where certain arguments of the nonlinear function depend only on these B bits and are equal to zero. As opposed to previously reported methods, the proposed one also identifies and uses certain characteristics of the LFSM state-transition matrix in order to reduce the nonlinearity of the system of overdefined equations employed in an algebraic attack scenario, or to reduce the noise introduced by the linearization of the nonlinear function which corrupts the linear equations employed in a correlation attack scenario. |
| doi_str_mv | 10.1007/11617983_20 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_20457112</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>20457112</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-3902774ef92c84c1f955e28a00ffa5c3ab8fd1247d5ea5bdfe729c0fa7ed8f7d3</originalsourceid><addsrcrecordid>eNpVkDtPw0AQhI-XRAip-APXUFAY9h7mfKUJJCBFogBqa32PyMSxrTtT8O9zkBRQrWbm02o0hFwxuGUA6o6xe6Z0ISoOR2SmVSFyCYJJLuGYTFLIMiGkPvmXCXFKJiCAZ1pJcU4uYvwEAK40nxBb0qXrXMCWLvqw_WpxbPqO9p6W7drVARtDsbN0gXGk8z4EdyDKcUSzifQBo7M0GY_ONgbHJN5wO7QuGabZ_sKX5MxjG93scKfkY_H0Pn_OVq_Ll3m5ygbO9JgJnUop6bzmppCGeZ3njhcI4D3mRmBdeMu4VDZ3mNfWO8W1AY_K2cIrK6bkev93wGiw9QE708RqCKlH-E6jyVwxxhN3s-diirq1C1Xd95tYMah-Zq7-zCx2Kt5qWQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation</title><source>Springer Books</source><creator>Mihaljević, Miodrag J. ; Fossorier, Marc P. C. ; Imai, Hideki</creator><contributor>Imai, Hideki ; Lin, Shu ; Poli, Alain ; Fossorier, Marc P. C.</contributor><creatorcontrib>Mihaljević, Miodrag J. ; Fossorier, Marc P. C. ; Imai, Hideki ; Imai, Hideki ; Lin, Shu ; Poli, Alain ; Fossorier, Marc P. C.</creatorcontrib><description>This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify time instances where certain arguments of the nonlinear function depend only on these B bits and are equal to zero. As opposed to previously reported methods, the proposed one also identifies and uses certain characteristics of the LFSM state-transition matrix in order to reduce the nonlinearity of the system of overdefined equations employed in an algebraic attack scenario, or to reduce the noise introduced by the linearization of the nonlinear function which corrupts the linear equations employed in a correlation attack scenario.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540314233</identifier><identifier>ISBN: 3540314237</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540314240</identifier><identifier>EISBN: 3540314245</identifier><identifier>DOI: 10.1007/11617983_20</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>algebraic attacks ; Applied sciences ; Computer science; control theory; systems ; cryptanalysis ; Cryptography ; decimation ; decoding ; Exact sciences and technology ; fast correlation attack ; Information, signal and communications theory ; keystream generators ; LFSRs ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; overdefined systems of nonlinear equations ; Signal and communications theory ; Software ; state transition matrix ; stream ciphers ; Telecommunications and information theory</subject><ispartof>Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 2006, p.203-214</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11617983_20$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11617983_20$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20457112$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Imai, Hideki</contributor><contributor>Lin, Shu</contributor><contributor>Poli, Alain</contributor><contributor>Fossorier, Marc P. C.</contributor><creatorcontrib>Mihaljević, Miodrag J.</creatorcontrib><creatorcontrib>Fossorier, Marc P. C.</creatorcontrib><creatorcontrib>Imai, Hideki</creatorcontrib><title>A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation</title><title>Applied Algebra, Algebraic Algorithms and Error-Correcting Codes</title><description>This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify time instances where certain arguments of the nonlinear function depend only on these B bits and are equal to zero. As opposed to previously reported methods, the proposed one also identifies and uses certain characteristics of the LFSM state-transition matrix in order to reduce the nonlinearity of the system of overdefined equations employed in an algebraic attack scenario, or to reduce the noise introduced by the linearization of the nonlinear function which corrupts the linear equations employed in a correlation attack scenario.</description><subject>algebraic attacks</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>cryptanalysis</subject><subject>Cryptography</subject><subject>decimation</subject><subject>decoding</subject><subject>Exact sciences and technology</subject><subject>fast correlation attack</subject><subject>Information, signal and communications theory</subject><subject>keystream generators</subject><subject>LFSRs</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>overdefined systems of nonlinear equations</subject><subject>Signal and communications theory</subject><subject>Software</subject><subject>state transition matrix</subject><subject>stream ciphers</subject><subject>Telecommunications and information theory</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540314233</isbn><isbn>3540314237</isbn><isbn>9783540314240</isbn><isbn>3540314245</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpVkDtPw0AQhI-XRAip-APXUFAY9h7mfKUJJCBFogBqa32PyMSxrTtT8O9zkBRQrWbm02o0hFwxuGUA6o6xe6Z0ISoOR2SmVSFyCYJJLuGYTFLIMiGkPvmXCXFKJiCAZ1pJcU4uYvwEAK40nxBb0qXrXMCWLvqw_WpxbPqO9p6W7drVARtDsbN0gXGk8z4EdyDKcUSzifQBo7M0GY_ONgbHJN5wO7QuGabZ_sKX5MxjG93scKfkY_H0Pn_OVq_Ll3m5ygbO9JgJnUop6bzmppCGeZ3njhcI4D3mRmBdeMu4VDZ3mNfWO8W1AY_K2cIrK6bkev93wGiw9QE708RqCKlH-E6jyVwxxhN3s-diirq1C1Xd95tYMah-Zq7-zCx2Kt5qWQ</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Mihaljević, Miodrag J.</creator><creator>Fossorier, Marc P. C.</creator><creator>Imai, Hideki</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation</title><author>Mihaljević, Miodrag J. ; Fossorier, Marc P. C. ; Imai, Hideki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-3902774ef92c84c1f955e28a00ffa5c3ab8fd1247d5ea5bdfe729c0fa7ed8f7d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>algebraic attacks</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>cryptanalysis</topic><topic>Cryptography</topic><topic>decimation</topic><topic>decoding</topic><topic>Exact sciences and technology</topic><topic>fast correlation attack</topic><topic>Information, signal and communications theory</topic><topic>keystream generators</topic><topic>LFSRs</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>overdefined systems of nonlinear equations</topic><topic>Signal and communications theory</topic><topic>Software</topic><topic>state transition matrix</topic><topic>stream ciphers</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mihaljević, Miodrag J.</creatorcontrib><creatorcontrib>Fossorier, Marc P. C.</creatorcontrib><creatorcontrib>Imai, Hideki</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mihaljević, Miodrag J.</au><au>Fossorier, Marc P. C.</au><au>Imai, Hideki</au><au>Imai, Hideki</au><au>Lin, Shu</au><au>Poli, Alain</au><au>Fossorier, Marc P. C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation</atitle><btitle>Applied Algebra, Algebraic Algorithms and Error-Correcting Codes</btitle><date>2006</date><risdate>2006</risdate><spage>203</spage><epage>214</epage><pages>203-214</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540314233</isbn><isbn>3540314237</isbn><eisbn>9783540314240</eisbn><eisbn>3540314245</eisbn><abstract>This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify time instances where certain arguments of the nonlinear function depend only on these B bits and are equal to zero. As opposed to previously reported methods, the proposed one also identifies and uses certain characteristics of the LFSM state-transition matrix in order to reduce the nonlinearity of the system of overdefined equations employed in an algebraic attack scenario, or to reduce the noise introduced by the linearization of the nonlinear function which corrupts the linear equations employed in a correlation attack scenario.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11617983_20</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 2006, p.203-214 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_20457112 |
| source | Springer Books |
| subjects | algebraic attacks Applied sciences Computer science control theory systems cryptanalysis Cryptography decimation decoding Exact sciences and technology fast correlation attack Information, signal and communications theory keystream generators LFSRs Memory and file management (including protection and security) Memory organisation. Data processing overdefined systems of nonlinear equations Signal and communications theory Software state transition matrix stream ciphers Telecommunications and information theory |
| title | A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T14%3A55%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20General%20Formulation%20of%20Algebraic%20and%20Fast%20Correlation%20Attacks%20Based%20on%20Dedicated%20Sample%20Decimation&rft.btitle=Applied%20Algebra,%20Algebraic%20Algorithms%20and%20Error-Correcting%20Codes&rft.au=Mihaljevi%C4%87,%20Miodrag%20J.&rft.date=2006&rft.spage=203&rft.epage=214&rft.pages=203-214&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540314233&rft.isbn_list=3540314237&rft_id=info:doi/10.1007/11617983_20&rft_dat=%3Cpascalfrancis_sprin%3E20457112%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540314240&rft.eisbn_list=3540314245&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |