Details

Autor(en) / Beteiligte

• Baldi, Marco
• Barenghi, Alessandro
• Chiaraluce, Franco
• Pelosi, Gerardo
• Santini, Paolo

Titel

A Finite Regime Analysis of Information Set Decoding Algorithms

Ist Teil von

• Algorithms, 2019-10, Vol.12 (10), p.209

Ort / Verlag

Basel: MDPI AG

Erscheinungsjahr

2019

Quelle

Electronic Journals Library

Beschreibungen/Notizen

• Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems. In particular, both correcting an error-affected codeword, and deriving the error vector corresponding to a given syndrome were proven to be equally difficult tasks. Since the pioneering work of Eugene Prange in the early 1960s, a significant research effort has been put into finding more efficient methods to solve the random code decoding problem through a family of algorithms known as information set decoding. The obtained improvements effectively reduce the overall complexity, which was shown to decrease asymptotically at each optimization, while remaining substantially exponential in the number of errors to be either found or corrected. In this work, we provide a comprehensive survey of the information set decoding techniques, providing finite regime temporal and spatial complexities for them. We exploit these formulas to assess the effectiveness of the asymptotic speedups obtained by the improved information set decoding techniques when working with code parameters relevant for cryptographic purposes. We also delineate computational complexities taking into account the achievable speedup via quantum computers and similarly assess such speedups in the finite regime. To provide practical grounding to the choice of cryptographically relevant parameters, we employ as our validation suite the ones chosen by cryptosystems admitted to the second round of the ongoing standardization initiative promoted by the US National Institute of Standards and Technology.