A New Simple Matrix Representation Method of the BM Algorithm Using in Flowing Cipher Field

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.