On the Complexity of the Rank Syndrome Decoding Problem.
Saved in:
| Title: | On the Complexity of the Rank Syndrome Decoding Problem. |
|---|---|
| Authors: | Gaborit, Philippe1, Ruatta, Olivier1, Schrek, Julien2 |
| Source: | IEEE Transactions on Information Theory. Feb2016, Vol. 62 Issue 2, p1006-1019. 14p. |
| Subject Terms: | DECODING algorithms, COMPLEXITY (Philosophy), COMPUTATIONAL complexity, ELECTRONIC linearization, POLYNOMIAL time algorithms |
| Abstract: | In this paper, we propose two new generic attacks on the rank syndrome decoding (RSD) problem. Let C be a random [n,k] rank code over GF(q^m) and let y=x+e be a received word, such that x \in C and rank (e)=r . The first attack, the support attack, is combinatorial and permits to recover an error e of rank weight r operations on GF(q) . This new attack improves the exponent for the best generic attack for the RSD problem in the case n > m , by introducing the ratio m/n in the exponential coefficient of the previously best known attacks. The second attack, the annulator polynomial attack, is an algebraic attack based on the theory of q rather than in GF(q) as it is usually the case. We consider two approaches to solve the problem in this new setting. The linearization technique shows that if n \ge (k+1) (r+1)-1 the RSD problem can be solved in polynomial time. More generally, we prove that if , the RSD problem can be solved with an average complexity of O(r^3k^3q^r\lceil (((r+1)(k+1)-(n+1))/r) \rceil ) operations in the base field GF(q) . We also consider solving with Gröbner bases for which we discuss theoretical complexity, we also consider hybrid solving with Gröbner bases on practical parameters. As an example of application, we use our new attacks on all recent cryptosystems parameters, which repair the GPT cryptosystem, we break all examples of published proposed parameters, and some parameters are broken in less than 1 s in certain cases. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!