Cryptographic analysis of linear and differential PRESENT attacks

Cryptographic analysis of linear and differential PRESENT attacks

shiva mokhtari1

1) MSc Student in Software Engineering, Non-profit University of Arvand Khorramshahr

IOI Code : XCZE-EDZDF
Publication : 3.rd International Congress of Science, Engineering and Technology - Hamburg(germanconf.com)
Abstract :
    One of the strongest cryptanalytic techniques is against block ciphers. Statistical attacks use a block attribute to block ciphers so that an incident occurs with different probabilities depending on whether the correct key is used. For instance, the differential of characteristics takes into account that a particular output difference should be obtained with a relatively high probability when a particular input difference is used. Hence, when the correct key is used, the predicted difference occurs. In a classical differential characteristic, the differences are fully identified and in a flawed difference only parts of It uses an impossible differential that indicates that a particular difference does not occur for the right key (i.e., the probability of this event is exactly zero). If these differences are tested under a key, then it cannot be true. Therefore, the correct key can be obtained by deleting whole or more false keys

Keywords : cryptographic present permutation boxes sbox linear analysis differential analysis