ResearchSpace

SHA-1, SAT-solving, and CNF

Show simple item record

dc.contributor.author Motara, YM
dc.contributor.author Irwin, Barry VW
dc.date.accessioned 2017-10-25T12:44:38Z
dc.date.available 2017-10-25T12:44:38Z
dc.date.issued 2017-09
dc.identifier.citation Motara, Y.M. and Irwin, B.V.W. 2017. SHA-1, SAT-solving, and CNF. Southern Africa Telecommunication Networks and Applications Conference (SATNAC) 2017, 3 - 10 September 2017, Freedom of the Seas, Royal Caribbean International, Barcelona, Spain en_US
dc.identifier.isbn 978-0-620-76756-9
dc.identifier.uri http://www.satnac.org.za//proceedings/2017/SATNAC%202017%20Proceedings%20Final.pdf
dc.identifier.uri http://hdl.handle.net/10204/9692
dc.description Paper presented at Southern Africa Telecommunication Networks and Applications Conference (SATNAC) 2017, 3 - 10 September 2017, Freedom of the Seas, Royal Caribbean International, Barcelona, Spain en_US
dc.description.abstract Finding a preimage for a SHA-1 hash is, at present, a computationally intractable problem. SAT-solvers have been useful tools for handling such problems and can often, through heuristics, generate acceptable solutions. This research examines the intersection between the SHA-1 preimage problem, the encoding of that problem for SAT-solving, and SAT-solving. The results demonstrate that SAT-solving is not yet a viable approach to take to solve the preimage problem, and also indicate that some of the intuitions about “good” problem encodings in the literature are likely to be incorrect. en_US
dc.language.iso en en_US
dc.relation.ispartofseries Worklist;19661
dc.subject SAT-solving en_US
dc.subject SHA-1 en_US
dc.subject Preimage en_US
dc.subject CNF encoding en_US
dc.title SHA-1, SAT-solving, and CNF en_US
dc.type Conference Presentation en_US
dc.identifier.apacitation Motara, Y., & Irwin, B. V. (2017). SHA-1, SAT-solving, and CNF. http://hdl.handle.net/10204/9692 en_ZA
dc.identifier.chicagocitation Motara, YM, and Barry VW Irwin. "SHA-1, SAT-solving, and CNF." (2017): http://hdl.handle.net/10204/9692 en_ZA
dc.identifier.vancouvercitation Motara Y, Irwin BV, SHA-1, SAT-solving, and CNF; 2017. http://hdl.handle.net/10204/9692 . en_ZA
dc.identifier.ris TY - Conference Presentation AU - Motara, YM AU - Irwin, Barry VW AB - Finding a preimage for a SHA-1 hash is, at present, a computationally intractable problem. SAT-solvers have been useful tools for handling such problems and can often, through heuristics, generate acceptable solutions. This research examines the intersection between the SHA-1 preimage problem, the encoding of that problem for SAT-solving, and SAT-solving. The results demonstrate that SAT-solving is not yet a viable approach to take to solve the preimage problem, and also indicate that some of the intuitions about “good” problem encodings in the literature are likely to be incorrect. DA - 2017-09 DB - ResearchSpace DP - CSIR KW - SAT-solving KW - SHA-1 KW - Preimage KW - CNF encoding LK - https://researchspace.csir.co.za PY - 2017 SM - 978-0-620-76756-9 T1 - SHA-1, SAT-solving, and CNF TI - SHA-1, SAT-solving, and CNF UR - http://hdl.handle.net/10204/9692 ER - en_ZA


Files in this item

Thumbnail
Name: Motara_19661_2017.pdf
Size: 107.8Kb
Format: PDF
Description: Conference paper
View/Open

This item appears in the following Collection(s)

Show simple item record