The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Speech encryption based on fast Fourier transform permutation
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Therefore, the number of all possible permutations is 128! 3.85E 215 25, 26 .”
From Chaotic Image Encryption Design Using Tompkins-Paige Algorithm (2009) · cites this paper as [25]
Citations
Cites
Bishop, O. (2007) · Routledge eBooks · doi:10.4324/9780080477527-64 · Cited by 24,949
Applied Combinatorial Mathematics.
Thompson, G. L., & Beckenbach, E. F. (1967) · Journal of the American Statistical Association · doi:10.2307/2284007 · Cited by 191
Beker, H. J., & Piper, F. C. (1985) · Medical Entomology and Zoology · Cited by 74
An analog speech scrambling system using the FFT technique with high-level security
Matsunaga, A., Koga, K., & Ohkawa, M. (1989) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.17718 · Cited by 58
ATM: the broadband telecommunications solution
CUTHBERT, L. G., & Sapanel, J.-C. (1993) · Institution of Engineering and Technology eBooks · doi:10.1049/pbte029e · Cited by 49
Introduction to Digital Signal Processing
Johnson, J. R. (1989) · Medical Entomology and Zoology · Cited by 31
Cited by
Chaotic Image Encryption Design Using Tompkins-Paige Algorithm
Etemadi Borujeni, S., & Eshghi, M. (2009) · Mathematical Problems in Engineering · doi:10.1155/2009/762652 · Cited by 74
Self-citation
Metadata
- Authors
- Borujeni, S. E.
- Affiliations
- University of Isfahan (IR)
- Corresponding author
- Borujeni, S.E.
- ORCID
- Borujeni, S.E.
- Venue
- ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445)
- Publisher
- IEEE
- Published
- 2002-11-11
- Volume
- 1
- Pages
- 290-293
- OpenAlex
- W2138014737
- Cited by
- 27
- References
- 6
- Citations by year
- 2025: 1 · 2022: 1 · 2021: 1 · 2019: 2 · 2017: 2 · 2015: 1 · 2014: 3 · 2012: 3
- FWCI
- 0.60
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Electronics, Circuits and Systems (ICECS) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Signal Processing › Speech and Audio Processing
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Keywords
- speech encryption, speech scrambling, permutation matrices, mobile communication security, speech quality
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
