A new speech scrambling concept based on Hadamard matrices
暂无分享,去创建一个
[1] Fred Piper,et al. Secure Speech Communications , 1985 .
[2] Jeffrey S. Leon,et al. An Algorithm for Computing the Automorphism Group of a Hadamard Matrix , 1979, J. Comb. Theory, Ser. A.
[3] R. V. Cox,et al. Analog scramblers for speech based on sequential permutations in time and frequency , 1983, The Bell System Technical Journal.
[4] Romano Fantacci,et al. A new speech signal scrambling method for secure communications: theory, implementation, and security evaluation , 1989, IEEE J. Sel. Areas Commun..
[5] Keiichiro Koga,et al. An analog speech scrambling system using the FFT technique with high-level security , 1989, IEEE J. Sel. Areas Commun..
[6] Keiichiro Koga,et al. A Speech Scrambler Using the Fast Fourier Transform Technique , 1984, IEEE Journal on Selected Areas in Communications.
[7] J.L. Massey. The theory of error-correcting codes , 1980, Proceedings of the IEEE.
[8] Ed Dawson,et al. Design and Cryptanalysis of Transform-Based Analog Speech Scamblers , 1993, IEEE J. Sel. Areas Commun..
[9] Ed Dawson,et al. The Automated Cryptanalysis of Analog Speech Scramblers , 1991, EUROCRYPT.
[10] Vlado Delic,et al. A new speech scrambling method: Comparative analysis and a fast algorithm , 1996, 1996 8th European Signal Processing Conference (EUSIPCO 1996).
[11] Lin-shan Lee. A speech security system not requiring synchronization , 1985, IEEE Communications Magazine.
[12] A. Street,et al. Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .