Generalized low rank parity check codes.
ITW（2023）
摘要
Let F
q
be the finite field with
q
elements and
m
be a positive integer. The F
qm
-linear low-rank parity-check (LRPC) codes have been used in many cryptographic schemes. Motivated by recent attacks on those schemes, this paper generalizes LRPC codes based on 3-tensors in F
m×m×m
q
. The generalized LRPC codes are mostly F
q
-linear matrix codes, while a particular choice of the 3-tensor is isomorphic to the original F
qm
-linear LRPC codes. We first introduce a bilinear
T
-product over F
m
q
associated with a 3-tensor
T
∈ F
m×m×m
q
. Based on the
T
-product, we propose a generic method to expand F
q
-linear matrix code from dimension
k
to dimension
km
and then use the method to generalize LRPC codes. Finally, we propose two probabilistic polynomial-time decoding algorithms for the generalized LRPC codes under different circumstances. We provide estimates of their decoding failure rates, which, confirmed by experimental results, are almost the same as that of decoding F
qm
-linear LRPC codes.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要