Ammar Odeh

Steganography by multipoint Arabic letters

Security methodologies are taken into consideration for many applications, where transferring sensitive data over network must be protected from any intermediate attacker. Privacy of data can be granted using encryption, by changing transmitted data into cipher form. Apart from encryption, hiding data represents another technique to transfer data without being noticeable by an attacker. This technique is called Steganography. In this paper, we will discuss the main concepts of Steganography and a carrier media that is used for this goal. Employing text as mask for other text represents the most difficult method that can be used to hide data. We will discuss some algorithms that use Arabic text. We then describe our doted space methodology to enhance data hiding.

Quantum key distribution by using public key algorithm(RSA)

Classical cryptography is based on the computational difficulty to compute the secret key using the current computing systems. Depending only on the difficulty of computational complexity does not provide enough security because finding a fast method to calculate the secret key will compromise the security of the systems. Quantum computing uses the law of physics for communication allowing new concepts to be applied in computing specially in cryptography and key distribution by applying quantum theorems and principles. In this paper, we are introducing a new model for quantum key distribution between three parties or more where there is a trusted center providing the clients the necessary secret information to securely communicate with each other.

Steganography in Arabic text using Kashida variation algorithm (KVA)

The need for secure communications has significantly increased with the explosive growth of the internet and mobile communications. The usage of text documents has doubled several times over the past years especially with mobile devices. In this paper, we propose a new steganography algorithm for Unicode language (Arabic). The algorithm employs some Arabic language characteristics which represent extension letters. Kashida letter is an optional property for any Arabic text and usually is not popularly used. Many algorithms tried to employ this property to hide data in Arabic text. In our method, we use this property to hide data and reduce the probability of suspicions. The proposed algorithm first introduces four scenarios to add Kashida letters. Then, random concepts are employed for selecting one of the four scenarios for each round. Message segmentation principles are also applied, enabling the sender to select more than one strategy for each block of message. At the other end, the recipient can recognize which algorithm was applied and can then decrypt then message content and aggregate it. Kashida variation algorithm can be extended to other similar Unicode languages to improve robustness and capacity.

A new algorithm for three-party Quantum key distribution

This paper aims to solve the security issues between two parties communicating through a Quantum channel. One of the most effective factors in Quantum cryptography is the trust between two or more parties. Communication parties need to verify the authenticity of each other and who they claim to be. The proposed model introduces a trusted center as a new party. This will be used for key distribution and trust establishment. Thus, the trusted center will be part of the process of identity verification and key agreement. Although, the suggested model in this paper is introduced between two parties and a trust center, it could be extended to cover more parties by repeating the same process on each party. This paper provides a new mechanism to establish trust between different parties. In the presented technique, each party can assure that they are communicating with the legitimate party.

Performance Evaluation of DYMO, AODV and DSR Routing Protocols in MANET

Ad Hoc network has no infrastructure and it provides flexibility to networks nodes to connect and disconnect at any time. A MANET is an Ad Hoc network that provides freedom of movement to the networks nodes. In a MANET, The development of routing protocols is one of the main challenges and much research has been done to evaluate the current protocols to improve them or to develop new protocols. There are several protocols that have been tested in the past and each protocol has its advantages and disadvantages depending on the applications. In this paper, we evaluate Dynamic MANET On-demand routing protocol (DYMO), Ad Hoc On-Demand Distance Vector Routing protocol (AODV) and Dynamic Source Routing protocol (DSR). We evaluate the performance based on throughput, dropped packets and end-to-end delay.

Highly efficient novel text steganography algorithms

This paper investigates eight novel Steganography algorithms employing text file as a carrier file. The proposed model hides secret data in the text file by manipulating the font format or inserting special symbols in the text file. Furthermore, the suggested algorithms can be applied to both Unicode and ASCII code languages, regardless of the text file format. In addition, a merging capability among the techniques is introduced, which allows alternatives for users based on the system requirements. The proposed algorithms achieve a high degree of optimized Steganography attributes such as hidden ratio, robustness, and transparency.

Fast real-time hardware engine for Multipoint Text Steganography

Different strategies were introduced in the literature to protect data. Some techniques change the data form while other techniques hide the data inside another file. Steganography techniques conceal information inside different digital media like image, audio, and text files. Most of the introduced techniques use software implementation to embed secret data inside the carrier file. Most software implementations are not sufficiently fast for real-time applications. In this paper, we present a new real-time Steganography technique to hide data inside a text file using a hardware engine with 11.27 Gbps hidden data rate. The fast Steganography implementation is presented in this paper.

Sorting N elements using quantum entanglement sets

To search for an element in an unsorted database, it requires O(N) operations using classical computers, where it takes only O(√ N) operations in quantum systems. In this paper, we provide an in-depth look at the existing quantum searching algorithms and emphasize the quantum entanglement feature to propose a new technique for sorting N elements and thus improve the sorting process.

Quantum sort algorithm based on entanglement qubits {00, 11}

Quantum algorithms have gained a lot of consideration especially for the need of searching unsorted database in a faster way rather than using the classical search mechanisms. This paper introduces a new quantum sort algorithm by employing the quantum features to expedite the searching process in conventional environments. The proposed efficient sorting algorithm emphasizes entanglement qubits property to sort N positive integers.

Novel Steganography over HTML Code

Different security strategies have been developed to protect the transfer of information between users. This has become especially important after the tremendous growth of internet use. Encryption techniques convert readable data into a ciphered form. Other techniques hide the message in another file, and some powerful techniques combine hiding and encryption concepts. In this paper, a new security algorithm is presented by using Steganography over HTML pages. Hiding the information inside Html page code comments and employing encryption, can enhance the possibility to discover the hidden data. The proposed algorithm applies some statistical concepts to create a frequency array to determine the occurrence frequency of each character. The encryption step depends on two simple logical operations to change the data form to increase the complexity of the hiding process. The last step is to embed the encrypted data as comments inside the HTML page. This new algorithm comes with many advantages, such as generality, applicability to different spoken languages, and can be extended to other Web programming pages such as XML, ASP.