We propose here a non asymptotic complexity analysis of some variants of information set decoding. In particular, we give this analysis for the two recent variants { published by May, Meurer and Thomae in 2011 and by Becker, Joux, May and Meurer in 2012 { for which only an asymptotic analysis was available. The purpose is to provide a simple and accurate estimate of the complexity to facilitate the paramater selection for code-based cryptosystems. We implemented those estimates and give a comparison at the end of the paper
Cryptographic constructions often base security on structured problem variants to enhance efficiency...
Diese Arbeit beschäftigt sich mit der Anwendbarkeit codierungstheoretischer Methoden in der Kryptana...
Fix positive integers B and w. Let C be a linear code over F_2 of length Bw. The 2-regular-decoding ...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
International audienceThe security of code-based cryptography relies primarily on the hardness of ge...
Information set decoding is an algorithm for decoding any linear code. Expressions for the complexit...
The decoding of random linear codes is one of the most fundamental problems in both computational co...
International audienceThe security of code-based cryptography is strongly related to the hardness of...
The syndrome decoding problem lies at the heart of code-based cryptographic constructions. Informati...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
International audienceThe security of code-based cryptography usually relies on the hardness of the ...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
Cryptographic constructions often base security on structured problem variants to enhance efficiency...
Diese Arbeit beschäftigt sich mit der Anwendbarkeit codierungstheoretischer Methoden in der Kryptana...
Fix positive integers B and w. Let C be a linear code over F_2 of length Bw. The 2-regular-decoding ...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
International audienceThe security of code-based cryptography relies primarily on the hardness of ge...
Information set decoding is an algorithm for decoding any linear code. Expressions for the complexit...
The decoding of random linear codes is one of the most fundamental problems in both computational co...
International audienceThe security of code-based cryptography is strongly related to the hardness of...
The syndrome decoding problem lies at the heart of code-based cryptographic constructions. Informati...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
International audienceThe security of code-based cryptography usually relies on the hardness of the ...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
Cryptographic constructions often base security on structured problem variants to enhance efficiency...
Diese Arbeit beschäftigt sich mit der Anwendbarkeit codierungstheoretischer Methoden in der Kryptana...
Fix positive integers B and w. Let C be a linear code over F_2 of length Bw. The 2-regular-decoding ...
Add to ORKG