09-30-2012, 10:28 PM
Its a nice discussion since it is something that user should not but do not face very often, so i never explained it before. It is something in the very deep of oclHashcat-plus.
There are two types of algorithms. Slow ones and fast ones. The slow ones are: 400, 500, 1600, 1800, 2100, 2500 and 3200. All others are fast algorithms.
Fast algorithms have an in-kernel rule engine. On there, if a rule leads to a situation that the password candidate is longer that 15 chars, it is -not- rejected and the test being done is unpredictable.
Slow algorithm have in in-host rule engine. On there, if a rule leads to a situation that the password candidate is longer than 15 chars, it -is- simply rejected.
This should explain your discussion.
There are two types of algorithms. Slow ones and fast ones. The slow ones are: 400, 500, 1600, 1800, 2100, 2500 and 3200. All others are fast algorithms.
Fast algorithms have an in-kernel rule engine. On there, if a rule leads to a situation that the password candidate is longer that 15 chars, it is -not- rejected and the test being done is unpredictable.
Slow algorithm have in in-host rule engine. On there, if a rule leads to a situation that the password candidate is longer than 15 chars, it -is- simply rejected.
This should explain your discussion.