Title :
Complexity measures for cryptographic sequences
Author_Institution :
Dept. of Electr. & Electron. Eng., Pretoria Univ., South Africa
fDate :
8/30/1991 12:00:00 AM
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;
Conference_Titel :
Communications and Signal Processing, 1991. COMSIG 1991 Proceedings., South African Symposium on
Conference_Location :
Pretoria
Print_ISBN :
0-7803-0040-8
DOI :
10.1109/COMSIG.1991.278245
