- Title
- SHA-1, SAT-solving, and CNF
- Creator
- Motara, Yusuf, M, Irwin, Barry V W
- Date
- 2017
- Type
- text
- Type
- article
- Identifier
- http://hdl.handle.net/10962/428408
- Identifier
- vital:72509
- Identifier
- https://researchspace.csir.co.za/dspace/bitstream/handle/10204/9692/Motara_19661_2017.pdf?sequence=1andisAllowed=y
- Description
- 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.
- Format
- 5 pages, pdf
- Language
- English
- Relation
- Proceedings of Southern African Telecommunication Networks and Applications Conference (SATNAC), Motara, Y.M. and Irwin, B.V., 2017. SHA-1, SAT-solving, and CNF. Southern Africa Telecommunication Networks and Applications Conference (SA TNAC), Proceedings of Southern African Telecommunication Networks and Applications Conference (SATNAC) volume 2017 number 1 1 5 2017 Conference
- Rights
- Publisher
- Rights
- Use of this resource is governed by the terms and conditions of the Southern Africa Telecommunication Networks and Applications Conference (SA TNAC) Statement (https://www.satnac.org.za/)
- Hits: 21
- Visitors: 24
- Downloads: 4
Collections
Irwin, Barry V W (Prof)
Motara, Yusuf (Dr)
RU Department of Computer Science
SDG 09. Industry, Innovation and Infrastructure
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | SHA-1, SAT-solving, and CNF.pdf | 107 KB | Adobe Acrobat PDF | View Details Download |