Time and Space Complexity Reduction of a Cryptanalysis Algorithm
Publish place: Journal of Advances in Computer Research، Vol: 2، Issue: 3
Publish Year: 1390
نوع سند: مقاله ژورنالی
زبان: English
View: 455
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACR-2-3_004
تاریخ نمایه سازی: 16 شهریور 1395
Abstract:
Binary Decision Diagram (in short BDD) is an efficient data structure whichhas been used widely in computer science and engineering. BDD-based attack inkey stream cryptanalysis is one of the best forms of attack in its category. In thispaper, we propose a new key stream attack which is based on ZDD(Zero-suppressedBDD). We show how a ZDD-based key stream attack is more efficient in time andspace complexity over its BDD-based variant against the E0 type of the Bluetoothsecurity mechanism. We implemented it by using the CUDD - Colorado UniversityDecision Diagram package. Experimental results show great improvements. Wehave also derived a mathematical proof, which shows that it is better than the BDDbasedattack method even for the worst case analysis.
Keywords:
Authors
Mohammad Ghasemzadeh
Electrical and Computer Engineering Department, Yazd University, Yazd, Iran