مقالههای taraneh eghlidos
توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقالههای نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده میشوند.
اطلاعات انتشار: هفتمین کنفرانس انجمن رمز ایران، سال ۱۳۸۹
تعداد صفحات: ۶
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.<\div>
اطلاعات انتشار: یازدهمین کنفرانس سالانه انجمن کامپیوتر ایران، سال ۱۳۸۴
تعداد صفحات: ۷
Algebraic cryptanalysis is a general attack in which a cryptosystem is broken by solving a system of multivariate equations over a finite field (e.g. GF (2)) that describes the whole cryptosystem. In this paper we investigate the resistance of Kahkeshan block cipher against algebraic cryptanalysis. One of the most effective algorithms used for applying algebraic attacks on block ciphers is XSL algorithm. Our results of applying this algorithm to realize the attack on 8–round and 10–round Kahkeshan indicate a significant decrease in the complexity of the attack by the factor 2119 in comparison with the complexity of differential attack on 8–round Kahkeshan; and by the factor 271 as compared with that of boomerang attack on 10–round Kahkeshan, which have already been reported in the open literatures.<\div>
اطلاعات انتشار: سومین کنفرانس بین المللی پژوهشهای کاربردی در مهندسی کامپیوتر و فن آوری اطلاعات، سال ۱۳۹۴
تعداد صفحات: ۷
Search ability on encrypted data without any information leakage is a matter of concern in cloud computing.Also, establishing such a policy to control data access is another concern. Searchable encryption (SE) along withattribute–based encryption (ABE) have resolved both problems. Attribute–based keyword search (ABKS) scheme usesboth features simultaneously. In most ABKS schemes, data user has no freedom of action in his search and he can justquery the cloud to search for certain keywords. While he may not need to receive some data. We have focused on thisissue and proposed a scheme which can seive the search results. In the proposed scheme, both data user and dataowner establish their policies to determine which keywords or files are to be searched or accessed. Besides, the dataowner attaches his files using labels to specify the contents of the files to prevent any conceptual ambiguity in thedesired keywords. In spite of using two ABKS schemes the computational complexity of the proposed scheme is notdoubled.<\div>
اطلاعات انتشار: International Journal of Information Security، چهارم،شماره۱، Jan ۲۰۱۲، سال ۰
تعداد صفحات: ۱۲
This paper proposes an efficient joint secret key encryption–channel coding cryptosystem, based on regular Extended Difference Family Quasi–Cyclic Low– Density Parity–Check codes.The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Rao–Nam cryptosystem against chosen plaintext attacks, benefiting from an improvement on the structure of the Rao–Nam cryptosystem and proper choices of code parameters. Moreover, the proposed cryptosystem benefits from the highest code rate and a proper error performance.
نمایش نتایج ۱ تا ۴ از میان ۴ نتیجه