|
Organizers |
Generalization of the Massey-Berlekamp algorithm for vector-valued pseudo random sequences
by
Franz Pichler
University Linz
The quality of pseudo random sequences for its use in stream ciphering can be tested by the Massey-Berlekamp algorithm by the determination of its linear complexity profile.The lecture introduces the "Rissanen algorithm" as a new method to make such a test for vector-valued sequences possible.It uses the results of the linear realization theory of Rudolf Kalman (1969) together with the the effecetive recursive method of Jormi Rissanen to compute partial realizations.
Date received: May 13, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawc-62.