Tight Security of TNT Reinforcing Khairallah’s Birthday-bound Attack
暂无分享,去创建一个
[1] Chun Guo,et al. Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher , 2022, Designs, Codes and Cryptography.
[2] Mridul Nandi,et al. A Survey on Applications of H-Technique: Revisiting Security Analysis of PRP and PRF , 2022, Entropy.
[3] Ling Song,et al. Towards Closing the Security Gap of Tweak-aNd-Tweak (TNT) , 2020, ASIACRYPT.
[4] Jian Guo,et al. TNT: How to Tweak a Block Cipher , 2020, EUROCRYPT.
[5] John P. Steinberger,et al. Tight Security Bounds for Key-Alternating Ciphers , 2014, EUROCRYPT.
[6] Jacques Patarin,et al. The "Coefficients H" Technique , 2009, Selected Areas in Cryptography.
[7] Mridul Nandi,et al. A Simple and Unified Method of Proving Indistinguishability , 2006, INDOCRYPT.
[8] David A. Wagner,et al. Tweakable Block Ciphers , 2002, Journal of Cryptology.
[9] Mustafa Khairallah. CLRW1 3 is not Secure Beyond the Birthday Bound Breaking TNT with O(2 n / 2 ) queries , 2023 .