Researcher Image
محمد عبد الصاحب مهدي جواد - Mohammed A. Nasrullah
MSc - lecturer
College of Engineering , Computer engineering department
[email protected]
Publication Date
Wed Jan 01 2020
Journal Name
Journal Of Information Hiding And Multimedia Signal Processing
Enhancement of lsb audio steganography based on carrier and message characteristics
...Show More Authors

Data steganography is a technique used to hide data, secret message, within another data, cover carrier. It is considered as a part of information security. Audio steganography is a type of data steganography, where the secret message is hidden in audio carrier. This paper proposes an efficient audio steganography method that uses LSB technique. The proposed method enhances steganography performance by exploiting all carrier samples and balancing between hiding capacity and distortion ratio. It suggests an adaptive number of hiding bits for each audio sample depending on the secret message size, the cover carrier size, and the signal to noise ratio (SNR). Comparison results show that the proposed method outperforms state of the art methods

... Show More
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Electronic Security And Digital Forensics
LSB based audio steganography preserving minimum sample SNR
...Show More Authors

View Publication
Scopus (5)
Scopus Crossref
Publication Date
Sun Apr 01 2012
Journal Name
2012 International Conference On Future Communication Networks
Efficient method to find the multiplicative inverse in GF (2<sup>m</sup>) using FPGA by exponentiation to (2<sup>k</sup>)
...Show More Authors

Multiplicative 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
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref
No Events Found