Speech encryption based on fast Fourier transform permutation

Author

Borujeni, Shahram Etemadi

Author_Institution

Dept. of Comput. Eng., Univ. of Isfahan, Iran

Volume

1

fYear

2000

fDate

2000

Firstpage

290

Abstract

This paper deals with the permutation of FFT (Fast Fourier Transform) coefficients in a speech encryption system. The scrambling algorithm is based on the permutation of the FFT coefficients and provides a highly secured scrambled signal by permuting a large number of those coefficients. The algorithm for the generation the permutation matrices is explained. This system is useful for a band limited telephone channel and mobile communication. Choice and construction of permutation matrices in the scrambling system are considered. Simulation has been carried out by using the C programming language. The results of simulation and tests show that the proposed scrambling achieves extremely high-level security as well as high speech quality

Keywords

cryptography; fast Fourier transforms; matrix algebra; speech coding; C programming language; FFT permutation; band limited telephone channel; fast Fourier transform permutation; high speech quality; high-level security; highly secured scrambled signal; mobile communication; permutation matrices generation algorithm; scrambling algorithm; simulation; speech encryption; Artificial satellites; Communication system security; Cryptography; Fast Fourier transforms; Mobile communication; Privacy; Satellite broadcasting; Speech; Telephony; Transmitters;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on

Conference_Location

Jounieh

Print_ISBN

0-7803-6542-9

Type

conf

DOI

10.1109/ICECS.2000.911539

Filename

911539