On lower bounds for information set decoding over 𝔽q and on the effect of partial knowledge Online publication date: Mon, 09-Jan-2017
by Robert Niebuhr; Edoardo Persichetti; Pierre-Louis Cayrel; Stanislav Bulygin; Johannes Buchmann
International Journal of Information and Coding Theory (IJICOT), Vol. 4, No. 1, 2017
Abstract: Code-based cryptosystems are promising candidates for post-quantum cryptography since they are fast, require only basic arithmetic because their security is well understood. The increasing number of cryptographic schemes based on codes over fields other than 𝔽2 presents, however, security issues that are not relevant in the case of binary codes; the security of such constructions, therefore, requires separate assessment. Information set decoding (ISD) is one of the most important generic attacks against code-based cryptosystems. We give lower bounds for ISD over 𝔽q, thereby anticipating future software and hardware improvements. Our results allow to compute conservative parameters for cryptographic applications. While most security proofs assume that an attacker does not have any additional information about the secret, we show that in certain scenarios an attacker can gain partial knowledge of the secret. We present how this knowledge can be used to improve the efficiency of an attack and give new bounds for the complexity of such an attack. In this paper, we analyse two types of partial knowledge including concrete scenarios and give an idea how to prevent the leakage of such knowledge to an attacker.
Online publication date: Mon, 09-Jan-2017
If you still need assistance, please email email@example.com