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 |
| id |
ndltd-bl.uk-oai-ethos.bl.uk-507328 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-bl.uk-oai-ethos.bl.uk-5073282019-01-29T03:21:39ZAlgorithms for the k-error linear complexity of cryptographic sequences over finite fieldsAlecu, Alexandra2008Some 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 should have a large linear complexity and also a large k-error linear complexity. This thesis focuses on the k-error linear complexity of sequences. Currently, efficient algorithms for computing the k-error linear complexity of a sequence only exist for special classes of sequences, e.g. of period equal to a power of the characteristic of the field. It is therefore useful to find a general and efficient algorithm to compute a good approximation of the k-error linear complexity.510Loughborough Universityhttps://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.507328https://dspace.lboro.ac.uk/2134/36133Electronic Thesis or Dissertation |
| collection |
NDLTD |
| sources |
NDLTD |
| topic |
510 |
| spellingShingle |
510 Alecu, Alexandra Algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| description |
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 should have a large linear complexity and also a large k-error linear complexity. This thesis focuses on the k-error linear complexity of sequences. Currently, efficient algorithms for computing the k-error linear complexity of a sequence only exist for special classes of sequences, e.g. of period equal to a power of the characteristic of the field. It is therefore useful to find a general and efficient algorithm to compute a good approximation of the k-error linear complexity. |
| author |
Alecu, Alexandra |
| author_facet |
Alecu, Alexandra |
| author_sort |
Alecu, Alexandra |
| title |
Algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| title_short |
Algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| title_full |
Algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| title_fullStr |
Algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| title_full_unstemmed |
Algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| title_sort |
algorithms for the k-error linear complexity of cryptographic sequences over finite fields |
| publisher |
Loughborough University |
| publishDate |
2008 |
| url |
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.507328 |
| work_keys_str_mv |
AT alecualexandra algorithmsforthekerrorlinearcomplexityofcryptographicsequencesoverfinitefields |
| _version_ |
1718968664554733568 |