Differential factors and differential cryptanalysis of block cipher PRIDE

Download

index.pdf

Date

2017

Author

Doğan, Erol

Metadata

Show full item record

Item Usage Stats

207
views

86
downloads

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

Subject Keywords

Ciphers., Cryptography., Data protection., Computer security., Data encryption (Computer science).

URI

http://etd.lib.metu.edu.tr/upload/12621045/index.pdf
https://hdl.handle.net/11511/26571

Collections

Graduate School of Informatics, Thesis

Suggestions

OpenMETU
Core

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...
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 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...
Internet Connection Sharing Through NFC for Connection Loss Problem in Internet-of-Things Devices Turk, Ismail; Coşar, Ahmet (2015-08-28) Contactless devices and smart cards have been widely in use in daily life transactions for a long time. At first, those systems were designed to work fully offline for both the reader and the card side. With technological improvements, Internet connection can be available even in very small embedded devices (IoT devices). As a result, current systems have connected devices as a part of the transaction design and so keeping the system operational all the time relies on the availability of continuous Internet...
Security of certificate-based protocols: focus on server authentication Baran, Selim; Özbudak, Ferruh; Selçuk, Ali Aydın; Department of Cryptography (2015) Today, secure communication channels are mostly set up via certificate-based protocols, such as Secure Sockets Layer (SSL) and Transport Layer Security (TLS). Although they have been used for years and in so many areas, from e-commerce and internet banking to secure channel needs in military, there have been several attacks on their security model, which forced researchers to make studies on them. In this thesis, we will explain their security model, the vulnerabilities discovered so far, the precautions fo...

Citation Formats

E. Doğan, “Differential factors and differential cryptanalysis of block cipher PRIDE,” M.S. - Master of Science, Middle East Technical University, 2017.