Algorithms for the k-error linear complexity of cryptographic sequences over finite fields

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. The security of the sequences is translated into several measurable characteristics. For example they...

Full description

Bibliographic Details

Main Author:	Alexandra Alecu
Format:	Default Thesis
Published:	2008
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/36133
Tags:	Add Tag No Tags, Be the first to tag this record!