سال انتشار: ۱۳۸۹

محل انتشار: هفتمین کنفرانس انجمن رمز ایران

تعداد صفحات: ۶

نویسنده(ها):

ehsan kazemi – information system and security lab ISSL
behnam fahimnia – information system and security lab ISSL
taraneh eghlidos – electronics research center
mohammadreza aref – information system and security lab ISSL

چکیده:

In this paper we introduce a new cryptanalytic algorithm for evaluating hash functions based on coding theoretic approach which was first used by chabaud and joux to analyze SHA-0.their method is based on finding codewords with low hamming weights where the linearized compress function is modeled by a linear code . canteaut and chabaud a method for finding codewords with low hamming weight . we improve this method by modifying their algorithm. besides using a viterbi-like algorithm we introduce a method for solving the problem with much lower computational complexity and relatively more efficiency.