An automated method for cryptanalysis of DFT-based analog speech scramblers is presented through statistical estimation treatments. In the proposed system, the ciphertext only attack is formulated as a combinatorial optimization problem leading to a search for the most likely key estimate. For greater efficiency, we also explore the benefits of genetic algorithm to develop an estimation method which takes into account the doubly stochastic characteristics of the underlying keyspace. Simulation results indicate that the global explorative properties of genetic algorithms make them very effective at estimating the most likely permutation and by using this estimate significant amount of the intelligibility can be recovered from the ciphertext following the attack on DFT-based speech scramblers.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Wen-Whei CHANG, Heng-Iang HSU, "The Automated Cryptanalysis of DFT-Based Speech Scramblers" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 12, pp. 2107-2112, December 2000, doi: .
Abstract: An automated method for cryptanalysis of DFT-based analog speech scramblers is presented through statistical estimation treatments. In the proposed system, the ciphertext only attack is formulated as a combinatorial optimization problem leading to a search for the most likely key estimate. For greater efficiency, we also explore the benefits of genetic algorithm to develop an estimation method which takes into account the doubly stochastic characteristics of the underlying keyspace. Simulation results indicate that the global explorative properties of genetic algorithms make them very effective at estimating the most likely permutation and by using this estimate significant amount of the intelligibility can be recovered from the ciphertext following the attack on DFT-based speech scramblers.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_12_2107/_p
Copy
@ARTICLE{e83-d_12_2107,
author={Wen-Whei CHANG, Heng-Iang HSU, },
journal={IEICE TRANSACTIONS on Information},
title={The Automated Cryptanalysis of DFT-Based Speech Scramblers},
year={2000},
volume={E83-D},
number={12},
pages={2107-2112},
abstract={An automated method for cryptanalysis of DFT-based analog speech scramblers is presented through statistical estimation treatments. In the proposed system, the ciphertext only attack is formulated as a combinatorial optimization problem leading to a search for the most likely key estimate. For greater efficiency, we also explore the benefits of genetic algorithm to develop an estimation method which takes into account the doubly stochastic characteristics of the underlying keyspace. Simulation results indicate that the global explorative properties of genetic algorithms make them very effective at estimating the most likely permutation and by using this estimate significant amount of the intelligibility can be recovered from the ciphertext following the attack on DFT-based speech scramblers.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - The Automated Cryptanalysis of DFT-Based Speech Scramblers
T2 - IEICE TRANSACTIONS on Information
SP - 2107
EP - 2112
AU - Wen-Whei CHANG
AU - Heng-Iang HSU
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2000
AB - An automated method for cryptanalysis of DFT-based analog speech scramblers is presented through statistical estimation treatments. In the proposed system, the ciphertext only attack is formulated as a combinatorial optimization problem leading to a search for the most likely key estimate. For greater efficiency, we also explore the benefits of genetic algorithm to develop an estimation method which takes into account the doubly stochastic characteristics of the underlying keyspace. Simulation results indicate that the global explorative properties of genetic algorithms make them very effective at estimating the most likely permutation and by using this estimate significant amount of the intelligibility can be recovered from the ciphertext following the attack on DFT-based speech scramblers.
ER -