supported by the National Natural Science Foundation of China (60833008);the Science and Technology on Communication Security Laboratory (9140C110201110C1102);the Fundamental Research Funds for the Central Universities (K5051270003, K50511010007)
Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introd...
supported by the National Natural Science Foundation of China under Grant No. 61063041;the Program for New Century Excellent Talents of Universities in Fujian Province under Grant No. JK2010047;the Funds of the Education Department of Gansu Province under Grant No. 1001-09
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k sym...
Supported by the National Hi-Tech Research & Devel-opment Plan of China (863 Project) (No.2003AA143040) and Jiangsu Provincial Key Laboratory of Network & Information Security (No.BM2003201).
A fast authentication mode based on Multi-Block Chaining (MBC) is put forward; and its security is proved. The MBC mode is for new generation block cipher algorithms. Its speed is about 13% faster than that of the aut...
This paper discusses pseudo-randomness of a periodic sequence, named the fourth class of GSS sequence. We get the following results: ① Its least period always reaches the maximum (that is, 2n-1). ② Its least period ...