This paper presents an automated attack for crypt-analysis of transform-based analog speech scramblers. In this system, the key estimate is recovered by imbedding the discrete key in a continuous set and maximizing the statistical likelihood function over the continuous keyspace. Furthermore, a novel likelihood maximization algorithm has been developed to account for the doubly stochastic constraint of the underlying keyspace. It is shown that the proposed statistical cryptanalysis appears useful in breaking the scrambled speech under a ciphertext only attack.
|Number of pages||5|
|Journal||National Conference Publication - Institution of Engineers, Australia|
|Issue number||94 /9|
|State||Published - 1 Dec 1994|
|Event||Proceedings of the International Symposium on Information Theory & Its Applications 1994. Part 1 (of 2) - Sydney, Aust|
Duration: 20 Nov 1994 → 24 Nov 1994