Research On Symmetrical Key Cryptography In Security Mechanisms Of Wireless Networks

Cipher is the core of network and information security. Generally, the problem about cryptology comes down to the design and analysis of cipher algorithms and protocols. The research background of this paper is based on information security problems in three typical wireless networks (IEEE 802.11 Wireless Local Area Network, IEEE 802.16 Broadband Wireless Access Network and mobile communication network); the focal study point is authentication algorithm; the cryptography (coding) is taken as the research thread; and the cryptanalysis is served as the study tool of performance analysis. The author bends himself to design secure and efficient cipher algorithms and protocols. Main content of this paper is as follows.1) Generally, those common used authentication modes of block cipher algorithm are designed by way of single block. This has limited the speed of authentication modes. A fast authentication mode based on chaining & counter (CCTR) is put forward in this paper. Test results indicated that the speed of CCTR mode is about 30% faster than that of authentication modes in common use (for example, CBC-MAC mode).2) The existing parallelizable authentication mode, PMAC has introduced a pseudorandom sequence. This brings about that its total amount of computation is more than that of authentication modes in common use. A fast parallelizable authentication mode on the basis of multi-block (PMB) is advanced in this paper. Test results indicated that the speed of PMB mode is about 30% faster than that of authentication modes in common use, too.3) A hash function based on triple-block chaining (HTBC) is brought forward in this paper. Test results showed that the speed of HTBC algorithm is slightly faster (about 5%) than that of hash functions in common use (for instance, SHA1 algorithm).4) The existing one-way hash functions without trapdoor are all iterative algorithms, for instance, MD and SHA family, etc. A Parallelizable hash function on the basis of triple-block (PHTB) is proposed in this paper. Test results displayed that the series speed of PHTB algorithm is between that of SHA1 and the one of MD5 algorithm.5) The author demonstrated the securities of four new algorithms (CCTR, PMB, HTBC and PHTB). And the AES algorithm was used to test these algorithms. The dependence test results accorded with the demands. Each new algorithm was complete; its degree of avalanche effect was about 0.9993; its degree of strict avalanche criterion was 0.992 or so. The frequency test results indicated that the output generated by each new algorithm had uniformity. The binary matrix rank test results implied that it was linear independent among...