Security Analysis Of Cryptographic Algorithms Based On Kolmogorov Complexity

Information security has become increasingly complex and diverse because of the rapid development of network and computer technology.In order to ensure security of the comnunication system,the security analysis of cryptographic algorithms should be studied,especially the security model,randomness and one-way trapdoor properties.This thesis mainly uses Kolmogorov complexity as the main tool for the securi-ty analysis of cryptographic algorithms.Kolmogorov complexity is a measure of ran-domness or amount of information in an individual object.Kolmogorov complexity is closely related to computational complexity and randonness.So we use Kolmogorov complexity to analyze the one-way trapdoor property of cryptographic algorithms.The main research results and innovations of this thesis are described as follows:1.In order to analysis the randomness of cryptographic algorithms,a security mod-el based on time-bounded Kolmogorov complexity is established.Then Kolmogorov complexity is used to characterize the randomness for encryption algorithm In secret sharing and conference key distribution schemes.2.In order to analysis the randomness of cryptographic algorithms,security of cryptographic algorithms is based on Kolmogorov one-way functions.Time bound-ed Kolmogorov complexity is used to characterize the one-wayness of cryptographic algorithms including encryption algorithm and secret sharing.3.Kolmogorov complexity is used to characterize the one-way trapdoor functions.Elliptic curve is a very useful tool to construct one-way trapdoor functions.We use Kolmogorov complexity to characterize the hardness of elliptic curve discrete logarithm problem and bilinear DiffIe-Hellman problem.Moreover,we propose a new mutual authentication scheme for wireless body area networks·Finally,we have made a summary and prospect of the study work on security analysis of cryptographic algorithm based on Kolomogorov complexity.