A new distinguishing attack on reduced round ChaCha permutation by Chandan Dey, Santanu Sarkar

“…(in: Advances in Cryptology—ASIACRYPT 2022—28nd International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5–9, 2012, Springer, 2022), which achieved time complexity $$2^{214}$$ 2 214 . …”
Get full text

Enhancing the Key Recovery Attack on Round Reduced Salsa by Chandan Dey, Sabyasachi Dey, Rahul Girme, Santanu Sarkar

“…Our attack complexity is <inline-formula> <tex-math notation="LaTeX">$2^{210.38}$ </tex-math></inline-formula>, which is an improvement of the latest work at ASIACRYPT 2022. We also revisit the work of Ghafoori et al. …”
Get full text