2001
DOI: 10.1007/3-540-45325-3_1
|View full text |Cite
|
Sign up to set email alerts
|

A Statistical Decoding Algorithm for General Linear Block Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(8 citation statements)
references
References 3 publications
0
7
0
Order By: Relevance
“…Stability of results of cryptographic techniques refers that encryption and decryption always gives the same results. If the stability of the results of encryption and decryption provided is analysed, it can be seen that traditional cryptographic algorithms depends on the implementation conditions [24]. Implementation conditions include the platform and the lan-guage limitations used to encode the algorithm.…”
Section: Dna Cryptographymentioning
confidence: 99%
“…Stability of results of cryptographic techniques refers that encryption and decryption always gives the same results. If the stability of the results of encryption and decryption provided is analysed, it can be seen that traditional cryptographic algorithms depends on the implementation conditions [24]. Implementation conditions include the platform and the lan-guage limitations used to encode the algorithm.…”
Section: Dna Cryptographymentioning
confidence: 99%
“…Later constructions also use it as a black box to derive their parameters [44,42]. In this particular regime, the best attacks are the folklore Gaussian attack and the Pooled Gauss variant [27], ISD algorithms [39,28,14,35,12,36] which may all be seen as refinements of the original Prange algorithm [38] and finally Statistical Decoding [32,23]. More recently, [34] studied the assumption for the same parameter range, but in a more general setting (larger fields or integer rings, not only Bernoulli distribution).…”
Section: Introductionmentioning
confidence: 99%
“…The ISD is more efficient if the decoding problem has only a small number of solutions, whereas GBA is efficient when there are many solutions. Also other ideas such as statistical decoding [1], gradient decoding [2] and supercode decoding [5] have been proposed but fail to outperform ISD algorithms. The input of an ISD algorithm is a corrupted codeword and it outputs the error vector.…”
Section: Introductionmentioning
confidence: 99%