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.
This study aimed to evaluate oral health (OH) and periodontal diseases (PD) awareness in the Iraqi population.
This study was a questionnaire‐based online survey of two weeks duration. The questionnaire was built using a Google platform and was distributed randomly via social media (Facebook and Telegram). The questionnaire consisted of a demographic data section and two other main sections for the evaluation of OH and PD awareness. Each response was marked with “1” for a positive answer and “0” for the other answers. For each respondent, answers were summed to give
On the basis of known coumarin-based prodrug system, a novel coumarin-based mutual prodrug of 5-fluorouracil and dichloroacetic acid was designed, synthesized and evaluated as a promising oral chemotherapeutic agent basing on in vitro stability study in HCl buffer (pH 1.2) and in phosphate buffer (pH 7.4), as well as in vitro release study in human serum. The chemical structure of prodrug was confirmed by analyzing its FTIR, 1H NMR, 13C NMR and MS-ESI spectra. The results of in vitro kinetic study indicated that the prodrug was significantly stable in HCl and in phosphate buffers, and was hydrolyzed in human serum followed pseudo first order kinetics.
Keywords: Coumarin-bas
... Show MoreThe settlement evaluation for the jet grouted columns (JGC) in soft soils is a problematic matter, because it is influenced by the number of aspects such as soil type, effect mixture between soil and grouting materials, nozzle energy, jet grouting, water flow rate, rotation and lifting speed. Most methods of design the jet-grouting column based on experience. In this study, a prototype single and group jet grouting models (single, 1*2, and 2*2) with the total length and diameter were (2000 and 150 mm) respectively and clear spacing (3D) has been constructed in soft clay and subjected to vertical axial loads. Furthermore, different theoretical methods have been used for the estimation
Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destina
... Show MoreFlexible molecular docking is a computational method of structure-based drug design to evaluate binding interactions between receptor and ligand and identify the ligand conformation within the receptor pocket. Currently, various molecular docking programs are extensively applied; therefore, realizing accuracy and performance of the various docking programs could have a significant value. In this comparative study, the performance and accuracy of three widely used non-commercial docking software (AutoDock Vina, 1-Click Docking, and UCSF DOCK) was evaluated through investigations of the predicted binding affinity and binding conformation of the same set of small molecules (HIV-1 protease inhibitors) and a protein target HIV-1 protease enzy
... Show MoreThe sustainable competitive advantage for organizations is one of the requirements for value creation, which centered on the possession of scarce resources that achieve maximum flows to invest in intellectual capital, if what has been interest in them, measured and employed the way properly and style, so I figured the need for new technologies to enable organizations to measure the intellectual and physical assets and to assess its performance accordingly, so it sheds search light on the measurement of the added value of existing knowledge using the standard value-added factor is the intellectual (value added intellectual coefficient) (VAIC) and to develop a set of assumptions about the extent of the difference between the sample
... Show MoreMultiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show More