Differential factors and differential cryptanalysis of block cipher PRIDE

Doğan, Erol
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 block ciphers. Differential cryptanalysis is one of the important methods used in block cipher analysis. This method deals with how minor differences made in the plaintext can lead to certain differences in the cipher text. It is examined that whether the expected differences are observed or not by testing all candidate key bits on a number of plaintextciphertext pairs. The correct key is expected to provide these differences more times than the wrong keys. By this means the correct key is captured. However, a recent study, Differential Factors showed that it may not be possible to fully capture the attacked round key bits when performing a differential attack. Besides, another recent study Undisturbed Bits can be used for discovering longer differential characteristics that provides opportunity for more powerful differential attacks. Inthisthesis,wehaveinvestigatedseverallightweightblockciphersfortheexistence vi of Differential Factors and Undisturbed Bits. We have also shown how differential factors can be used to reduce the time complexity of differential attacks by summarizing the corrected attacks on PRESENT and SERPENT block ciphers. Moreover, we have also investigated the 18-round, 19-round and 20-round differential attacks on PRIDE block cipher and we have corrected these attacks considering differential factors. As a result, by our correction we have shown that these attacks require more time complexity than they were claimed.


Slide attack and its applications
Uslu, Erkan; Doğanaksoy, Ali; Uğuz, Muhiddin; Department of Cryptography (2017)
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 b...
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...
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...
A Survey on the provable security using indistinguishability notion on cryptographic encryption schemes
Ayar, Emre; Doğanaksoy, Ali; Koçak, Onur; Department of Cryptography (2018)
For an encryption scheme, instead of Shannon's perfect security definition, Goldwasser and Micali defined a realistic provable security called semantic security. Using indistinguishability notion, one can define security levels according to the polynomial time adversaries' capabilities such as chosen plaintext attacks (CPA) and chosen ciphertext attacks (CCA) for both symmetric and asymmetric encryption schemes in addition to the hard mathematical problems the algorithms based on. Precautions to prevent the...
Analysis of recent attacks on SSL/TLS protocols
Özden, Duygu; Cenk, Murat; Department of Cryptography (2016)
Transport Layer Security(TLS) and its predecessor Secure Socket Layer(SSL) are two important cryptographic, certificate based protocols that satisfy secure communication in a network channel. They are widely used in many areas such as online banking systems, online shopping, e-mailing, military systems or governmental systems. Being at the center of secure communication makes SSL and TLS become the target of attackers and an important field of study for researchers. So many vulnerabilities and attacks towar...
Citation Formats
E. Doğan, “Differential factors and differential cryptanalysis of block cipher PRIDE,” M.S. - Master of Science, Middle East Technical University, 2017.