Sharif Digital Repository

In this paper, we propose a new 6-round Related-Key Impossible Differential property of AES-256 and two related-key impossible differential attacks on 7 and 9 round AES-256, based on the proposed property. The overall complexity of the proposed 7 round attack is decreased by the factor 217. This is for the first time that a Related-Key Impossible Differential attack on 9-round AES-256 is successful. Also this is the first related-key attack on 9-round AES-256 that needs only 2 keys. Although the data and time complexities of the attack are approximately code book and exhaustive search, but we think the proposed property will be useful in future research like boomerang and rectangle attacks  

Polar Diagram [4] is a new locus approach for problems processing angles. The solution to many important problems in Computational Geometry requires some kind of angle processing of the data input. Using the Polar Diagrma as preprocessing, exhaustive searches to find those sites with smallest angle become unnecessary. In this paper, we use the notion of kinetic data structure [1][2] to model the dynamic case of polar diagram, i.e we maintain the polar diagram of a set of continuously moving objects in the scene. We show that our proposed structure meets the main criteria of a good KDS. © 2008 Springer-Verlag  

Finding binary sequences with low autocorrelation is very important in many applications and their construction is a hard computational problem. Here a new exhaustive search algorithm is developed to find all optimal aperiodic binary sequences which are faster than simple one and it achieves its efficiency through a combination of the following four devices: (1) A branch-and-bound search strategy; (2) Search logic that avoids codes redundant relative to two PSL-preserving operations; (3) A fast recursive method for computing autocorrelation functions of binary sequences; (4) A simple scheme for partitioning and parallelizing, made possible by the fixed upper bound on psl  

The orthogonal frequency division multiplexing (OFDM) modulation technique is one of the key strategies for multiuser signal transmission especially in smart grids and wind farms. This paper introduces an approach for peak-to-average power ratio (PAPR) reduction of such signals based on novel global harmony search (NGHS) and partial transmit sequence (PTS) schemes. In PTS technique, the data block to be transmitted is partitioned into disjoint subblocks, which are combined using phase factors to minimize PAPR. The PTS requires an exhaustive search over all combinations of allowed phase factors. Therefore, with respect to the fast implementation and simplicity of NGHS technique, we could... 

Observability of bulk power transmission network by means of minimum number of phasor measurement units (PMUs), with the aid of the network topology, is a great challenge. This paper presents a novel equivalent integer linear programming method (EILPM) for the exhaustive search-based PMU placement. The state estimation implemented based on such a placement is completely linear, thereby eliminating drawbacks of the conventional SCADA-based state estimation. Additional constraints for observability preservation following single PMU or line outages can easily be implemented in the proposed EILPM. Furthermore, the limitation of communication channels is dealt with by translation of nonlinear... 

Guess-and-determine (GD) attacks are general attacks on stream ciphers, which have often been implemented in an ad hoc manner. The authors introduce a heuristic approach to the design of GD attacks, that is a dynamic programming method using a Viterbi-like algorithm which is a well-known decoding algorithm for convolutional codes. The authors also show that with this method, the resulting GD attacks, named heuristic GD (HGD) attacks, on TIPSY, SNOW1 and SNOW2 lead to less computational complexity than the previously known GD attacks. The main advantage of HGD attacks, over ad hoc GD attacks, is that while being powerful, they can be designed algorithmically for classes of stream ciphers,...