Paper 2023/1865
Projective Space Stern Decoding and Application to SDitH
Abstract
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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint.
- Keywords
- Code-based cryptographyStern algorithmsignature schemeSDitHprojective space
- Contact author(s)
-
kevin carrier @ cyu fr
valerian hatey @ ensea fr
jean-pierre tillich @ inria fr - History
- 2023-12-06: approved
- 2023-12-05: received
- See all versions
- Short URL
- https://ia.cr/2023/1865
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1865,
author = {Kevin Carrier and Valérian Hatey and Jean-Pierre Tillich},
title = {Projective Space Stern Decoding and Application to SDitH},
howpublished = {Cryptology ePrint Archive, Paper 2023/1865},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1865}},
url = {https://eprint.iacr.org/2023/1865}
}
