i>
</ul>

If the 46 leftmost bytes do not match, the message that is to be signed is modified, resulting in a new hash value.
Again, by extracting the cube root and raising to the third power, it is checked whether the new hash value results
in a correct signature.
This process is repeated until the 46 leftmost bytes remain unchanged, which leads to a signature that is accepted as
valid by faulty implementations.</br>
In each iteration of this algorithm a cube root and a hash value have to be calculated. As