Research on a piecewise linear chaotic map and its cryptographical application

When piecewise linear chaotic map (PLCM) is used in digital cryptosystem, the multiple iterations are required and the encryption speed becomes low. A new kind of PLCM with a segment number parameter (SNP) is presented to solve this problem. The implementation precision, SNP and the number of iteration are analyzed, and then their functional relationship was developed In the digital cryptosystem using the presented map, the larger the SNP is, the smaller the number of iteration is, and hence the faster the encryption speed is. But the chaotic map and its implementation by hardware become more complex too. With the introduction of the area-time trade-off parameter the most appropriate SNP can be achieved, through which the digital system is optimized.