In recent years, some authors have tried to utilize the properties of chaos to imple-ment a secure communication system. In their papers, secure communication via chaot-ic synchronization was experimentally demonstrat...In recent years, some authors have tried to utilize the properties of chaos to imple-ment a secure communication system. In their papers, secure communication via chaot-ic synchronization was experimentally demonstrated using Chua’s circuit.展开更多
With the goal of minimizing the enciphered data redundancy R , we first make a feasibility analysis on the PKCS which is based on the PR method, indicating its difficulties in real ap...With the goal of minimizing the enciphered data redundancy R , we first make a feasibility analysis on the PKCS which is based on the PR method, indicating its difficulties in real applications. Then we generalize the method to such a case that an arbitrary number system can be utilized in the system. We form some conditions that should be satisfied when we want to create security keys, to encipher plaintexts or to decipher cryptograms. Finally, a qualitative analysis is made on the improved PR method with the results that the data redundancy R of enciphered text for the improved PR method is far smaller than that of the primitive PR method and its enciphering and deciphering procedures are accordingly sped up. Moreover, the security of the new scheme is by no means worse than that of the old one.展开更多
文摘In recent years, some authors have tried to utilize the properties of chaos to imple-ment a secure communication system. In their papers, secure communication via chaot-ic synchronization was experimentally demonstrated using Chua’s circuit.
文摘With the goal of minimizing the enciphered data redundancy R , we first make a feasibility analysis on the PKCS which is based on the PR method, indicating its difficulties in real applications. Then we generalize the method to such a case that an arbitrary number system can be utilized in the system. We form some conditions that should be satisfied when we want to create security keys, to encipher plaintexts or to decipher cryptograms. Finally, a qualitative analysis is made on the improved PR method with the results that the data redundancy R of enciphered text for the improved PR method is far smaller than that of the primitive PR method and its enciphering and deciphering procedures are accordingly sped up. Moreover, the security of the new scheme is by no means worse than that of the old one.
