Một tinh chỉnh hiệu quả cho Bộ tạo dãy giả ngẫu nhiên Massey-Rueppel hướng phần cứng
Abstract— Random numbers and sequences play an important role in cryptography. Generating a true random source is quite costly, so almost recent systems use pseudorandom number generators. Pseudorandom sequence generators Massey-Rueppel, which was proposed in 1984, is one of the most popular pseudorandom sequence generators using the linear feedback shift registers by its efficiency and sufficiently mathematical proofs. However, this generator is only efficient in hardware implementation when the number of non-zero coefficients in its linear feedback polynomial is small. In this paper, we proposed an improvement for this generator but never mind what coefficients of its linear feedback polynomial are. We have proved that the proposed generator also owns good cryptographic properties as same as the original one, while the efficiency is better in the hardware implementaion. Moreover, we have evaluated some statistical random tests for the output sequences. The results show that output sequences attain pseudorandomness which suitable for theoretical properties.
|
Tài liệu tham khảo [1]. Klein, A, “Stream ciphers”, Springer, 2013. [2]. Massey, J.L. and R.A. Rueppel. “Linear Ciphers and Random Sequence Generators with Multiple Clocks” in EUROCRYPT. Springer, 1984. [3]. Kunuth, D, “The Art of Computer Programming” vol. 2 Seminumerical Algorithms, Reading, Massachusetts: Addison Wesley, 1998. [4]. Doğanaksoy, A. and F. Göloğlu. “On Lempel-Ziv complexity of sequences”. in International Conference on Sequences and Their Applications, Springer, 2006. |
Hoàng Đình Linh, Nguyễn Văn Long
