Projective Space Stern Decoding and Application to SDitH

ePrint Report: Projective Space Stern Decoding and Application to SDitH

Kevin Carrier, Valérian Hatey, Jean-Pierre Tillich

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 …

algorithms application carrier decoding eprint report factor kevin linear low report size space standard stern