Abstract:
The equivalence classes of secret keys of McEliece–Sidelnikov-type cryptosystems are investigated. We introduce the concept of codes with decomposable square and find relationships characterizing the equivalence classes in case when the cryptosystem is based on such codes. Some results for the specific case of using generalized Reed-Solomon codes are refined. Several examples of codes based on generalized Reed-Solomon codes with guaranteed indecomposable square are given.
Citation:
V. V. Vysotskaya, “On the structural features of the key space of the McEliece–Sidelnikov cryptosystem based on generalized Reed–Solomon codes”, Diskr. Mat., 36:4 (2024), 28–43
\Bibitem{Vys24}
\by V.~V.~Vysotskaya
\paper On the structural features of the key space of the McEliece--Sidelnikov cryptosystem based on generalized Reed--Solomon codes
\jour Diskr. Mat.
\yr 2024
\vol 36
\issue 4
\pages 28--43
\mathnet{http://mi.mathnet.ru/dm1842}
\crossref{https://doi.org/10.4213/dm1842}
Citation in format AMSBIB
Contact us: