We discuss the impossible differential cryptanalysis of the block cipher Zodiac [7]. The main design principles of Zodiac are simplicity and efficiency. However the diffusion layer in its round function is too simple to offer enough security. An impossible differential cryptanalysis is a proper method to attack the weakness of Zodiac. Our attack using two 14-round impossible characteristics der...

It is of interest in various contexts to find approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization, it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feas...

Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...

We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.