Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension

被引：0

作者：

Carl Löndahl

Thomas Johansson

Masoumeh Koochak Shooshtari

Mahmoud Ahmadian-Attari

Mohammad Reza Aref

机构：

[1] Lund University,Department of Electrical and Information Technology

[2] K.N. Toosi University of Technology,Faculty of Electrical and Computer Engineering

[3] Sharif University of Technology,Department of Electrical Engineering

来源：

Designs, Codes and Cryptography | 2016年 / 80卷

关键词：

McEliece; MDPC codes; Low-weight codeword; Information-set decoding; Public-key cryptography; 11T71; 11T06;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We present a general purpose algorithm for finding low-weight codewords as well as for decoding a received codeword in any quasi-cyclic code whose length and dimension is a multiple of a power of 2. In this paper, we apply the algorithm on a McEliece variant recently proposed by Misoczki et al. (MDPC-McEliece: New McEliece variants from moderate density parity-check codes, 2013). In their paper, the authors present instances of LDPC codes with increased weight for use in a McEliece type PKC. They claim that all message-recovery and key-recovery attacks can be avoided. We show that this is not true for certain parameters and public-key matrices.

引用

页码：359 / 377

页数：18