Rotational Cryptanalysis on Shabal and CubeHash

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.

Tabatabaei Feiz Abad S.A.; GAINI A.; Keshavarzi Behbod

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

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2018 | Volume:6 | Issue:3 (23) Page(s): 59-64

Download Full-Text

Persian Verion

View:

559

Download:

Cites:

Information Journal Paper

Title

Rotational Cryptanalysis on Shabal and CubeHash

Author(s)

Tabatabaei Feiz Abad S.A. | GAINI A. | Keshavarzi Behbod | Issue Writer Certificate

Keywords

Hash FunctionQ1

Rotational CryptanalysisQ1

Modular AdditionQ1

Markov ChainingQ1

Abstract

Hash Functions have a very important role in network and telecommunication security. These functions play an important role in hashing a message which are widely used in cryptographic applications such as digital signatures, random number generator algorithms, authentication protocols, and so on. Rotational Cryptanalysis is a relatively new attack that is part of a generic attack on Hash Functions and is effective on algorithms that have an ARX structure. In this paper, for the first time, we apply a Rotational Cryptanalysis and with the given assumption of the markov chain for the Modular Additions sequence employed in two algorithms Shabal and CubeHash, which are second-round candidates for the SHA-3 competition that use the ARX property in their structure. With the implementation of Rotational Cryptanalysis we arrived at the complexity of 2-3393. 58 for the entire 16+3-rounds Shabal algorithm and the complexity of 2-57. 6 for the en-tire 16-round CubeHash algorithm. According to the obtained results, it can be seen that due to the large number of Modular Additions with the given assumption of markov chain, the Shabal algorithm exhibits greater resistance to Rotational Cryptanalysis, compared to the CubeHash algorithm and is less likely to succeed.

Cites

No record.

References

No record.

Cite

APA: Copy

Tabatabaei Feiz Abad, S.A., GAINI, A., & Keshavarzi, Behbod. (2018). Rotational Cryptanalysis on Shabal and CubeHash. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 6(3 (23) ), 59-64. SID. https://sid.ir/paper/243176/en

Vancouver: Copy

Tabatabaei Feiz Abad S.A., GAINI A., Keshavarzi Behbod. Rotational Cryptanalysis on Shabal and CubeHash. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2018;6(3 (23) ):59-64. Available from: https://sid.ir/paper/243176/en

IEEE: Copy

S.A. Tabatabaei Feiz Abad, A. GAINI, and Behbod Keshavarzi, “Rotational Cryptanalysis on Shabal and CubeHash,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 6, no. 3 (23) , pp. 59–64, 2018, [Online]. Available: https://sid.ir/paper/243176/en

Related Journal Papers