SAT Based Attacks on SipHash - Department of Computer Science

More documents

Recommendations

Info

26 The authors conduct various tests using BDD, <strong>SAT</strong> solver and Gröbner bases. They conclude by saying that <strong>SAT</strong> attacks are by far the best amongst these attacks on Bivium [5].
27 Chapter 5 Future Work <strong>SAT</strong> based attacks offer a different approach to break cryptographic primitives. However, the <strong>SAT</strong> solver was not used to the full extent in this project. Further work can be conducted to better understand the <strong>SAT</strong> solver and its applications to cryptanalysis. Following is a list of a few new approaches that can be tried with <strong>SAT</strong> solvers and SipHash. • The project explored up to 25 missing key bits for a partial key recovery. The number of missing key bits can be further increased to get a deeper understanding of the performance comparison between <strong>SAT</strong> based attacks and brute force approach to partial key recovery. • The project explored the <strong>SAT</strong> solver performance on SipHash up to two compression rounds and three finalization rounds. The number of compression and finalization rounds can be increased further to examine more results. • The project used CryptoMini<strong>SAT</strong> as the <strong>SAT</strong> solver. Several other <strong>SAT</strong> solvers can be employed and their relative performance can be analyzed. • The project can be extended to incorporate the application and analysis of parallel <strong>SAT</strong> solvers to partial key recovery. • The project assumed that certain key bits were known in advance and aimed at a partial key recovery. <strong>SAT</strong> based attacks can be combined with other cryptanalysis techniques such as linear or differential cryptanalysis and other attacks can be forged.
Page 1 and 2: SAT Based<
Page 3 and 4: iii Abstract SAT <
Page 5 and 6: v 4 Related work . . . . . . . . .
Page 7 and 8: 1 Chapter 1 Introduction This proje
Page 9 and 10: 3 Figure 1.1: SipHash-2,4 processin
Page 11 and 12: 5 possible values for each of the l
Page 13 and 14: 7 2.1.1 CNF for AND Consider the op
Page 15 and 16: 9 2.1.4 CNF for ADD Figure 2.1: ADD
Page 17 and 18: 11 Figure 2.3: Vector before rotati
Page 19 and 20: 13 half adders. Variable space is r
Page 21 and 22: 15 for c −→ 1 to 2 for d −→
Page 23 and 24: 17 Figure 3.1: SipHash-1,0 Figure 3
Page 25 and 26: 19 3.1.2 SipHash-x,1 Figure 3.5: Si
Page 27 and 28: 21 Chapter 4 Related work B
Page 29 and 30: 23 Walk-SAT algori
Page 31: 25 on reduced versions of CubeHash
Page 35 and 36: 29 Bibliography [1] Jean-Philippe A
Page 37 and 38: 31 Appendix A Variable Parameters K
Page 39 and 40: 33 c Calc default polars - time: 0.
Page 41 and 42: 35 Appendix C CNF Following is a pa
Page 43 and 44: 37 Missing key bits brute force <st
Page 45: 39 Missing key bits brute force <st

SAT Based Attacks on SipHash - Department of Computer Science

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?