ISSN 0253-2778

CN 34-1054/N

open

An algorithm for computing all the critical points of exponent periodic sequences

  • The k-error linear complexity of periodic sequences is an important security indice of stream cipher systems. The k-error linear complexity decreases as the number of errors k increases, that the critical points are those where a decrease occurs in the k-error linear complexity. The pn periodic sequences over the finite field GF(pm) were focused upon, where p is a prime. Some properties of the k-error linear complexity were discussed, and an algorithm was presented for computing all the critical points for a given sequence.
  • loading

Catalog

    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return