Saturation cryptanalysis of CLEFIA by WANG Wei1, WANG Xiao-yun2

Subjects: Get full text

Survey on approaches of stream cipher cryptanalysis by Zhaocun ZHOU, Dengguo FENG

Subjects: “…linear distinguishing cryptanalysis…”
Get full text

Cryptanalysis of an efficient group signature schemen by LU Rong-bo1, XUAN Heng-nong3, HE Da-ke2

Subjects: Get full text

Cryptanalysis of Loiss Stream Cipher-Revisited by Lin Ding, Chenhui Jin, Jie Guan, Qiuyan Wang

Get full text

Impossible differential cryptanalysis of Saturnin algorithm by Zilong JIANG, Chenhui JIN

Get full text

Differential-linear cryptanalysis of PRINCE cipher by Zhengbin LIU

Subjects: “…differential-linear cryptanalysis…”
Get full text

Cryptanalysis of hyperchaotic S-box generation and image encryption by Mohammad Mazyad Hazzazi, Gulraiz, Rashad Ali, Muhammad Kamran Jamil, Sameer Abdullah Nooh, Fahad Alblehai

Subjects: Get full text

Cryptanalysis of the Vesta-2M stream cipher by GUAN Jie

Subjects: Get full text

New cryptanalysis of the authenticated cipher model JAMBU by Yu-dan TIAN, Yong-zhuang WEI

Get full text

Related-key impossible boomerang cryptanalysis on TWINE by Min XIE, Feng TIAN, Jiaqi LI

“…In order to evaluate the security of the lightweight block cipher TWINE,the method of related-key impossible boomerang cryptanalysis was applied and a related-key impossible boomerang distinguisher consisting of 16-round and 17-round paths was constructed.Based on this new distinguisher,an attack on 23-round TWINE was mounted successfully by concatenating 4-round to the beginning and 2-round for the 17-round path and 3-round for the 16-round path to the end respectively.The attack on 23-round TWINE required data complexity of only 2 <sup>62.05</sup>plaintexts and computational complexity of about 2 <sup>70.49</sup>23-round encryptions.Compared with published cryptanalysis results,the proposed attack has obvious advantages.…”
Get full text

Quantum cryptanalysis of lightweight block cipher Piccolo by Xiaoni DU, Xiangyu WANG, Lifang LIANG, Kaibin LI

Subjects: “…quantum cryptanalysis…”
Get full text

Related-key impossible boomerang cryptanalysis on LBlock by Min XIE, Yan-li MU

“…The related-key impossible boomerang cryptanalysis and the strength of the lightweight block cipher LBlock against this method were investigated.A new attack on 22-round LBlock was presented combining impossible boomerang attacks with related-key attacks.A 15-round related-key impossible boomerang distinguisher was constructed.Based on the new distinguisher,an attack on 22-round LBlock was mounted successfully by concatenating 3-round to the beginning and 4-round to the end.The attack on 22-round LBlock required data complexity of only 2^51.3plaintexts and computational complexity of about 2 ^71.5422-round encryptions.Compared with published cryptanalysis results on 22-round LBlock,proposed attack has great advantages on data and computational complexities.…”
Get full text

Cryptanalysis of novel extended multivariate public key cryptosystem by Xu-yun NIE, Bo LIU, Gang LU, Ting ZHONG

Get full text

Cryptanalysis and improvement of several certificateless digital signature schemes by WANG Hua-qun1, XU Ming-hai2, GUO Xian-jiu1

Get full text

Cryptanalysis of a hybrid-structured onion routing scheme by Long-hai LI, Shao-feng FU, Rui-dan SU, Xiang-quan CHE

Get full text

Cryptanalysis of some chaos-based keyed hash functions by ZHENG Shi-hui1, ZHANG Guo-yan3, YANG Yi-xian1, LI Zhong-xian1

Get full text

Cryptanalysis of IAR-CTR and IAR-CFB and a fixing method by Xueqi Zhu, Fangzhou Liu, Yan Jia, Jun Xu, Peng Wang

Subjects: Get full text

Cryptanalysis of an Image Encryption Algorithm Using DNA Coding and Chaos by Yuzhuo Zhao, Qiqin Shi, Qun Ding

Subjects: “…cryptanalysis…”
Get full text

Improved integral cryptanalysis of SPNbox in digital rights management systems by Jun Liu, Dachao Wang, Yupu Hu, Jie Chen, Baocang Wang

Subjects: Get full text

Related-Key Cryptanalysis on the Full PRINTcipher Suitable for IC-Printing by Yuseop Lee, Kitae Jeong, Changhoon Lee, Jaechul Sung, Seokhie Hong

“…In this paper, we propose related-key cryptanalysis of PRINTcipher. To recover the 80-bit secret key of PRINTcipher-48, our attack requires 2 47 related-key chosen plaintexts with a computational complexity of 2 60 · 62 . …”
Get full text