Cryptanalysis of ARX Ciphers

cn flag

Rotational Cryptanalysis of ARX show that rotational probability of an ARX primitive can be computed by $p^q$ where $p$ is rotational probability of modular addition and $q$ is number of modular additions in ARX primitive. Similarly, Rotational Cryptanalysis of ARX Revisited extends it to chained additions.

How to calculate rotational probability/ extend above cited probabilities to ARX primitives that employ both modular addition and multiplication?

Is the rotational probability for modular addition and subtraction be same?

I sit in a Tesla and translated this thread with Ai:


Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.