scientific article; zbMATH DE number 2154094
The author's summary: ``Using linear complementary codes to construct private-key cryptosystem was first proposed by da Rocha. The scheme eliminates the need of the \(2^{n-k}\) table of errors and their corresponding syndromes, which is required for some private-key systems based on linear error-correcting codes such as the Rao-Nam scheme, where \(n\) and \(k\) are the length and dimension of the underlying code, respectively. The da Rocha scheme, however, was modified to prevent its weakness. In this paper, the security of the two schemes is more closely examined. Furthermore, a new scheme is presented that overcomes all the weaknesses of the previous schemes. The complexity to break this new scheme is \(O(2^n)\). In addition, the information rate of the new scheme is one which is not achieved by all known cryptosystems, whether public-key or private-key, that are based on linear error-correcting codes. For the entire collection see [Zbl 0944.00096].
- scientific article; zbMATH DE number 1498781
- scientific article; zbMATH DE number 1498814
- scientific article; zbMATH DE number 4057444
- scientific article; zbMATH DE number 4033660
- A public-key encryption scheme based on non-linear indeterminate equations
- A PUBLIC KEY CRYPTOSYSTEM BASED ON COMPLEMENTING SETS
- A multivariate cryptosystem inspired by random linear codes
- Private-key algebraic-code encryptions
- scientific article; zbMATH DE number 5973815
- On the optimality of non-linear computations for symmetric key primitives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664641)
