A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Cryptography and Secure Communications
Cryptography and Secure Communications
Exchange strategies for multiple Ant Colony System
Information Sciences: an International Journal
Improving inductive logic programming by using simulated annealing
Information Sciences: an International Journal
A genetic algorithm approach to determine the sample size for attribute control charts
Information Sciences: an International Journal
Particle swarm optimization with preference order ranking for multi-objective optimization
Information Sciences: an International Journal
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Information Sciences: an International Journal
Editorial: Special issue: Swarm intelligence and its applications
Information Sciences: an International Journal
Adaptive image data hiding in edges using patched reference table and pair-wise embedding technique
Information Sciences: an International Journal
Secret sharing with multi-cover adaptive steganography
Information Sciences: an International Journal
Hi-index | 0.07 |
Embedding secret data into a cover image using simple least-significant-bit substitution can degrade the image quality dramatically, especially when a large number of bits are substituted. The exhaustive least-significant-bit substitution method is proposed to solve this problem. However, the idea has no practical application due to its long computation time. This paper adopts the cat swarm optimization (CSO) strategy to obtain the optimal or near optimal solution of the stego-image quality problem. The CSO strategy is generated by observing the behavior of cats, which has been proved to achieve better performance on finding the best global solutions. We revised the CSO strategy in our proposed scheme to make it practicable and suitable to solve the mentioned problem. The experimental results show that the proposed scheme can obtain a better solution with less computation time.