How to Achieve a McEliece-Based Digital Signature Scheme
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The average dimension of the hull of cyclic codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
Cryptanalysis of the Sidelnikov Cryptosystem
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
McEliece Cryptosystem Implementation: Theory and Practice
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Provably Secure Code-Based Threshold Ring Signatures
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
McEliece and niederreiter cryptosystems that resist quantum fourier sampling attacks
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
On the triple-error-correcting cyclic codes with zero set {1, 2i + 1, 2i + 1}
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
| Hi-index | 754.84 |
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