搜索结果: 1-7 共查到“密码学 Information Set Decoding”相关记录7条 . 查询时间(0.187 秒)
Quantum Information Set Decoding Algorithms
code-based cryptography quantum cryptanalysis decoding algorithm
2017/3/6
The security of code-based cryptosystems such as the McEliece cryptosystem relies primarily on the difficulty of decoding random linear codes. The best decoding algorithms are all improvements of an o...
May-Ozerov Algorithm for Nearest-Neighbor Problem over $\mathbb{F}_{q}$ and Its Application to Information Set Decoding
code-based cryptography random linear code information set decoding
2016/3/4
May and Ozerov proposed an algorithm for the nearest-neighbor problem of vectors over the binary field at EUROCRYPT 2015. They applied their algorithm to the decoding problem of random linear codes ov...
Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes
information set decoding code-based cryptography
2016/1/9
The most important drawback to code-based cryptography
has historically been its large key sizes. Recently, several promising approaches
have been proposed to reduce keysizes. In particular, signifi...
A Non Asymptotic Analysis of Information Set Decoding
public-key cryptography / cryptanalysis code-based cryptography
2013/4/18
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 Thoma...
Faster 2-regular information-set decoding
Information-set decoding 2-regular decoding FSB binary
2011/3/11
Fix positive integers B and w. Let C be a linear code over F2
of length Bw. The 2-regular-decoding problem is to find a nonzero codeword
consisting of w length-B blocks, each of which has Hamming we...
Faster 2-regular information-set decoding
secret-key cryptography / Information-set decoding 2-regular decoding FSB binary codes
2012/3/29
Fix positive integers B and w. Let C be a linear code over F_2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of which has Hammi...
Information-set decoding for linear codes over Fq
Generalized McEliece cryptosystem security analysis Stern attack
2009/12/29
A code-based cryptosystem is considered secure if the best known attack against it
is information-set decoding. Stern’s algorithm and its improvements are well optimized and the
complexity is reason...