An automated method of attacking commonly used speech scramblers is presented. The cryptanalysis relies on the availability of the scrambled speech only and makes use of the characteristics of speech. It is shown that some of the currently available time and frequency domain scramblers, based on a fixed permutation can be cryptanalysed. For systems where the permutation is changed with time, methods for partial recovery of the encrypted speech for several existing systems are given. In the case of the frequency domain scramblers a novel method of attack using a codebook is presented.
CITATION STYLE
Goldburg, B., Dawson, E., & Sridharan, S. (1991). The automated cryptanalysis of analog speech scramblers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 547 LNCS, pp. 422–430). Springer Verlag. https://doi.org/10.1007/3-540-46416-6_36
Mendeley helps you to discover research relevant for your work.