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...
| Main Author: | |
|---|---|
| Published: |
Loughborough University
2008
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.507328 |