• DocumentCode
    1683056
  • Title

    Complexity measures for cryptographic sequences

  • Author

    Penzhorn, W.T.

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Pretoria Univ., South Africa
  • fYear
    1991
  • fDate
    8/30/1991 12:00:00 AM
  • Firstpage
    178
  • Lastpage
    185
  • Abstract
    Maximum order complexity, which is a generalization of linear complexity, is discussed. An efficient algorithm with linear time and memory requirements is available for its calculation. The Lempel-Ziv complexity measure forms the basis of a very efficient universal source coding algorithm. The relationship between these two complexity measures is discussed
  • Keywords
    computational complexity; cryptography; Lempel-Ziv complexity measure; algorithm; cryptographic sequences; maximum order complexity; universal source coding algorithm; Cryptography; Feedback; Length measurement; Prediction algorithms; Random sequences; Security; Shift registers; Source coding; Statistics; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Signal Processing, 1991. COMSIG 1991 Proceedings., South African Symposium on
  • Conference_Location
    Pretoria
  • Print_ISBN
    0-7803-0040-8
  • Type

    conf

  • DOI
    10.1109/COMSIG.1991.278245
  • Filename
    278245
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1683056