A SAT-based preimage analysis of reduced Keccak hash functions
In this paper, we present a preimage attack on reduced versions of Keccak hash functions. We use our recently developed toolkit CryptLogVer for generating the conjunctive normal form, CNF, which is passed to the SAT solver PrecoSAT. We found preimages for some reduced versions of the function and sh...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2013-05, Vol.113 (10-11), p.392-397 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 397 |
|---|---|
| container_issue | 10-11 |
| container_start_page | 392 |
| container_title | Information processing letters |
| container_volume | 113 |
| creator | Morawiecki, Paweł Srebrny, Marian |
| description | In this paper, we present a preimage attack on reduced versions of Keccak hash functions. We use our recently developed toolkit CryptLogVer for generating the conjunctive normal form, CNF, which is passed to the SAT solver PrecoSAT. We found preimages for some reduced versions of the function and showed that full Keccak function has a comfortable security margin against this kind of attack.
•We have carried out the SAT-based preimage attack on reduced Keccak hash function.•We have found a preimage and partial preimages for reduced versions of Keccak hash function.•The results suggest the strength of the Keccak function against the SAT-based attack. |
| doi_str_mv | 10.1016/j.ipl.2013.03.004 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1322102073</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019013000811</els_id><sourcerecordid>2932694891</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-7e34c93b7c6635a56331d0f7d30230ef124d4f79f54332c6977bce8738d445cc3</originalsourceid><addsrcrecordid>eNp9UE1LAzEUDKJg_fgB3hY8b33Jy266CEIpfmHBg_Uc0uyLzVp312RX6L83pZ6FgTm8mcfMMHbFYcqBlzfN1PfbqQCOU0gAecQmfKZEXnJeHbMJgIAceAWn7CzGBgBKiWrC7ubZ23yVr02kOusD-S_zQZlpzXYXfcw6lwWqR5uOL2St-cw2Jm4yN7Z28F0bL9iJM9tIl398zt4f7leLp3z5-vi8mC9zi6IYckUobYVrZcsSC1OUiLwGp2oEgUCOC1lLpypXSERhy0qptaWZwlktZWEtnrPrw98-dN8jxUE33RhSyqg5CsFTO4VJxQ8qG7oYAzndh1Qo7DQHvZ9JNzrNpPczaUgAmTy3Bw-l-D-ego7WU5sa-0B20HXn_3H_Au51bWg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1322102073</pqid></control><display><type>article</type><title>A SAT-based preimage analysis of reduced Keccak hash functions</title><source>Elsevier ScienceDirect Journals Complete - AutoHoldings</source><creator>Morawiecki, Paweł ; Srebrny, Marian</creator><creatorcontrib>Morawiecki, Paweł ; Srebrny, Marian</creatorcontrib><description>In this paper, we present a preimage attack on reduced versions of Keccak hash functions. We use our recently developed toolkit CryptLogVer for generating the conjunctive normal form, CNF, which is passed to the SAT solver PrecoSAT. We found preimages for some reduced versions of the function and showed that full Keccak function has a comfortable security margin against this kind of attack.
•We have carried out the SAT-based preimage attack on reduced Keccak hash function.•We have found a preimage and partial preimages for reduced versions of Keccak hash function.•The results suggest the strength of the Keccak function against the SAT-based attack.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2013.03.004</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algebraic cryptanalysis ; Cryptography ; Data encryption ; Hash functions ; Keccak ; Logical cryptanalysis ; Mathematical functions ; SAT solvers ; Security management ; Studies</subject><ispartof>Information processing letters, 2013-05, Vol.113 (10-11), p.392-397</ispartof><rights>2013 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. May/Jun 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-7e34c93b7c6635a56331d0f7d30230ef124d4f79f54332c6977bce8738d445cc3</citedby><cites>FETCH-LOGICAL-c325t-7e34c93b7c6635a56331d0f7d30230ef124d4f79f54332c6977bce8738d445cc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ipl.2013.03.004$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3549,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Morawiecki, Paweł</creatorcontrib><creatorcontrib>Srebrny, Marian</creatorcontrib><title>A SAT-based preimage analysis of reduced Keccak hash functions</title><title>Information processing letters</title><description>In this paper, we present a preimage attack on reduced versions of Keccak hash functions. We use our recently developed toolkit CryptLogVer for generating the conjunctive normal form, CNF, which is passed to the SAT solver PrecoSAT. We found preimages for some reduced versions of the function and showed that full Keccak function has a comfortable security margin against this kind of attack.
•We have carried out the SAT-based preimage attack on reduced Keccak hash function.•We have found a preimage and partial preimages for reduced versions of Keccak hash function.•The results suggest the strength of the Keccak function against the SAT-based attack.</description><subject>Algebraic cryptanalysis</subject><subject>Cryptography</subject><subject>Data encryption</subject><subject>Hash functions</subject><subject>Keccak</subject><subject>Logical cryptanalysis</subject><subject>Mathematical functions</subject><subject>SAT solvers</subject><subject>Security management</subject><subject>Studies</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEUDKJg_fgB3hY8b33Jy266CEIpfmHBg_Uc0uyLzVp312RX6L83pZ6FgTm8mcfMMHbFYcqBlzfN1PfbqQCOU0gAecQmfKZEXnJeHbMJgIAceAWn7CzGBgBKiWrC7ubZ23yVr02kOusD-S_zQZlpzXYXfcw6lwWqR5uOL2St-cw2Jm4yN7Z28F0bL9iJM9tIl398zt4f7leLp3z5-vi8mC9zi6IYckUobYVrZcsSC1OUiLwGp2oEgUCOC1lLpypXSERhy0qptaWZwlktZWEtnrPrw98-dN8jxUE33RhSyqg5CsFTO4VJxQ8qG7oYAzndh1Qo7DQHvZ9JNzrNpPczaUgAmTy3Bw-l-D-ego7WU5sa-0B20HXn_3H_Au51bWg</recordid><startdate>20130501</startdate><enddate>20130501</enddate><creator>Morawiecki, Paweł</creator><creator>Srebrny, Marian</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130501</creationdate><title>A SAT-based preimage analysis of reduced Keccak hash functions</title><author>Morawiecki, Paweł ; Srebrny, Marian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-7e34c93b7c6635a56331d0f7d30230ef124d4f79f54332c6977bce8738d445cc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algebraic cryptanalysis</topic><topic>Cryptography</topic><topic>Data encryption</topic><topic>Hash functions</topic><topic>Keccak</topic><topic>Logical cryptanalysis</topic><topic>Mathematical functions</topic><topic>SAT solvers</topic><topic>Security management</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Morawiecki, Paweł</creatorcontrib><creatorcontrib>Srebrny, Marian</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Morawiecki, Paweł</au><au>Srebrny, Marian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A SAT-based preimage analysis of reduced Keccak hash functions</atitle><jtitle>Information processing letters</jtitle><date>2013-05-01</date><risdate>2013</risdate><volume>113</volume><issue>10-11</issue><spage>392</spage><epage>397</epage><pages>392-397</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>In this paper, we present a preimage attack on reduced versions of Keccak hash functions. We use our recently developed toolkit CryptLogVer for generating the conjunctive normal form, CNF, which is passed to the SAT solver PrecoSAT. We found preimages for some reduced versions of the function and showed that full Keccak function has a comfortable security margin against this kind of attack.
•We have carried out the SAT-based preimage attack on reduced Keccak hash function.•We have found a preimage and partial preimages for reduced versions of Keccak hash function.•The results suggest the strength of the Keccak function against the SAT-based attack.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2013.03.004</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2013-05, Vol.113 (10-11), p.392-397 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_1322102073 |
| source | Elsevier ScienceDirect Journals Complete - AutoHoldings |
| subjects | Algebraic cryptanalysis Cryptography Data encryption Hash functions Keccak Logical cryptanalysis Mathematical functions SAT solvers Security management Studies |
| title | A SAT-based preimage analysis of reduced Keccak hash functions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T06%3A33%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20SAT-based%20preimage%20analysis%20of%20reduced%20Keccak%20hash%20functions&rft.jtitle=Information%20processing%20letters&rft.au=Morawiecki,%20Pawe%C5%82&rft.date=2013-05-01&rft.volume=113&rft.issue=10-11&rft.spage=392&rft.epage=397&rft.pages=392-397&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2013.03.004&rft_dat=%3Cproquest_cross%3E2932694891%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1322102073&rft_id=info:pmid/&rft_els_id=S0020019013000811&rfr_iscdi=true |