搜索结果: 1-6 共查到“军事学 Linear codes”相关记录6条 . 查询时间(0.14 秒)
Actively Secure OT-Extension from q-ary Linear Codes
cryptographic protocols oblivious transfer
font style='font-size:12px;'>
2018/6/19
We consider recent constructions of 11-out-of-NN OT-extension from Kolesnikov and Kumaresan (CRYPTO 2013) and from Orrú et al. (CT-RSA 2017), based on binary error-correcting codes. We generalize thei...
Decoding Linear Codes with High Error Rate and its Impact for LPN Security
Decoding binary linear codes BJMM Nearest Neighbors
font style='font-size:12px;'>
2017/11/28
Technically, our improvement comes from the heavy use of Nearest Neighbor techniques in all steps of the construction, whereas the BJMM-algorithm can only take advantage of Nearest Neighbor search in ...
Squares of Random Linear Codes
Error-correcting codes Schur-product codes
font style='font-size:12px;'>
2016/1/8
Given a linear code C, one can define the d-th power of C as the span of all componentwise products of d elements of C. A power of C may quickly fill the whole space. Our purpose is to answer the foll...
Linear codes with few weights from weakly regular bent functions based on a generic construction
Linear codes weight distribution p-ary functions
font style='font-size:12px;'>
2015/12/21
We contribute to the knowledge of linear codes with few weights from special polynomials
and functions. Substantial efforts (especially due to C. Ding) have been directed
towards their study in the ...
Information-set decoding for linear codes over Fq
Generalized McEliece cryptosystem security analysis Stern attack
font style='font-size:12px;'>
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...
Primal-dual distance bounds of linear codes with application to cryptography
Boolean function dual distance linear code minimum distance
font style='font-size:12px;'>
2009/2/13
Let N(d, d⊥) denote the minimum length n of a
linear code C with d and d⊥, where d is the minimum Hamming
distance of C and d⊥ is the minimum Hamming distance of C⊥.
In this paper, we show a lower ...