Modified Berlekamp-Massey algorithm for approximating the k-error linear complexity of binary sequences

Some cryptographical applications use pseudorandom sequences and require that the sequences are secure in the sense that they cannot be recovered by only knowing a small amount of consecutive terms. Such sequences should therefore have a large linear complexity and also a large k-error linear comple...

Full description

Bibliographic Details

Main Authors:	Alexandra Alecu, Ana Salagean
Format:	Default Text
Published:	2007
Subjects:	Other information and computing sciences not elsewhere classified Pseudorandom sequences Stream ciphers Linear complexity K-error linear complexity Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/3287
Tags:	Add Tag No Tags, Be the first to tag this record!