DocumentCode
2705753
Title
A New Simple Matrix Representation Method of the BM Algorithm Using in Flowing Cipher Field
Author
Yin, Qian ; Guo, Ping ; Wei, ZuKuan ; He, Zhiyong
Author_Institution
Beijing Normal Univ., Beijing
fYear
2007
fDate
15-19 Dec. 2007
Firstpage
765
Lastpage
768
Abstract
In this paper, a new simple representation of the Berlekamp-Massey algorithm was proposed, which resolves the problem of the length of the shortest linear recurrence in the flowing cipher study. In the process of investigating the Berlekamp-Massey algorithm, using matrix-method can help to simplify the representation of the Berlekamp-Massey algorithm and easily calculate the distributing regulation of the shortest linear recurrence length compared to the traditional method.
Keywords
cryptography; matrix algebra; Berlekamp-Massey algorithm; flowing cipher field; matrix representation; shortest linear recurrence; Computational intelligence; Computer security; Cryptography; Educational institutions; Equations; Information science; Linear feedback shift registers; Polynomials; Random sequences; Shift registers;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security Workshops, 2007. CISW 2007. International Conference on
Conference_Location
Harbin
Print_ISBN
978-0-7695-3073-4
Type
conf
DOI
10.1109/CISW.2007.4425607
Filename
4425607
Link To Document