  We show that here standard decoding algorithms for generic linear codes over
a finite field can speeded up by a factor which is essentially the size of the
finite field by reducing it to a low weight codeword problem and working in the
relevant projective space. We apply this technique to SDitH and show that the
parameters of both the original submission and the updated version fall short
of meeting the security requirements asked by the NIST.
