Steganography is defined as hiding confidential information in some other chosen media without leaving any clear evidence of changing the media's features. Most traditional hiding methods hide the message directly in the covered media like (text, image, audio, and video). Some hiding techniques leave a negative effect on the cover image, so sometimes the change in the carrier medium can be detected by human and machine. The purpose of suggesting hiding information is to make this change undetectable. The current research focuses on using complex method to prevent the detection of hiding information by human and machine based on spiral search method, the Structural Similarity Index Metrics measures are used to get the accuracy and quality

As an important resource, entanglement light source has been used in developing quantum information technologies, such as quantum key distribution(QKD). There are few experiments implementing entanglement-based deterministic QKD protocols since the security of existing protocols may be compromised in lossy channels. In this work, we report on a loss-tolerant deterministic QKD experiment which follows a modified “Ping-Pong”(PP) protocol. The experiment results demonstrate for the first time that a secure deterministic QKD session can be fulfilled in a channel with an optical loss of 9 dB, based on a telecom-band entangled photon source. This exhibits a conceivable prospect of ultilizing entanglement light source in real-life fiber-based

This paper demonstrates the spatial response uniformity (SRU) of two types of heterojunctions (CdS, PbS /Si) laser detectors. The spatial response nonuniformity of these heterojunctions is not significant and it is negligible in comparison with p+- n silicon photodiode. Experimental results show that the uniformity of CdS /Si is better than that of PbS /Si heterojunction

Sensitive information of any multimedia must be encrypted before transmission. The dual chaotic algorithm is a good option to encrypt sensitive information by using different parameters and different initial conditions for two chaotic maps. A dual chaotic framework creates a complex chaotic trajectory to prevent the illegal use of information from eavesdroppers. Limited precisions of a single chaotic map cause a degradation in the dynamical behavior of the communication system. To overcome this degradation issue in, a novel form of dual chaos map algorithm is analyzed. To maintain the stability of the dynamical system, the Lyapunov Exponent (LE) is determined for the single and dual maps. In this paper, the LE of the single and dual maps

Cipher security is becoming an important step when transmitting important information through networks. The algorithms of cryptography play major roles in providing security and avoiding hacker attacks. In this work two hybrid cryptosystems have been proposed, that combine a modification of the symmetric cryptosystem Playfair cipher called the modified Playfair cipher and two modifications of the asymmetric cryptosystem RSA called the square of RSA technique and the square RSA with Chinese remainder theorem technique. The proposed hybrid cryptosystems have two layers of encryption and decryption. In the first layer the plaintext is encrypted using modified Playfair to get the cipher text, this cipher text will be encrypted using squared

Blockchain has garnered the most attention as the most important new technology that supports recent digital transactions via e-government. The most critical challenge for public e-government systems is reducing bureaucracy and increasing the efficiency and performance of administrative processes in these systems since blockchain technology can play a role in a decentralized environment and execute a high level of security transactions and transparency. So, the main objectives of this work are to survey different proposed models for e-government system architecture based on blockchain technology implementation and how these models are validated.  This work studies and analyzes some research trends focused on blockchain

This paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of AC