Sharif Digital Repository

In this paper, we present a framework for biclique cryptanalysis of block ciphers which extremely requires a low amount of data. To that end, we enjoy a new representation of biclique attack based on a new concept of cutset that describes our attack more clearly. Then, an algorithm for choosing two differential characteristics is presented to simultaneously minimize the data complexity and control the computational complexity. Then, we characterize those block ciphers that are vulnerable to this technique and among them, we apply this attack on lightweight block ciphers Piccolo-80, Piccolo-128, and HIGHT. The data complexity of these attacks is only 16-plaintext-ciphertext pairs, which is... 

Biclique attack is one of the most recent methods for cryptanalysis of block ciphers. In this paper, we present a new biclique attack on the full round of the lightweight block cipher CLEFIA-128. We obtained 2127.44 for computational complexity while the data complexity is 264 and memory complexity is 27. To the best of our knowledge, it is the first biclique attack on the full CLEFIA-128 lightweight block cipher. Also, we show that MITM attack in the way of using partial matching with precomputation and recomputation technique can reduce the data complexity of the attack to only 2 known plaintext-ciphertext pairs  

An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-allocation cost is minimized. Pipeline systems in natural gas network must be designed based on gas flow rate, length of pipe, gas maximum pressure drop allowance, and gas maximum velocity allowance. We use the information regarding gas flow rates and pipe diameter sizes considering the gas pressure and... 

Bivium is a simplified version of Trivium, a hardware profile finalist of eSTREAM project. Bivium has an internal state of size 177 bits and a key length of 80 bits. In this paper we introduce a distinguishing attack on this cipher. In this method we first find the best linear approximation for the updating function. Then by using this approximation, and optimizing the time delay, we find the distinguisher. The complexity of the attack is O(230.79), which is an improvement to the previous distinguishing attack with a complexity of order O(232)  

LBlock is a lightweight block cipher proposed in ACNS 2011 as a solution to the security challenge in extremely constrained environments. Because biclique cryptanalysis had not been invented when this cipher was designed, the designers themselves evaluated the security of this cipher one year later in WISA 2012, where a modified key schedule was also suggested to make this cipher resistant against biclique attack. In this paper, we analyze the full-round of LBlock with this modified key schedule by the biclique attack with data complexity of 212 and computational complexity of 278-74. In the biclique attack, a shorter biclique potentially results in less data complexity, but at the expense... 

It is quite common nowadays for clients to outsource their personal data to a cloud service provider. However, it causes some new challenges in the area of data confidentiality and access control. Attribute-based encryption is a promising solution for providing confidentiality and fine-grained access control in a cloud-based cryptographic system. Moreover, in some cases, to preserve the privacy of clients and data, applying hidden access structures is required. Also, a data owner should be able to update his defined access structure at any time when he is online or not. As in several real-world application scenarios like e-health systems, the anonymity of recipients, and the possibility of... 

Improving the sensitivity and the time response of the superconducting transition edge detectors as one of the most promising technologies for millimeter and sub-millimeter wavelength radiation power detection is essential. Having an accurate 3D model for these detectors enables us to design faster detectors with higher sensitivity and detectivity. In this paper, we report on a 3-dimensional finite element model of a current biased superconducting YBa2Cu3O7-x (YBCO) transition-edge detector fabricated by a low-cost Metal-Organic deposition method. The obtained simulation results are in good agreement with the measured response of the detectors. Also, as the simulation results suggest,... 

This paper analyzes the Piccolo family of lightweight block ciphers against the impossible differential cryptanalysis. A combination of some ploys such as decreasing the S-box computations, finding an appropriate propagation of differentials, utilizing hash tables and using the linearity of the key-schedule as well as disregarding subkeys of two rounds lead to 12-round and 13-round impossible differential attack on Piccolo-80 and 15-round attack on Piccolo-128. The time and data complexity of the attack against Piccolo-80 is 255.18 and 236.34 for 12-round and 269.7 and 243.25 for 13-round, respectively. Moreover, the time and data complexity for 15 rounds cryptanalysis of Piccolo-128 are... 

Here, a case study of natural gas network is conducted. We design an optimal distribution network of natural gas. Our proposed network is composed of stations reducing gas pressure to desirable pressure using consumer's viewpoint. By using minimum spanning tree (MST) technique, an optimal distribution network among stations and consumers is constructed. Our aim is to determine both locations and types of stations minimizing location-allocation costs in the network. A case study in Mazandaran Gas Company in Iran is made to assess the validity and effectiveness of the proposed model  

With the development of modern power systems, Smart Grid as the intelligent generation of electricity networks, has been faced with a tremendous attention. The Smart Grid systems are made up of fine-grained power grid measurements to achieve a high stability and reliability. In these networks, the data security and privacy issues for secure data sharing among the components of the system have emerged as the basic requirement. Typically, a service provider securely shares the data/commands with the smart meters under an arbitrary policy which is determined by the service providers. As the smart grid components are considered to have constrained computational resources, we cannot directly use... 

Recently, there has been shown a great interest in the private set intersection (PSI) protocols which are widely used in social networks applications. In a PSI protocol two entities are able to find the intersection of their document set without inferring more information than the common data. In some PSI protocols the process of finding the intersections of the documents are delegated to a third entity like cloud which has high computational and storage resources and the clients can verify the accuracy of the received results. These protocols are known as the Verifiable Delegated Set Intersection (VDSI). In this paper, we proposed an efficient VDSI protocol by employing the El-Gamal... 

HIGHT is a lightweight block cipher introduced in CHES 2006 by Hong et al as a block cipher suitable for low-resource applications. In this paper, we propose improved impossible differential and biclique attacks on HIGHT block cipher both exploiting the permutation-based property of the cipher's key schedule algorithm as well as its low diffusion. For impossible differential attack, we found a new 17-round impossible differential characteristic that enables us to propose a new 27-round impossible differential attack. The total time complexity of the attack is 2120.4 where an amount of 259.3 chosen plaintext-ciphertext pairs and 2107.4 memory are required. We also instantiate a new biclique... 

Impossible differential attack is a well-known mean to examine robustness of block ciphers. Using impossible differential cryptanalysis, we analyze security of a family of lightweight block ciphers, named Midori, that are designed considering low energy consumption. Midori state size can be either 64 bits for Midori64 or 128 bits for Midori128; however, both versions have key size equal to 128 bits.In this paper, we mainly study security of Midori64. To this end, we use various techniques such as early-abort, memory reallocation, miss-in-the-middle and turning to account the inadequate key schedule algorithm of Midori64. We first show two new 7-round impossible differential characteristics... 

In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about components that are not in the intersection. Due to the broad range of computational resources that the cloud can provide for its users, determining the set intersection by cloud may decrease the computational cost of the users. The proposed protocol by Abadi et al. is one of the introduced protocols in this... 

ARX algorithms are a class of symmetric-key algorithms constructed by Addition, Rotation, and XOR. To evaluate the resistance of an ARX cipher against differential and impossible-differential cryptanalysis, the recent automated methods employ constraint satisfaction solvers to search for optimal characteristics or impossible differentials. The main difficulty in formulating this search is finding the differential models of the non-linear operations. While an efficient bit-vector differential model was obtained for the modular addition with two variable inputs, no differential model for the modular addition by a constant has been proposed so far, preventing ARX ciphers including this...