{"title":"用代数系统求解降维圆Keccak散列函数的预图像攻击","authors":"Junling Pei, Lusheng Chen","doi":"10.1049/ise2.12103","DOIUrl":null,"url":null,"abstract":"<p>In this paper, improved preimage attacks are presented on 3-round Keccak-256 and Keccak-512 and 4-round Keccak-256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing preimage attacks, and further refine the linearisation processes of quadratic bits to lower the complexities. For 3-round Keccak-256 and Keccak-512, priority is given to values with higher probability for quadratic bits, such that the guessing complexities decrease from slightly more than 2<sup>65</sup> and 2<sup>440</sup> to 2<sup>64.79</sup> and 2<sup>424</sup>, respectively. For preimage attack on 4-round Keccak-256, some strategies of saving degrees of freedom are applied to solve Boolean multivariate quadratic systems and reduce the guessing complexity from 2<sup>196</sup> to 2<sup>188</sup>.</p>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"17 3","pages":"394-406"},"PeriodicalIF":1.3000,"publicationDate":"2022-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ise2.12103","citationCount":"1","resultStr":"{\"title\":\"Preimage attacks on reduced-round Keccak hash functions by solving algebraic systems\",\"authors\":\"Junling Pei, Lusheng Chen\",\"doi\":\"10.1049/ise2.12103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, improved preimage attacks are presented on 3-round Keccak-256 and Keccak-512 and 4-round Keccak-256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing preimage attacks, and further refine the linearisation processes of quadratic bits to lower the complexities. For 3-round Keccak-256 and Keccak-512, priority is given to values with higher probability for quadratic bits, such that the guessing complexities decrease from slightly more than 2<sup>65</sup> and 2<sup>440</sup> to 2<sup>64.79</sup> and 2<sup>424</sup>, respectively. For preimage attack on 4-round Keccak-256, some strategies of saving degrees of freedom are applied to solve Boolean multivariate quadratic systems and reduce the guessing complexity from 2<sup>196</sup> to 2<sup>188</sup>.</p>\",\"PeriodicalId\":50380,\"journal\":{\"name\":\"IET Information Security\",\"volume\":\"17 3\",\"pages\":\"394-406\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2022-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ise2.12103\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Information Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/ise2.12103\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Information Security","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/ise2.12103","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Preimage attacks on reduced-round Keccak hash functions by solving algebraic systems
In this paper, improved preimage attacks are presented on 3-round Keccak-256 and Keccak-512 and 4-round Keccak-256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing preimage attacks, and further refine the linearisation processes of quadratic bits to lower the complexities. For 3-round Keccak-256 and Keccak-512, priority is given to values with higher probability for quadratic bits, such that the guessing complexities decrease from slightly more than 265 and 2440 to 264.79 and 2424, respectively. For preimage attack on 4-round Keccak-256, some strategies of saving degrees of freedom are applied to solve Boolean multivariate quadratic systems and reduce the guessing complexity from 2196 to 2188.
期刊介绍：
IET Information Security publishes original research papers in the following areas of information security and cryptography. Submitting authors should specify clearly in their covering statement the area into which their paper falls.
Scope:
Access Control and Database Security
Ad-Hoc Network Aspects
Anonymity and E-Voting
Authentication
Block Ciphers and Hash Functions
Blockchain, Bitcoin (Technical aspects only)
Broadcast Encryption and Traitor Tracing
Combinatorial Aspects
Covert Channels and Information Flow
Critical Infrastructures
Cryptanalysis
Dependability
Digital Rights Management
Digital Signature Schemes
Digital Steganography
Economic Aspects of Information Security
Elliptic Curve Cryptography and Number Theory
Embedded Systems Aspects
Embedded Systems Security and Forensics
Financial Cryptography
Firewall Security
Formal Methods and Security Verification
Human Aspects
Information Warfare and Survivability
Intrusion Detection
Java and XML Security
Key Distribution
Key Management
Malware
Multi-Party Computation and Threshold Cryptography
Peer-to-peer Security
PKIs
Public-Key and Hybrid Encryption
Quantum Cryptography
Risks of using Computers
Robust Networks
Secret Sharing
Secure Electronic Commerce
Software Obfuscation
Stream Ciphers
Trust Models
Watermarking and Fingerprinting
Special Issues. Current Call for Papers:
Security on Mobile and IoT devices - https://digital-library.theiet.org/files/IET_IFS_SMID_CFP.pdf
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
