Abstract
Designing speech cryptosystems presents huge challenges. This paper introduces a novel speech scrambling approach that leverages the strength of two chaotic maps and nested segments. Initially, the process of the scrambling determines the starting point of each segment after diverse parameters are provided, such as the starting point of the first piece and the length of each segment. Then, based on a rearranged chaotic signal generated by the Tent map, the process commences permuting the samples of the nested segments with a specific order that determined according to another rearranged chaotic signal created using the Logistic map. In order to allow the possibility of permuting the samples beyond their initial segment, the process of scrambling iterates throughout the whole signal several times, using a supplied key. The achieved outcomes shows the efficiency of the planned method, as SNR values can reach − 3 and infinity in scrambling and unscrambling operations, respectively, as well, the waveforms vividly depict the flawless diffusion of the samples across the length of the signal.