Paper 2022/636
Integer Syndrome Decoding in the Presence of Noise
Vlad-Florin Dragoi, Brice Colombier, Pierre-Louis Cayrel, and Vincent Grosso
Abstract
Code-based cryptography received attention after the NIST started the post-quantum cryptography standardization process in 2016. A central NP-hard problem is the binary syndrome decoding problem, on which the security of many code-based cryptosystems lies. The best known methods to solve this problem all stem from the information-set decoding strategy, first introduced by Prange in 1962. A recent line of work considers augmented versions of this strategy, with hints typically provided by side-channel information. In this work, we consider the integer syndrome decoding problem, where the integer syndrome is available but might be noisy. We study how the performance of the decoder is affected by the noise. We provide experimental results on cryptographic parameters for the BIKE and Classic McEliece cryptosystems, which are finalist and alternate candidates for the third round of the NIST standardization process, respectively.
Note: Submitted for possible publication an ITW.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Code-based cryptographySyndrome decoding problemInformation-set decoding
- Contact author(s)
- vlad dragoi @ uav ro
- History
- 2022-05-23: received
- Short URL
- https://ia.cr/2022/636
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/636,
author = {Vlad-Florin Dragoi and Brice Colombier and Pierre-Louis Cayrel and Vincent Grosso},
title = {Integer Syndrome Decoding in the Presence of Noise},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/636},
year = {2022},
url = {https://eprint.iacr.org/2022/636}
}
