search

kste / solvatore

An easy to use tool for evaluating the security of cryptographic algorithms against integral attacks.
MIT License
21 stars 11 forks source link

Does not terminate #6

Open acad2 opened 4 years ago

acad2 commented 4 years ago

The program does not seem to terminate for Gift-128 for 12 rounds. Is it a bug? Can a conclusion be drawn if the program does not terminate in a reasonable time such as there is no distinguisher at 12 round Gift-128?

kste commented 4 years ago

If it does not terminate, then the underlying problem generated is too difficult for the solver. This means you can not draw any conclusion on whether a distinguisher exists or not. In general there is not much you can do in such cases, but you can try to help the solver by reducing search space, adding some constraints etc.

acad2 commented 4 years ago

OK, thanks for the reply. Just to be sure, for the Gift-128 12-round case the program (which does not seem to terminate) should actually terminate and print 'no distinguisher'?