New Fixed PointAttacks on GOST2 Block Cipher with Memory Complexity Improvements

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.

Ahmadi Siavash; AREF MOHAMMAD REZA

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

Journal Paper

Paper Information

Journal: THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY Year:2019 | Volume:11 | Issue:2 Page(s): 145-158

Download Full-Text

Persian Verion

View:

469

Download:

102

Cites:

Information Journal Paper

Title

New Fixed PointAttacks on GOST2 Block Cipher with Memory Complexity Improvements

Author(s)

Ahmadi Siavash | AREF MOHAMMAD REZA | Issue Writer Certificate

Keywords

CryptanalysisQ1

Fixed Point AttackQ1

GOST2 Block CipherQ1

Meet in the MiddleQ1

Abstract

GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modi ed version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of GOST2 and xed point idea, more enhanced xed point attacks for ltration of wrong keys are presented. More precisely, the focus of the new attacks is on reducing memory complexity while keeping other complexities unchanged as well. The results show a signi cant reduction in the memory complexity of the attacks, while the time complexity slightly increased in comparison to the previous xed point attacks. To the best of our knowledge, the lowest memory complexity for an attack on full-round GOST2 Block Cipher is provided here.

Cites

No record.

References

No record.

Cite

APA: Copy

Ahmadi, Siavash, & AREF, MOHAMMAD REZA. (2019). New Fixed PointAttacks on GOST2 Block Cipher with Memory Complexity Improvements. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 11(2 ), 145-158. SID. https://sid.ir/paper/241775/en

Vancouver: Copy

Ahmadi Siavash, AREF MOHAMMAD REZA. New Fixed PointAttacks on GOST2 Block Cipher with Memory Complexity Improvements. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2019;11(2 ):145-158. Available from: https://sid.ir/paper/241775/en

IEEE: Copy

Siavash Ahmadi, and MOHAMMAD REZA AREF, “New Fixed PointAttacks on GOST2 Block Cipher with Memory Complexity Improvements,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 11, no. 2 , pp. 145–158, 2019, [Online]. Available: https://sid.ir/paper/241775/en

Related Journal Papers