MOIM: a novel design of cryptographic hash function

A hash function usually has two main components: a compression function or permutation function and mode of operation. In this paper, we propose a new concrete novel design of a permutation based hash functions called MOIM. MOIM is based on concatenating two parallel fast wide pipe constructions as a mode of operation designed by Nandi and Paul, and presented at Indocrypt 2010 where the size of the internal state is significantly larger than the size of the output. And the permutations functions used in MOIM are inspired from the SHA-3 finalist Grøstl hash function which is originally inspired from Rijndael design (AES). As a consequence there is a very strong confusion and diffusion in MOIM. Also, we show that MOIM resists all the generic attacks and Joux attack in two defense security levels

Comparative study on 4G/LTE cryptographic algorithms based on different factors

Recently, (LTE) Long Term Evolution appeared as a robust technology to meet (4G) Fourth Generation cellular networks requirements. Apparently, there are three sets of cryptographic algorithms that work on LTE technology and each set based on core algorithm. Therefore, in this paper we are focusing on reviewing the three sets of the LTE cryptographic algorithms and their core algorithms and then comparing them based on different factors in order to understand their cons and pros and provide valuable information about LTE security

Improving PRESENT lightweight algorithms

Lightweight block cipher algorithms are vital for constrained environment. Substitution box (S-box) is the essential constituent of many lightweight block cipher algorithms and it is the only nonlinear part. It is proficient to create confusion in the plaintext during the process of encryption. In this research, a new way of key dependent S-box is proposed by choosing one S-box out of 16 good S-boxes. Preliminary analysis of linear and differential cryptanalysis is showing that the proposed alg

Rational drug design using genetic algorithm: case of malaria disease

With the rapid development in the amount of molecular biological structures, computational molecular docking (CMD) approaches become one of the crucial tools in rational drug design (RDD). Currently, number of researchers are working in this filed to overcome the recent issues of docking by using genetic algorithm approach. Moreover, Genetic Algorithm facilities the researchers and scientists in molecular docking experiments. Since conducting the experiment in the laboratory considered as time consuming and costly, the scientists determined to use the computational techniques to simulate their experiments. In this paper, auto dock 4.2, well known docking simulation has been used to perform the experiment in specific disease called malaria. The genetic algorithm (GA) approach in the autodock4.2 has been used to search for the potential candidate drug in the twenty drugs. It shows the great impacts in the results obtained from the CMD simulation. In the experiment, we used falcipain-2 as our target protein (2GHU.pdb) obtained from the protein data bank and docked with twenty different available anti malaria drugs in order to find the effective and efficient drugs. Drug Diocopeltine A was found as the best lowest binding energy with the value of -8.64 Kcal/mol. Thus, it can be selected as the anti malaria drug candidate

Smart cities: a survey

A smart city is one that uses a smart system characterized by the interaction between infrastructure, capital, behaviors and cultures, achieved through their integration. From our survey of the smart city concept by reading recent papers in this field, we found no uniform concept of the smart city; some papers discussed it as a general case study, while others dealt with specific parts. This paper is a survey of a number of articles , which we divided into two categories:1-General case study, which covers the topic of smart city in a general framework, and 2-Specific case study, which covers the topic of the smart city from a specific detailed application, such as Traffic Management System, Smart Grid, Wireless Technology,…etc. The results of our research show that the information of communication technology (ICT) covers all areas on smart cities such as government facilities, buildings, traffic, electricity, health, water, and transport. Until now there is no unique definition for smart cities, most of researcher define the smart city form their needs or prospective

Protection of the digital holy Quran using SAB hash function

Cryptography consists of a set of algorithms and techniques to convert the data into another form so that the contents are unreadable and unexplainable to anyone who does not have the authority to read or write on these data. One of the tools used by cryptography is the hash function. The hash function is used to hash the file so that if anyone tries to modify the text in the file, the number of file obtained from hashing will change. In this paper, we designed a concrete hash function called SAB. SAB hash function uses a permutation Q used in Grøstl hash function as a permutation function. Also, it uses the fast wide pipe (FWP) construction designed by Nandi and Paul presented in Indocrypt2010 conference. SAB hash function is designed to protect the data integrity of the digital Holy Quran from alterations or manipulations. SAB hash function outputs 512-bits as the final digests

Improving the security of LBlock lightweight algorithm using bit permutation

Lightweight block cipher algorithms are important for constrained environment. LBlock uses word permutation to do the diffusion while this research uses bit permutation to increase the number of active Substitution box (S-box). The number of active S-box is a regular method to evaluate the security against linear and differential attacks. The bit permutation method is described in this research with analysis and discussion. The preliminary results show that the proposed algorithm has 32 active S-box for 13 rounds which is higher than 32 active S-box for 15 rounds of LBlock algorithm. Also, we can conclude that the proposed algorithm is better than LBlock algorithm in the perspective of security

An improved genetic algorithm for solving the multiprocessor scheduling problem

Multiprocessor Scheduling Problem (MSP) is an NP-complete optimization problem. The applications of this problem are numerous, but are, as suggested by the name of the problem, most strongly associated with the scheduling of computational tasks in a multiprocessor environment. Many methods and algorithms were suggested to solve this problem due to its importance. Genetic algorithms were among the suggested methods. In this research, sound improvements were done on one of the known papers [3]. Results show very good improvements in increasing the percentage of getting the exact solution as well as decreasing the number of generations needed to converge

Joux multicollisions attack in sponge construction

Cryptographic hash functions take an unfixed size of input and produce a fixed size of an output. A hash function usually has two main components: a compression function and mode of operation. Sponge construction is one of the main operations of modes of used in modern cryptographic hash function. In this paper, we present multicollisions attack in sponge construction. In 2004, Joux [3] presented multicollision attack in iterated hash function. Our attack is similar to Joux attack but specifically for sponge construction1. We show that finding multicollisions in sponge construction of messages that hash to the same value, is not harder finding ordinary collisions. Then, we use this attack as a tool to prove that concatenating more than one hash function in order to increase the security level does not yield to more secure construction