( en | de | ru )

 

Disambiguation of "Sasaki, Yu"

Author of the publication

copydeleteadd this publication to your clipboard
Designing S-Boxes Providing Stronger Security Against Differential Cryptanalysis for Ciphers Using Byte-Wise XOR.

, and . SAC, volume 13203 of Lecture Notes in Computer Science, page 179-199. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mei Sasaki

Manami Sasaki

Chiyoko Sasaki

Felix Sasaki

Yu-Ting Yu

 

Other publications of authors with the same name

Tight Bounds of Differentially and Linearly Active S-Boxes and Division Property of Lilliput., and . IEEE Trans. Computers, 67 (5): 717-732 (2018)SoK: Peigen - a Platform for Evaluation, Implementation, and Generation of S-boxes., , , and . IACR Cryptology ePrint Archive, (2019)Collisions of MMO-MD5 and Their Impact on Original MD5.. AFRICACRYPT, volume 6737 of Lecture Notes in Computer Science, page 117-133. Springer, (2011)Generic State-Recovery and Forgery Attacks on ChopMD-MAC and on NMAC/HMAC., , , and . IWSEC, volume 8231 of Lecture Notes in Computer Science, page 83-98. Springer, (2013)Preimage Attacks on Step-Reduced MD5., and . ACISP, volume 5107 of Lecture Notes in Computer Science, page 282-296. Springer, (2008)Improved Known-Key Distinguishers on Feistel-SP Ciphers and Application to Camellia., , , and . ACISP, volume 7372 of Lecture Notes in Computer Science, page 87-100. Springer, (2012)Optimizing Online Permutation-Based AE Schemes for Lightweight Applications., and . ISPEC, volume 10701 of Lecture Notes in Computer Science, page 217-236. Springer, (2017)Limited-Birthday Distinguishers for Hash Functions - Collisions beyond the Birthday Bound Can Be Meaningful., , and . ASIACRYPT (2), volume 8270 of Lecture Notes in Computer Science, page 504-523. Springer, (2013)A New Algorithm for the Unbalanced Meet-in-the-Middle Problem., and . ASIACRYPT (1), volume 10031 of Lecture Notes in Computer Science, page 627-647. (2016)Memoryless Unbalanced Meet-in-the-Middle Attacks: Impossible Results and Applications.. ACNS, volume 8479 of Lecture Notes in Computer Science, page 253-270. Springer, (2014)