Liaw proposed a broadcasting cryptosystem [H.T. Liaw, Broadcasting cryptosystem in computer networks, Computers & Mathematics with Applications 37 (Mar. 1999) 85-87] which claims to involve fewer broadcasting messages, and has attracted quite some research efforts on iterative analysis and improveme
Cryptanalysis of Liaw's broadcasting Cryptosystem
✍ Scribed by Yuh-Min Tseng; Jinn-Ke Jan
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 195 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
In 1999, Liaw proposed a new broadcasting cryptosystem, which requires smaller bandwidth as compared to the previously proposed broadcasting cryptosystems. However, this article will show that the proposed system is insecure enough by presenting a conspiracy attack on it. We will also point out some ambiguous problems in Liaw's paper. Moreover, we propose an improved broadcasting cryptosystem, which is a slight modification of the proposed system to overcome the conspiracy attack.
📜 SIMILAR VOLUMES
## Received date A new public key cryptosystem was introduced by Wu and Dawson at the Fourth International Conference on Finite Fields (Fq4). This scheme is similar to the McEliece public key cryptosystem, in the sense that it also can be described in terms of linear error-correcting codes over "n
This paper is a cryptanalysis of a recently proposed multi-chaotic systems based image cryptosystem. The cryptosystem is composed of two shuffling stages parameterized by chaotically generated sequences. We propose and implement two different attacks which completely break this encryption scheme.
Recently, a new chaotic cryptosystem using external 128-bit key and multiple chaotic maps has been proposed. In this paper, a fundamental flaw of this cryptosystem is pointed out and a known plaintext attack is presented. Furthermore, a remedial modification is suggested, which avoids the flaw while