Security Analysis of Chaotic Baker Maps

摘要

This paper presents a detailed analysis of the security characteristics of chaotic Baker Maps and presents suggestions to improve its security characteristics. The number of possible keys for a baker map is derived using closed form solutions. It is shown that for a reasonable size baker map a large number of possible keys exists, making a brute force attack infeasible. However, it is shown that baker maps have very poor security characteristics under known attacks. Specifically, a baker map of size N can be broken in N iterations or less. This weakness can limit the usefulness of using baker maps as is in encryption. Modified techniques are needed to improve the security of baker maps, some of which are suggested in this paper.