A Finite Regime Analysis of Information Set Decoding Algorithms
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...
Main Authors: | Marco Baldi, Alessandro Barenghi, Franco Chiaraluce, Gerardo Pelosi, Paolo Santini |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/10/209 |
Similar Items
-
An asymmetric cryptography using Gaussian integers
by: Wanarat Juraphanthong, et al.
Published: (2020-06-01) -
A New Class of Q-Ary Codes for the McEliece Cryptosystem
by: Jürgen Freudenberger, et al.
Published: (2021-03-01) -
Public-Key Cryptosystems and Bounded Distance Decoding of Linear Codes
by: Selda Çalkavur
Published: (2022-04-01) -
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices
by: Khadijeh Bagheri, et al.
Published: (2017-01-01) -
Secure and Compact: A New Variant of McEliece Cryptosystem
by: Ekta Bindal, et al.
Published: (2024-01-01)