Improbable differential attacks on PRESENT using undisturbed bits

In this study, we introduce a new criteria for evaluating S-boxes and attack PRESENT by exploiting its S-box. Depending on the design of an S-box, when a specific difference is given as the input (resp. output) of the S-box, the difference of at least one of the output (resp. input) bits of the S-box may be guessed with probability 1. We call such bits undisturbed and they are helpful for constructing longer or better truncated, impossible or improbable differentials. Without using undisturbed bits, the longest improbable differential attack we could find for PRESENT had a length of 7-rounds. However, we show that PRESENT'S S-box has 6 undisturbed bits and by using them, we can construct 10-round improbable differentials and attack PRESENT reduced to 13 rounds. Hence, undisturbed bits should be avoided by S-box designers.


A sequential classification algorithm for autoregressive processes
Otlu, Güneş; Candan, Çağatay; Çiloğlu, Tolga; Department of Electrical and Electronics Engineering (2011)
This study aims to present a sequential method for the classification of the autoregressive processes. Different from the conventional detectors having fixed sample size, the method uses Wald’s sequential probability ratio test and has a variable sample size. It is shown that the suggested method produces the classification decisions much earlier than fixed sample size alternative on the average. The proposed method is extended to the case when processes have unknown variance. The effects of the unknown pro...
The multi-resource agent bottleneck generalised assignment problem
Karsu, Ozlem; Azizoğlu, Meral (Informa UK Limited, 2012-01-01)
In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal sol...
A new approach to generating non-permutation schedules for flowshops with missing operations
Tabalu, Metin; Şen, Tayyar; Department of Industrial Engineering (2006)
In this study, non-permutation flowshops with missing operations are considered. The primary performance criterion is the total cycle time (i.e. makespan) and the secondary criterion is the total flowtime. In order to obtain the schedule with minimum makespan and minimum total flowtime, non-permutation schedules are being generated instead of permutation ones by permitting multiple jobs bypassing stages where misisng operations occur. A heuristic algorithm has been developed in order to generate non-permuta...
A realistic success criterion for discourse segmentation
Yondem, MT; Üçoluk, Göktürk (2003-01-01)
In this study, compared to the existing one, a more realistic evaluation method for discourse segmentation is introduced. It is believed that discourse segmentation is a fuzzy task [Pas96]. Human subjects may agree on different discourse boundaries, with high agreement among them. In the existing method a threshold value is calculated and sentences that marked by that many subjects are decided as real boundaries and other marks are not been considered. Furthermore automatically discovered boundaries, in cas...
A hybrid swarm intelligence algorithm for simultaneous feature selection and clustering
Geren, Hasan; Özdemirel, Nur Evin; Department of Industrial Engineering (2022-6-20)
In this study, we address the feature selection and clustering problems by using a hybrid swarm intelligence approach. We assume that the number of clusters is known, clusters can be of any shape and have different densities, but there are no outliers or noise. The data set may have high dimensionality and redundant features. We propose a swarm intelligence algorithm, namely ACOVNS, which is a hybridization of Ant Colony Optimization (ACO) and Variable Neighborhood Search (VNS). We utilize the ACO mechanism...
Citation Formats
C. Tezcan, “Improbable differential attacks on PRESENT using undisturbed bits,” JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, pp. 503–511, 2014, Accessed: 00, 2020. [Online]. Available: