On the strength of asymmetric code cryptosystems based on the merging of generating matrices of linear codes

摘要

, i = 1, …, u. In the present paper an algorithm is constructed which can be used to efficiently find such submatrices when a number of easily verified conditions are met. It is shown that the constructed algorithm can be used to clarify the strength of the Sidelnikov cryptosystem and its modification for u = 2.