Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q)
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Linear Cryptanalysis of Bluetooth Stream Cipher
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Fast Correlation Attack Algorithm with List Decoding and an Application
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
On a resynchronization weakness in a class of combiners with memory
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
| Hi-index | 754.84 |
A novel analytical approach to performance evaluation of soft-decoding algorithms for binary linear block codes based on probabilistic iterative error correction is presented. A convergence condition establishing the critical noise rate below which the expected bit-error probability tends to zero is theoretically derived. It explains the capability of iterative probabilistic decoding of binary linear block codes with sparse parity-check matrices to correct, with probability close to one, error patterns with the number of errors (far) beyond half the code minimum distance. Systematic experiments conducted on truncated simplex codes seem to agree well with the convergence condition. The method may also be interesting for the theoretical analysis of the so-called turbo codes