Loading...
Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
Löndahl, C ; Sharif University of Technology
397
Viewed
- Type of Document: Article
- DOI: 10.1007/s10623-015-0099-x
- Publisher: Springer New York LLC
- Abstract:
- 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
- Keywords:
- Low-weight codeword ; Block codes ; Cryptography ; Decoding ; Public key cryptography ; Codeword ; Information Set Decoding (ISD) ; Key recovery attacks ; McEliece ; MDPC codes ; Parity check codes ; Public key cryptosystems ; Quasicyclic codes ; Codes (symbols)
- Source: Designs, Codes, and Cryptography ; Volume 80, Issue 2 , 2016 , Pages 359-377 ; 09251022 (ISSN)
- URL: https://link.springer.com/article/10.1007/s10623-015-0099-x