With the advancement in the network transmission media, need for secure data communication is strongly felt. Recently fractal based cryptosystem has become a topic of active research in computer network system because of its chaotic behavior. The proposed method utilizes the intrinsic relationship between Mandelbrot function and Julia function to develop a non-transitional key cryptosystem. The process starts with the formation of public key using superior Mandelbrot set with the help of few global as well as secret parameters on both sides. After exchanging public keys, both parties will generate their own private key using superior Julia set which will be same on both sides. The method is also implemented for Ishikawa iterated fractal function and subsequently carried out detailed analysis for both functions. The given cryptosystem utilizing two different iteration methods and improve the performance by increasing the encryption key up to 128 bits. As per experimental result and performance analysis, the key has large key space, high key sensitivity due to chaotic nature and efficient execution time which helps to achieve a secure communication network environment for data transmission.

Continuous growth of using the information technologies in the modern world causes gradual accretion amounts of data that are circulating in information and telecommunication system. That creates an urgent need for the establishment of large-scale data storage and accumulation areas and generates many new threats that are not easy to detect. Task of accumulation and storing is solved by datacenters – tools, which are able to provide and automate any business process. For now, almost all service providers use quite promising technology of building datacenters – Cloud Computing, which has some advantages over its traditional opponents. Nevertheless, problem of the provider’s data protection is so huge that risk to lose all your data in the “cloud” is almost constant. It causes the necessity of processing great amounts of data in real-time and quick notification of possible threats. Therefore, it is reasonable to implement in data centers’ network an intellectual system, which will be able to process large datasets and detect possible breaches. Usual threat detection methods are based on signature methods, the main idea of which is comparing the incoming traffic with databases of known threats. However, such methods are becoming ineffective, when the threat is new and it has not been added to database yet. In that case, it is more preferable to use intellectual methods that are capable of tracking any unusual activity in specific system – anomaly detection methods. However, signature module will detect known threats faster, so it is logical to include it in the system too. Big Data methods and tools (e.g. distributed file system, parallel computing on many servers) will provide the speed of such system and allow to process data dynamically. This paper is aimed to demonstrate developed anomaly detection system in secure cloud computing environment, show its theoretical description and conduct appropriate simulation. The result demonstrate that the developed system provides the high percentage (>90%) of anomaly detection in secure cloud computing environment.

The evolution of optical communications systems from long fibers to robust wireless system has led to the idea of connecting two satellites using an optical wireless link. The rapid developments in satellite communication point to the possibilities of satellite networks as a method for them to communicate with each other. The optical wireless communication (OWC) enables the information exchange between satellites at higher speed and also a satellite can act as a relay between two satellites or between a satellite and ground base station. Light signal of high frequency is used as a carrier for the optical link between satellites and lasers are commonly used as a source of light. One of the primary reasons for preferring OWC over RF link is high data rate with acceptable bit error rate (BER). The communication between two lower earth orbit (LEO) satellites is studied under this research work. The quality factor (Q-factor) or BER is used as a key metric to analyze the performance of the inter-satellite link (ISL). This work presents the performance enhancement of the system by using multiple antennas and advanced modulation techniques.

In this paper, we have proposed a new iterated symmetric cipher, which is designed with Substitution and Permutation Network (SPN) structure and depends on strong mathematical built. It uses a compact algorithm for encryption and decryption processes, which consists of four main stages that roughly similar in its work to the Advance Encryption Standard (AES) stages. Starting by the SubByte operation, ReversibleShiftrows operation, ReversibleMixcolumns operation, and Round key addition. The proposed operations in this cipher have implemented in a straightforward manner relatively in both Encryption/Decryption by an elegant way. These four stages designed to reduce the hardware requirements and to produces high efficiency, which keeps the encryption and decryption process at the same speed in the hardware devices and eliminates the difference of execution times as well as creates a balance in forward and backward operations. The proposed cipher interested with modern design by adopted new algebraic operations and clear mathematical notations to ensure a high level of security. The proposed cipher did not build suddenly or arbitrarily but it acts as a sequence of developments and represents as a long process of design for long time, since several proposed ciphers have been published recently by us that paved the way to its new design, so the designed cipher inherited a good properties from a proven famous algorithms’ features to produce high resistance against all known attacks and to submit a high performance on many platforms and in a wide range of hardware and software applications.

The security of any cryptosystems is based on the way in which it produces different ciphertext for the same plaintext. Normally, various block cipher modes viz., CBC, OFC, etc., are used in producing different ciphertext for the same plaintext but it is a time consuming process. Instead of using block cipher, a different encoding method for the plaintext is proposed in this paper using magic rectangle. The advantage of using the encoding scheme is different numerals is used in encoding each characters of a plaintext. Thus instead of considering the ASCII encoding for a character to be encrypted, the numeral which occurs at the position which corresponds to the ASCII value of the character is taken from the magic rectangle. Further, different numerals from magic rectangles for the same character are produced by considering the magic sum, starting number and template of magic rectangle. Once the magic rectangles are created, the numerals which occur in the magic rectangles are considered for the encoding of the plaintext character which is then used for encryption in the cryptosystems like RSA, ElGamal. The proposed work provides an additional layer of security to any public key cryptosystems. As this model is acting as a wrapper to any public key cryptosystems, it ensures enhanced security. The proposed methodology is implemented with different processors 1, 2, 4, 8 and 16 in a simulated environment using Maui scheduler which employs back filling philosophy.

Graphs are widely used to model complicated structures and link them with each other. Some of such structures are XML documents, social networks, and computer networks. Information and model extraction from graph databases is a graph mining process. Efficient query search in graph databases, known as query processing, is one of the heated debates in the field of graph mining. One of the query processing techniques is sequential search over the whole dataset and isomorphism test on all sub-graphs in the database, which is not an optimal technique as to response time and storage. This problem brought in the issues of indexing graph databases to improve query processing performance. As the method implies, part of the database where the answer is expected to be found there is pruned and the number of needed isomorphism tests decreases. It might not be easy to compare the methods and techniques of graph query techniques as different techniques have different objectives. For instance, similarity search techniques reduce query time, while they cannot compete with exact matching techniques as to accuracy and vice versa. Input data volume might be also effective on query time as with immense datasets, similarity search techniques are more preferred than exact matching techniques. The present study is a survey of graph query processing techniques with emphasis on similarity search and exact matching.

World Wide Web (1990’s) and Mobile Internet (the 2000’s) had consequential corroborated the way how people communicate. However, with evolution in technology, the cataclysm of Internet has stepped into a new phase-Internet of Things. Internet of Things, a prominent paradigm in the field of IT having a nominal intervention of humans allowing diverse things to communicate with each other, anticipate, sight, and perceive surroundings. IoT exploits RFID tags, NFC, sensors, smart bands, and wired or wireless communication technologies to build smart surroundings, smart Homes, quick-witted intelligence in medical care, ease of Transport, and more. This paper introduces IoT with emphasis on its driver technologies and system architecture. In addition to application layer protocols, we focus on identifying various issues and application areas of IoT as well as future research trends in the field of IoT. We have also highlighted how big data is associated with Internet of Things.