The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Finding the permutation between equivalent linear codes: the support splitting algorithm
Abstract
Two linear codes are permutation-equivalent if they are equal up to a fixed permutation on the codeword coordinates. We present here an algorithm able to compute this permutation. It operates by determining a set of properties invariant by permutation, one for each coordinate, called a signature. If this signature is fully discriminant-i.e., different for all coordinates-the support of the code splits into singletons, and the same signature computed for any permutation-equivalent code will allow the reconstruction of the permutation. A procedure is described to obtain a fully discriminant signature for most linear codes. The total complexity of the support splitting algorithm is polynomial in the length of the code and exponential in the dimension of its hull, i.e., the intersection of the code with its dual.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Is code equivalence easy to decide?
Petrank, E., & Roth, R. M. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.623157 · Cited by 142
Cited by
How to Achieve a McEliece-Based Digital Signature Scheme
Courtois, N. T., Finiasz, M., & Sendrier, N. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_10 · Cited by 435
Self-citationDecoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Becker, A., Joux, A., May, A., & Meurer, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_31 · Cited by 398
“Either he tries to distinguish the scrambled version C′ of C from a random code by revealing the underlying structure, see [10, 27].”
BackgroundA distinguisher for high rate McEliece cryptosystems
Faugere, J.-C., Gauthier-Umana, V., Otmani, A., Perret, L., & Tillich, J.-P. (2011) · 2011 IEEE Information Theory Workshop · doi:10.1109/itw.2011.6089437 · Cited by 108
“Indeed, although some weak keys have been identified in [21], the only known key-recovery attack is the exhaustive search of the secret polynomial Γ of the Goppa code, and applying the Support Splitting Algorithm (SSA) [29] to check whether the Goppa code candidate is permutation-equivalent to the code defined by the…”
MethodStructural cryptanalysis of McEliece schemes with compact keys
Faugère, J.-C., Otmani, A., Perret, L., de Portzamparc, F., & Tillich, J.-P. (2016) · Designs, Codes and Cryptography · doi:10.1007/s10623-015-0036-z · Cited by 49
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes
Bardet, M., Mora, R., & Tillich, J.-P. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3334592 · Cited by 15
“The most efficient attack of this kind was given in [12] and essentially consists in trying all Goppa polynomials and all possible supports, where the verification consists in solving a code equivalence problem which is often easy with the help of the support splitting algorithm [13].”
Method
Metadata
- Authors
- Sendrier, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2000-07
- Volume
- 46
- Issue
- 4
- Pages
- 1193-1203
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2119117325
- Cited by
- 269
- References
- 3
- FWCI
- 2.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.