TIME AND SPACE COMPLEXITY REDUCTION OF A CRYPTANALYSIS ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GHASEMZADEH MOHAMMAD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2011 | Volume:2 | Issue:3 (5) Page(s): 39-46

Download Full-Text

View:

255

Download:

121

Cites:

Information Journal Paper

Title

TIME AND SPACE COMPLEXITY REDUCTION OF A CRYPTANALYSIS ALGORITHM

Author(s)

GHASEMZADEH MOHAMMAD | Issue Writer Certificate

Keywords

BINARY DECISION DIAGRAM

CRYPTANALYSIS

ALGORITHM COMPLEXITY

Abstract

BINARY DECISION DIAGRAM (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream CRYPTANALYSIS is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD (Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and space complexity over its BDD-based variant against the E0 type of the Bluetooth security mechanism. We implemented it by using the CUDD - Colorado University Decision Diagram package. Experimental results show great improvements. We have also derived a mathematical proof, which shows that it is better than the BDDbased attack method even for the worst case analysis.

Cites

No record.

References

No record.

Cite

APA: Copy

GHASEMZADEH, MOHAMMAD. (2011). TIME AND SPACE COMPLEXITY REDUCTION OF A CRYPTANALYSIS ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 2(3 (5)), 39-46. SID. https://sid.ir/paper/328668/en

Vancouver: Copy

GHASEMZADEH MOHAMMAD. TIME AND SPACE COMPLEXITY REDUCTION OF A CRYPTANALYSIS ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2011;2(3 (5)):39-46. Available from: https://sid.ir/paper/328668/en

IEEE: Copy

MOHAMMAD GHASEMZADEH, “TIME AND SPACE COMPLEXITY REDUCTION OF A CRYPTANALYSIS ALGORITHM,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 2, no. 3 (5), pp. 39–46, 2011, [Online]. Available: https://sid.ir/paper/328668/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops