Several recently proposed code-based cryptosystems base their security on a
slightly generalized version of the classical (syndrome) decoding problem.
Namely, in the so-called restricted (syndrome) decoding problem, the error
values stem from a restricted set. In this paper, we propose new generic
decoders, that are inspired by subset sum solvers and tailored to the new
setting. The introduced algorithms take the restricted structure of the error
set into account in order to utilize the representation technique efficiently.
This leads to a considerable decrease in the security levels of recently
published code-based cryptosystems.
Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Baldi_M/0/1/0/all/0/1">Marco Baldi</a>, <a href="http://arxiv.org/find/cs/1/au:+Bitzer_S/0/1/0/all/0/1">Sebastian Bitzer</a>, <a href="http://arxiv.org/find/cs/1/au:+Pavoni_A/0/1/0/all/0/1">Alessio Pavoni</a>, <a href="http://arxiv.org/find/cs/1/au:+Santini_P/0/1/0/all/0/1">Paolo Santini</a>, <a href="http://arxiv.org/find/cs/1/au:+Wachter_Zeh_A/0/1/0/all/0/1">Antonia Wachter-Zeh</a>, <a href="http://arxiv.org/find/cs/1/au:+Weger_V/0/1/0/all/0/1">Violetta Weger</a>