On Measuring Security Bounds of Some Ciphers Using Mixed Integer Linear Programming (MILP) Approach

Download

CanTuresinThesis.pdf

Date

2021-9-6

Author

Türesin, Can

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

640
views

384
downloads

Block ciphers are one of the symmetric key encryption algorithms that are used in many devices. Its increasing popularity has led to the emergence of new cryptanalysis methods. Therefore, measuring block cipher's security bounds is one main indispensable need for its designers. Two of the most effective attacks on block ciphers are differential and linear cryptanalysis and these attacks' efficiencies are bonded with a number of active S-boxes of the cipher after a certain number of rounds. Consequently, measuring the number of active S-boxes is one of the techniques to measure the security bounds. There are various methods to calculate this number, both mathematically, and automatically. This thesis focuses on computing the minimum number of active S-boxes automatically, more specifically, using an optimization method called Mixed Integer Linear Programming, a method that achieved noticeable success across both the industrial and academic world. In this thesis, a summary of the studies in the literature on how to calculate the minimum number of active S-boxes with MILP will be given, the author's own ideas on this subject will also be shared, and the performance results of recent works and author's ideas will be compared.

Subject Keywords

Cryptanalysis, Milp, Mixed Integer Linear Programming, Number of Active S-boxes

URI

https://hdl.handle.net/11511/93155

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

On the efficient implementation of RSA Güner, Hatice Kübra; Cenk, Murat; Department of Cryptography (2015) Modular exponentiation is an essential operation for many asymmetric key cryptosystems such as RSA in which encryption and decryption are based on modular exponentiation. Therefore, efficiency of the system is effected with running time of the modular exponentiation algorithm. At the same time, key sizes also influence the efficiency of the algorithm. Over the years key sizes had to be increased to provide security. To make RSA practical, one of usable choices is acceleration of the modular exponentiation a...
On the independence of statistical randomness tests included in the NIST test suite SULAK, FATİH; Uğuz, Muhiddin; Koçak, Onur Ozan; Doğanaksoy, Ali (2017-01-01) Random numbers and random sequences are used to produce vital parts of cryptographic algorithms such as encryption keys and therefore the generation and evaluation of random sequences in terms of randomness are vital. Test suites consisting of a number of statistical randomness tests are used to detect the nonrandom characteristics of the sequences. Construction of a test suite is not an easy task. On one hand, the coverage of a suite should be wide; that is, it should compare the sequence under considerati...
On Hiding a Plaintext Length by Preencryption Tezcan, Cihangir (2011-01-01) It is a well known fact that encryption schemes cannot hide a plaintext length when it is unbounded. We thus admit that an approximation of it may leak and we focus on hiding its precise value. Some standards such as TLS or SSH offer to do it by applying some pad-then-encrypt techniques. In this study, we investigate the information leakage when these techniques are used. We define the notion of padding scheme and its associated security. We show that when a padding length is uniformly distributed, the sche...
Analysis of Block Recombination and Lazy Interpolation Methods and Their Applications to Saber Aksoy, Berkin; Cenk, Murat (2022-01-01) Since the beginning of the National Institute of Standards and Technology (NIST), The Post-Quantum Cryptog-raphy (PQC) Standardization Process, efficient implementations of lattice-based algorithms have been studied extensively. Lattice-based NIST PQC finalists use polynomial or matrix-vector multiplications on the ring with type Zq [x]/f(x). For convenient ring types, Number Theoretic Transform (NTT) can be used to perform multiplications as done in Crystals-KYBER among the finalists of the NIST PQC Standa...
A Study on countermeasures on AES against side channel attacks Çenesiz, Damla; Özbudak, Ferruh; Department of Cryptography (2019) Side Channel Attacks have a important role for security of cryptographic algorithm. There are different method which include Threshold Implementation to protect against these kind of attacks. In this thesis, we study certain countermeasures to side channel attacks for AES. We start with a survey on Side Channel Attacks for block ciphers and we mentioned attack models for AES.We give also partical attention Treshold Implementation properties and construction methods. We also give some details of subfield con...

Citation Formats

C. Türesin, “On Measuring Security Bounds of Some Ciphers Using Mixed Integer Linear Programming (MILP) Approach,” M.S. - Master of Science, Middle East Technical University, 2021.