Linear Cryptanalysis of Reduced-round Versions of MORUS

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.

SADEGHI S.; BAGHERI N.

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

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2016 | Volume:4 | Issue:2 (14) Page(s): 53-59

Download Full-Text

Persian Verion

View:

618

Download:

Cites:

Information Journal Paper

Title

Linear Cryptanalysis of Reduced-round Versions of MORUS

Author(s)

SADEGHI S. | BAGHERI N. | Issue Writer Certificate

Keywords

MORUSQ1

Linear cryptanalysisQ1

Mixed Integer Linear ProgrammingQ1

Abstract

CAESAR is a competition for designing authenticated encryption schemes (AE). The schemes that are considered in this competition are supported associated data (AEAD). 57 candidates have been submitted to this competition, out of them 30 candidates later announced as the second round candidates. In this paper, we analysis the security of MORUS, a second round candidate of CAESAR, against mixed integer linear programing based Linear cryptanalysis. In this study, the length of associated data is considered as zero (AD|=0|) and linear characteristics for two version of MORUS, MORUS-640 and MORUS-1280, reduced to 3 rounds with bias and respectively are presented. The result of this paper is the first third party linear analysis on round reduced of MORUS, to the best of our knowledge.

Cites

No record.

References

No record.

Cite

APA: Copy

SADEGHI, S., & BAGHERI, N.. (2016). Linear Cryptanalysis of Reduced-round Versions of MORUS. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 4(2 (14) ), 53-59. SID. https://sid.ir/paper/243193/en

Vancouver: Copy

SADEGHI S., BAGHERI N.. Linear Cryptanalysis of Reduced-round Versions of MORUS. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2016;4(2 (14) ):53-59. Available from: https://sid.ir/paper/243193/en

IEEE: Copy

S. SADEGHI, and N. BAGHERI, “Linear Cryptanalysis of Reduced-round Versions of MORUS,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 4, no. 2 (14) , pp. 53–59, 2016, [Online]. Available: https://sid.ir/paper/243193/en

Related Journal Papers