  In this paper we address the problem of decoding linearized Reed-Solomon
(LRS) codes beyond their unique decoding radius. We analyze the complexity in
order to evaluate if the considered problem is of cryptographic relevance,
i.e., can be used to design cryptosystems that are computationally hard to
break. We show that our proposed algorithm improves over other generic
algorithms that do not take into account the underlying code structure.
