Abstract
Massey’s conjectured algorithm for multi-sequence shift register synthesis is proved, and its suitability for the minimal realization of any linear system is also verified.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Xiao Guozheng et.al, ‘Pseudorandom sequences and their applications’. The National Defense Industry Press of China.
J.L. Massey, ‘Shift-register synthesis and BCH decoding’. IEEE Trans. Infor. Theory, Vol. IT-15, Jan. 1969.
Fang Gueilian and K.K. Tzeng, ‘A Iterative Algorithm for Multi-sequences Synthesis with Shortest LFSR’. Scientia Sinica (Science in China), A. August 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, C. (1988). Proof of Massey’s Conjectured Algorithm. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive