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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Text |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/3287 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|