- 期刊
Security Analysis of Double Length Compression Function Based on Block Cipher
並列摘要
Recently Nandi etc. have proposed a 1/3-rate and a 2/3-rate double length compression functions and studied their security in the black-box model. They proved that to find a collision for the compression function, it requires Ω(2^(2n/3)) queries, where n is the length of output size. In this paper, we show that not all hash functions based on block cipher constructed according to their model are of the same security .i.e., the complexity to find the collisions for these hash functions can be reduced to O(2^(n/2)).
延伸閱讀
- Wu, S. Y. (2019). A Logic Obfuscation Scheme for Memory Security [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0206202016185335
- 鄧喬濂（2012）。A Variant of SAFER Cipher with One Algorithm for Both Encryption and Decryption〔碩士論文，健行科技大學〕。華藝線上圖書館。https://doi.org/10.6824/UCH.2012.00041
- 傅振華、林裕淇、楊欽舜、陳易佑（2010）。A Study on Dynamic Symmetric Block Encryption Scheme with Pseudo Random Number。載於國防大學管理學院（主編），國防管理學術暨實務研討會（頁527-541）。國防大學管理學院。https://doi.org/10.29497/GFGL.201006.0527
- Chou, J. W. (2012). Learning-based Approach to Analysis of Block Ciphers and Side-channel Attack [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2012.00758
- Jain, A., & Lakhtaria, K. I. (2014). A Comparative Study of Lossless Compression Algorithm on Text Data. International Journal of Electronics and Information Engineering, 1(1), 45-52. https://doi.org/10.6636/IJEIE.201409.1(1).07