Slide attack and its applications

Download
index.pdf
2017
Uslu, Erkan
Show full item record
161
views
61
downloads
Block ciphers, widely used in cryptography, have been designed to encrypt large amount of data such as public sector services, banking services, Healthcare contributions. With the increment of technological developments, they have also been started to be used for small data in industrial products such as Internet of Things, smart cards, car keys etc. These types of cryptosystems are called as lightweight cryptosystems. Similar to other cryptographic algorithms, the ones used in lightweight systems need to be tested towards cryptanalytic techniques. The most common techniques are differential and linear cryptanalysis. However, they become less efficient when the number of rounds in algorithms is increased. At this point, a new method called slide attack which is independent of the number of rounds is developed. This thesis focuses on the fundamentals of the slide attack and especially how it works on block ciphers. Additionally, some applications that will be beneficial to understand slide attack is given. Moreover, we give a practical attack to a variant of PRESENT lightweight block cipher.
Ciphers., Cryptography., Computer algorithms., Data encryption (Computer science).
http://etd.lib.metu.edu.tr/upload/12621522/index.pdf
https://hdl.handle.net/11511/26779
Graduate School of Applied Mathematics, Thesis

Suggestions

Differential factors and differential cryptanalysis of block cipher PRIDE
Doğan, Erol; Özkan Yıldırım, Sevgi; Tezcan, Cihangir; Department of Cyber Security (2017)
Today, IoT devices are used in very critical areas like payment cards, contactless keys and biometric authentication. Moreover, while the number of IoT Technologies increases, cryptographic systems that are optimized for IoT devices that require less cost, less power, and less memory are highly required in today’s industry. Therefore, in recent years several lightweight block ciphers are published to satisfy industry needs. However, there are still more work needed to be sure about the security of these blo...
On provable security of some public key encryption schemes
Hanoymak, Turgut; Akyıldız, Ersan; Selçuk, Ali Aydın; Department of Cryptography (2012)
In this thesis, we analyse the security criteria of some public key encryption schemes. In this respect, we present the notion of adversarial goals and adversarial capabilities. We give the definition of provably security by means of several games between the challenger and the adversary in some security models, namely the standard model and the random oracle model. We state the main differences between these two models and observe the advantage of the success probability of the adversary in breaking the cr...
SAOTS: A new efficient server assisted signature scheme for pervasive computing
Bicakci, K; Baykal, Nazife (2004-01-01)
Two most important goals of server assisted signature schemes are to aid small and mobile devices in computing digital signatures and to provide immediate revocation of signing capabilities. In this paper, we introduce an efficient scheme named server assisted one-time signature (SAOTS) alternative to server assisted signature scheme introduced by Asokan et al. Extended the Lamport's one-time signatures by utilizing hash chains, this new scheme's advantages are two-folds; first of all, it is communication-e...
Security analysis of electronic signature applications and test suite study
Ergun, Tamer; Özbudak, Ferruh; Department of Cryptography (2013)
Digital signature technology is used widely for security and trust in electronic business and communications. Nowadays it becomes commonly used especially in government agencies. From this point of view, it is crucial to implement correct applications to create and verify digital signatures. CEN (European Commitee for Standardization) has introduced the security requirements for signature applications but neither proposed a PKI model nor implemented a test suite to evaluate the accuracy of signature applica...
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...
Citation Formats
E. Uslu, “Slide attack and its applications,” M.S. - Master of Science, Middle East Technical University, 2017.
METU IIS - Integrated Information Service open@metu.edu.tr