Yongge Wang. Linear Complexity versus Pseudorandomness: On Beth and Dai s Result. In Kwok-Yan Lam, Eiji Okamoto, Chaoping Xing, editors, Advances in Cryptology - ASIACRYPT 99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings. Volume 1716 of Lecture Notes in Computer Science, pages 288-298, Springer, 1999.
@inproceedings{Wang99:9,
title = {Linear Complexity versus Pseudorandomness: On Beth and Dai s Result},
author = {Yongge Wang},
year = {1999},
researchr = {https://researchr.org/publication/Wang99%3A9},
cites = {0},
citedby = {0},
pages = {288-298},
booktitle = {Advances in Cryptology - ASIACRYPT 99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings},
editor = {Kwok-Yan Lam and Eiji Okamoto and Chaoping Xing},
volume = {1716},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66666-4},
}