Author of the publication

Designing Content Placement of CDN for Improving Aggregation Effect of ICN FIBs.

, , and . ICOIN, page 130-135. IEEE, (2020)

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.

 

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)Preface to Volume 2019, Issue 1., and . IACR Trans. Symmetric Cryptol., 2019 (1): 1-4 (2019)Improved Single-Key Distinguisher on HMAC-MD5 and Key Recovery Attacks on Sandwich-MAC-MD5 and MD5-MAC., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 98-A (1): 26-38 (2015)Improved Collision Attack on MD4., , , and . IACR Cryptology ePrint Archive, (2005)Refinements of the k-tree Algorithm for the Generalized Birthday Problem., and . IACR Cryptology ePrint Archive, (2016)2-Dimension Sums: Distinguishers Beyond Three Rounds of RIPEMD-128 and RIPEMD-160., and . IACR Cryptology ePrint Archive, (2012)New Impossible Differential Search Tool from Design and Cryptanalysis Aspects., and . IACR Cryptology ePrint Archive, (2016)SoK: Peigen - a Platform for Evaluation, Implementation, and Generation of S-boxes., , , and . IACR Cryptology ePrint Archive, (2019)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)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)