Özgül Küçük

Learn More
In this paper, we analyze the initialization algorithm of Grain, one of the eSTREAM candidates which made it to the third phase of the project. We point out the existence of a sliding property in the initial-ization algorithm of the Grain family, and show that it can be used to reduce by half the cost of exhaustive key search (currently the most efficient(More)
This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications reduced hardware requirements. MAME takes a 256-bit message block and a 256-bit chaining variable as input and produces a 256-bit output. Seen in the light of attacks on MD5 and SHA-1, our design strategy enables us to(More)
In this paper, we will present an approach to find efficient bitsliced implementations of invertible 4 × 4-bit s-boxes. The approach generalises the methods introduced by Osvik [12]. We consider equivalence classes of s-boxes under linear and affine equivalence and search for the most efficient s-box in each class. The properties of these s-boxes are(More)
Preface Another year, another thesis, another subject. Cryptography has always drawn my interest , though I have never known what it basically comes down to. Genetic algorithms on the other hand seemed a pretty nice idea to me, but I wanted to check its merits on a real problem. So this two reasons led me to choosing the subject of this thesis. I learned(More)
  • 1