Security comments on the Hwang-Chen algebraic-code cryptosystem (Q4373640)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1107695
Language Label Description Also known as
default for all languages
No label defined
    English
    Security comments on the Hwang-Chen algebraic-code cryptosystem
    scientific article; zbMATH DE number 1107695

      Statements

      7 June 1998
      0 references
      private-key
      0 references
      cryptosystem
      0 references
      Hwang-Chen scheme
      0 references
      complexity
      0 references
      Security comments on the Hwang-Chen algebraic-code cryptosystem (English)
      0 references
      \textit{T. Hwang} and \textit{Y. Chen} [Algebraic-code cryptosystem using random code chaining, IEEE Conference on Computer and Communication Systems (IEEE TENCON '90), 24-27 September 1990, Hong Kong, Vol. 1, 194-196 (1990)] have proposed a private-key cryptosystem that provides joint error correction, encryption, and ``message'' integrity. The scheme is based on algebraic error-correcting codes, using random chaining technique. In this paper, a chosen-plaintext attack is presented that is able to break the system, requiring \(O[(n-k) 2^{k/2}]\) ciphertexts and \(O[(n-k) 2^k]\) operations; the attack is based on obtaining a combinatorially equivalent code. Finally, a modified version of the scheme is proposed that overcomes the weaknesses of the original Hwang-Chen scheme; the complexity to break this modified scheme is \(O(k2^{n/2})\) ciphertexts and \(O(kn2^{n/2})\) operations. For the entire collection see [Zbl 0877.00018].
      0 references

      Identifiers