Results 11 to 20 of about 738 (105)

Improved rotational‐XOR cryptanalysis of Simon‐like block ciphers [PDF]

open access: yesIET Information Security, 2022
Rotational‐XOR (RX) cryptanalysis is a cryptanalytic method aimed at finding distinguishable statistical properties in Addition‐Rotation‐XOR‐C ciphers, that is, ciphers that can be described only by using modular addition, cyclic rotation, XOR and the ...
Jinyu Lu   +4 more
doaj   +7 more sources

Rotational Cryptanalysis on ChaCha Stream Cipher [PDF]

open access: yesSymmetry, 2022
In this paper we consider the ChaCha20 stream cipher in the related-key scenario and we study how to obtain rotational-XOR pairs with nonzero probability after the application of the first quarter round.
Barbero, Stefano   +2 more
core   +4 more sources

Rotational Cryptanalysis in the Presence of Constants [PDF]

open access: yesIACR Transactions on Symmetric Cryptology, 2016
Rotational cryptanalysis is a statistical method for attacking ARX constructions. It was previously shown that ARX-C, i.e., ARX with the injection of constants can be used to implement any function.
Tomer Ashur, Yunwen Liu
doaj   +5 more sources

Rotational-XOR Cryptanalysis of Simon-like Block Ciphers [PDF]

open access: yesJournal of Cryptology, 2020
Rotational-XOR cryptanalysis is a cryptanalytic method aimed at finding distinguishable statistical properties in ARX-C ciphers, i.e., ciphers that can be described only using modular addition, cyclic rotation, XOR, and the injection of constants.
B Koo   +16 more
core   +5 more sources

Rotational Cryptanalysis of ARX Revisited [PDF]

open access: yesLecture Notes in Computer Science, 2015
Rotational cryptanalysis is a probabilistic attack applicable to word oriented designs that use (almost) rotation-invariant constants. It is believed that the success probability of rotational cryptanalysis against ciphers and functions based on modular
Dmitry Khovratovich   +4 more
core   +7 more sources

Rotational-Linear Attack: A New Framework of Cryptanalysis on ARX ciphers with Applications to Chaskey [PDF]

open access: yesLecture Notes in Computer Science, 2021
In this paper, we formulate a new framework of cryptanalysis called rotational-linear attack on ARX ciphers. We firstly build an efficient distinguisher for the cipher $ E$ consisted of the rotational attack and the linear attack together with some ...
Baofeng Wu, Dongdai Lin, Yaqi Xu
core   +4 more sources

Rotational Cryptanalysis of MORUS [PDF]

open access: yesSymmetry, 2021
MORUS is one of the finalists of the CAESAR competition. This is an ARX construction that required investigation against rotational cryptanalysis. We investigated the power of rotational cryptanalysis against MORUS. We show that all the operations in the state update function of MORUS maintain the rotational pairs when the rotation distance is set to a
Iftekhar Salam
openaire   +3 more sources

Rotational-XOR Cryptanalysis of Reduced-round SPECK

open access: yesIACR Transactions on Symmetric Cryptology, 2017
In this paper we formulate a SAT/SMT model for Rotational-XOR (RX) cryptanalysis in ARX primitives for the first time. The model is successfully applied to the block cipher family Speck, and distinguishers covering more rounds than previously are found ...
Yunwen Liu   +3 more
doaj   +3 more sources

Rotational Cryptanalysis of ARX [PDF]

open access: yesLecture Notes in Computer Science, 2010
In this paper we analyze the security of systems based on modular additions, rotations, and XORs (ARX systems). We provide both theoretical support for their security and practical cryptanalysis of real ARX primitives. We use a technique called rotational cryptanalysis, that is universal for the ARX systems and is quite efficient.
Khovratovich, Dmitry, Nikolic, Ivica
openaire   +4 more sources

Rotational Cryptanalysis of Round-Reduced Keccak [PDF]

open access: yesLecture Notes in Computer Science, 2014
In this paper we attack round-reduced Keccak hash function with a technique called rotational cryptanalysis. We focus on Keccak variants proposed as SHA-3 candidates in the NIST’s contest for a new standard of cryptographic hash function. Our main result is a preimage attack on 4-round Keccak and a 5-round distinguisher on Keccak-\(f\)[1600 ...
Morawiecki, Pawel   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy