Biclique Cryptanalysis on the Full Crypton‐256 and mCrypton‐128

Junghwan Song, Kwanhyung Lee and Hwanjin Lee

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: Biclique cryptanalysis is an attack which reduces the computational complexity by finding a biclique which is a kind of bipartite graph. We show a single‐key full‐round attack of the Crypton‐256 and mCrypton‐128 by using biclique cryptanalysis. In this paper, 4‐round bicliques are constructed for Crypton‐256 and mCrypton‐128. And these bicliques are used to recover master key for the full rounds of Crypton‐256 and mCrypton‐128 with the computational complexities of 2253.78 and 2126.5, respectively. This is the first known single‐key full‐round attack on the Crypton‐256. And our result on the mCrypton‐128 has superiority over known result of biclique cryptanalysis on the mCrypton‐128 which constructs 3‐round bicliques in terms of computational time complexity.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/529736

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:529736

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().