The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information. Due to high processing requirements, traditional encryption algorithms demand considerable computational effort for real-time audio encryption. To address these challenges, this paper presents a permutation for secure audio encryption using a combination of Tent and 1D logistic maps. The audio data is first shuffled using Tent map for the random permutation. The high random secret key with a length equal to the size of the audio data is then generated using a 1D logistic map. Finally, the Exclusive OR (XOR) operation is applied between the generated key and the shuffled audio to yield the cipher audio. The experimental results prove that the proposed method surpassed the other techniques by encrypting two types of audio files, as mono and stereo audio files with large sizes up to 122 MB, different sample rates 22,050, 44,100, 48,000, and 96,000 for WAV and 44,100 sample rates for MP3 of size 11 MB. The results show high Mean Square Error (MSE), low Signal-to-Noise Ratio (SNR), spectral distortion, 100% Number of Sample Change Rate (NSCR), high Percent Residual Deviation (PRD), low Correlation Coefficient (CC), large key space 2616, high sensitivity to a slight change in the secret key and that it can counter several attacks, namely brute force attack, statistical attack, differential attack, and noise attack.
Secured multimedia data has grown in importance over the last few decades to safeguard multimedia content from unwanted users. Generally speaking, a number of methods have been employed to hide important visual data from eavesdroppers, one of which is chaotic encryption. This review article will examine chaotic encryption methods currently in use, highlighting their benefits and drawbacks in terms of their applicability for picture security.
In this work, using GPS which has best accuracy that can be established set of GCPs, also two satellite images can be used, first with high resolution QuickBird, and second has low resolution Landsat image and topographic maps with 1:100,000 and 1:250,000 scales. The implementing of these factors (GPS, two satellite images, different scales for topographic maps, and set of GCPs) can be applying. In this study, must be divided this work into two parts geometric accuracy and informative accuracy investigation. The first part is showing geometric correction for two satellite images and maps.
The second part of the results is to demonstrate the features (how the features appearance) of topographic map or pictorial map (image map), Where i
To achieve safe security to transfer data from the sender to receiver, cryptography is one way that is used for such purposes. However, to increase the level of data security, DNA as a new term was introduced to cryptography. The DNA can be easily used to store and transfer the data, and it becomes an effective procedure for such aims and used to implement the computation. A new cryptography system is proposed, consisting of two phases: the encryption phase and the decryption phase. The encryption phase includes six steps, starting by converting plaintext to their equivalent ASCII values and converting them to binary values. After that, the binary values are converted to DNA characters and then converted to their equivalent complementary DN
... Show More<span>Digital audio is required to transmit large sizes of audio information through the most common communication systems; in turn this leads to more challenges in both storage and archieving. In this paper, an efficient audio compressive scheme is proposed, it depends on combined transform coding scheme; it is consist of i) bi-orthogonal (tab 9/7) wavelet transform to decompose the audio signal into low & multi high sub-bands, ii) then the produced sub-bands passed through DCT to de-correlate the signal, iii) the product of the combined transform stage is passed through progressive hierarchical quantization, then traditional run-length encoding (RLE), iv) and finally LZW coding to generate the output mate bitstream.
... Show MoreVol. 6, Issue 1 (2025)
The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key
... Show More