OPTIMUM PARAMETER SELECTION FOR RAINBOW TABLE TMTO ATTACK CONSIDERING BREAKING TIME AND USING SEQUENTIAL AND INDEX SEARCH METHODS

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.

HADI M.; MOEINI JAHROMI M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2015 | Volume:3 | Issue:3 (11) Page(s): 49-57

Download Full-Text

Persian Verion

View:

886

Download:

Cites:

Information Journal Paper

Title

OPTIMUM PARAMETER SELECTION FOR RAINBOW TABLE TMTO ATTACK CONSIDERING BREAKING TIME AND USING SEQUENTIAL AND INDEX SEARCH METHODS

Author(s)

HADI M. | MOEINI JAHROMI M. | Issue Writer Certificate

Keywords

TIME-MEMORY TRADE-OFF (TMTO) ATTACKQ2

BREAKING TIMEQ2

SEQUENTIAL SEARCHQ2

INDEX SEARCHQ2

CONSTRAINED OPTIMIZATIONQ2

Abstract

red memory, online search time and success probability are the main performance metrics of a Time Memory Trade-Off (TMTO) Attack. One of the basic challenges in TMTO attack is the way of choosing TMTO attack parameters like number and length of chains to meet some certain performance metrics. Considering online BREAKING TIME, we propose an optimized procedure for selecting rainbow table TMTO attack parameters. Unlike previous works that mainly deal with minimizing required memory in the rainbow table TMTO attack, we simultaneously focus on the required memory and the online BREAKING TIME and consider index and SEQUENTIAL SEARCH techniques. Our parameter selection technique is optimized regarding the minimization of the required memory subject to a certain success probability and a maximum online BREAKING TIME. Obtained results are two compact mathematical expressions for determining the rainbow table TMTO attack parameters, number and length of chains for the sequential and the INDEX SEARCH methods. The application of our optimized parameter selection procedure is also shown in few sample design examples.

Cites

No record.

References

No record.

Cite

APA: Copy

HADI, M., & MOEINI JAHROMI, M.. (2015). OPTIMUM PARAMETER SELECTION FOR RAINBOW TABLE TMTO ATTACK CONSIDERING BREAKING TIME AND USING SEQUENTIAL AND INDEX SEARCH METHODS. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 3(3 (11)), 49-57. SID. https://sid.ir/paper/243182/en

Vancouver: Copy

HADI M., MOEINI JAHROMI M.. OPTIMUM PARAMETER SELECTION FOR RAINBOW TABLE TMTO ATTACK CONSIDERING BREAKING TIME AND USING SEQUENTIAL AND INDEX SEARCH METHODS. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2015;3(3 (11)):49-57. Available from: https://sid.ir/paper/243182/en

IEEE: Copy

M. HADI, and M. MOEINI JAHROMI, “OPTIMUM PARAMETER SELECTION FOR RAINBOW TABLE TMTO ATTACK CONSIDERING BREAKING TIME AND USING SEQUENTIAL AND INDEX SEARCH METHODS,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 3, no. 3 (11), pp. 49–57, 2015, [Online]. Available: https://sid.ir/paper/243182/en

Related Journal Papers