Paper 2021/1097

The Hadamard square of concatenated linear codes

Ivan Chizhov and Alexandra Davletshina


The paper is devoted to the Hadamard square of concatenated linear codes. Such codes consist of codewords that are obtained by concatenation part of the codewords from other codes. It is proved that if the sum of Hadamard squares’ dimensions of the codes used in the concatenation is slightly less than the dimension of the entire space, then the Hadamard square of the concatenated code is equal to the Cartesian product of the Hadamard square of code-components. It means that the cryptanalysis for many code-based post-quantum cryptographic mechanisms built on concatenated codes is equivalent to the cryptanalysis of these mechanisms built on code-components. So using the concatenation of codes from different classes instead of one class of codes, generally speaking, does not increase the cryptographic strength of the mechanisms.

Available format(s)
-- withdrawn --
Public-key cryptography
Publication info
Published elsewhere. Presented in the main program of The 10th Workshop on Current Trends in Cryptology (CTCrypt 2021)
concatenated linear codesHadamard squareHadamard productSchur productcomponent-wise productMcEliece public-key cryptosystempost-quantum cryptography
Contact author(s)
ichizhov @ cs msu ru
sdav94 @ rambler ru
2021-12-07: withdrawn
2021-08-26: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.