<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Society of Cryptology</PublisherName>
				<JournalTitle>The ISC International Journal of Information Security</JournalTitle>
				<Issn>2008-2045</Issn>
				<Volume>11</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2019</Year>
					<Month>01</Month>
					<Day>30</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>57</FirstPage>
			<LastPage>74</LastPage>
			<ELocationID EIdType="pii">79989</ELocationID>
			
<ELocationID EIdType="doi">10.22042/isecure.2018.138036.420</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Siavash</FirstName>
					<LastName>Ahmadi</LastName>
<Affiliation>Department of Electrical Engineering
Sharif University of Technology</Affiliation>
<Identifier Source="ORCID">0000-0002-8801-337X</Identifier>

</Author>
<Author>
					<FirstName>Zahra</FirstName>
					<LastName>Ahmadian</LastName>
<Affiliation>Shahid Beheshti University</Affiliation>

</Author>
<Author>
					<FirstName>Javad</FirstName>
					<LastName>Mohajeri</LastName>
<Affiliation>Sharif University of Technology,</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Reza</FirstName>
					<LastName>Aref</LastName>
<Affiliation>Department of Electrical Engineering
Sharif University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2018</Year>
					<Month>06</Month>
					<Day>30</Day>
				</PubDate>
			</History>
		<Abstract>In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amount of this complexity the same and reduce the data complexity enormously by a shorter biclique.&lt;br /&gt; With this approach, we analysed full-round of LBlock, and also LBlock with modified key schedule (which was designed to resist biclique attack) both with data complexity 2^12, while the data complexity of the best biclique attack on the former was 2^52 and for the latter there is no attack on the full-round cipher, so far. Then we proposed a new key schedule that is more resistant against biclique cryptanalysis, though the low diffusion of the cipher makes it vulnerable to this attack regardless of the strength of the key schedule. Also using this method, we analyzed TWINE-80 with 2^12 data complexity. The lowest data complexity for the prior attack on the TWINE-80 was 2^60. In all the attacks presented in this paper, the computational complexities are slightly improved in comparison to the existing attacks.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">lightweight cryptography</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">biclique cryptanalysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">partial matching</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">early abort technique</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://www.isecure-journal.com/article_79989_6ceed97c551abb399b4fbe5432af9197.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
