检索结果-南通市图书馆

维普期刊数据库

同方期刊数据库

SCENERY:a lightweight block cipher based on Feistel structure

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2022年第3期16卷 193-202页

作者： Jingya FENG Lang LI Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang Normal UniversityHengyang 421002China College of Information Science and Engineering Hunan Normal UniversityChangsha 410081China College of Computer Science and Technology Hengyang Normal UniversityHengyang 421002China

In this paper,we propose a new lightweight block cipher called *** main purpose of SCENERY design applies to hardware and software *** is a 64-bit block cipher supporting 80-bit keys,and its data processing consists of 28 *** round function of SCENERY consists of 84×4 S-boxes in parallel and a 32× 32 binary matrix,and we can implement SCENERY with some basic logic *** hardware implementation of SCENERY only requires 1438 GE based on 0.18 um CMOS technology,and the software implementation of encrypting or decrypting a block takes approximately 1516 clock cycles 0118-bit microcontrollers and 364 clock cycles on 64-bit *** with other encryption algorithms,the performance of SCENERY is well balanced for both hardware and *** the security analyses,SCENERY can achieve enough security margin against known attacks,such as differential cryptanalysis,linear cryptanalysis,impossible differential cryptanalysis and related-key attacks.

关键词： lightweight block cipher feistel structure cryptanalysis internet of things

维普期刊数据库

同方期刊数据库

Temperature-Triggered Hardware Trojan Based Algebraic Fault Analysis of SKINNY-64-64 lightweight block cipher

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第6期75卷 5521-5537页

作者： Lei Zhu Jinyue Gong Liang Dong Cong Zhang Communication and Electronics Engineering Institute Qiqihar UniversityQiqihar161006China

SKINNY-64-64 is a lightweight block cipher with a 64-bit block length and key length,and it is mainly used on the Internet of Things(IoT).Currently,faults can be injected into cryptographic devices by attackers in a variety of ways,but it is still difficult to achieve a precisely located fault attacks at a low cost,whereas a Hardware Trojan(HT)can realize ***,as a physical quantity incidental to the operation of a cryptographic device,is easily *** this paper,a temperature-triggered HT(THT)is designed,which,when activated,causes a specific bit of the intermediate state of the SKINNY-64-64 to be ***,in this paper,a THT-based algebraic fault analysis(THT-AFA)method is *** demonstrate the effectiveness of the method,experiments on algebraic fault analysis(AFA)and THT-AFA have been carried out on *** the THT-AFA for SKINNY-64-64,it is only required to activate the THT 3 times to obtain the master key with a 100%success rate,and the average time for the attack is 64.57 ***,when performing AFA on this cipher,we provide a relation-ship between the number of different faults and the residual entropy of the *** comparison,our proposed THT-AFA method has better performance in terms of attack *** the best of our knowledge,this is the first HT attack on SKINNY-64-64.

关键词： SKINNY-64-64 lightweight block cipher algebraic fault analysis Hardware Trojan residual entropy

Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2015年第6期30卷 1358-1369页

作者：于晓丽吴文玲石振青张建张蕾汪艳凤 Trusted Computing and Information Assurance Laboratory Institute of Software Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China

In June 2013, the U.S. National Security Agency proposed two families of lightweight block ciphers, called SIMON and SPECK respectively. These ciphers are designed to perform excellently on both hardware and software platforms. In this paper, we mainly present zero-correlation linear cryptanalysis on various versions of SIMON. Firstly, by using miss- in-the-middle approach, we construct zero-correlation linear distinguishers of SIMON, and zero-correlation linear attacks are presented based oi1 careful analysis of key recovery phase. Secondly, multidimensional zero-correlation linear attacks are used to reduce the data complexity. Our zero-correlation linear attacks perform better than impossible differential attacks proposed by Abed et al. in ePrint Report 2013/568. Finally, we also use the divide-and-conquer technique to improve the results of linear cryptanalysis proposed by Javad et al. in ePrint Report 2013/663.

关键词： lightweight block cipher SIMON linear cryptanalysis zero-correlation dual property

Differential Fault Attack on GIFT

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2021年第4期30卷 669-675页

作者： XIE Min TIAN Feng LI Jiaqi State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Key Laboratory of blockchain and Secure Computing

GIFT, a lightweight block cipher proposed at CHES2017, has been widely cryptanalyzed this *** paper studies the differential diffusion characteristics of round function of GIFT at first, and proposes a random nibble-based differential fault attack. The key recovery scheme is developed on the statistical properties we found for the differential distribution table of the S-box. A lot of experiments had been done and experimental results show that one round key can be retrieved with an average of20.24 and 44.96 fault injections for GIFT-64 and GIFT-128 respectively. Further analysis shows that a certain number of fault injections recover most key bits. So we demonstrate an improved fault attack combined with the method of exhaustive search, which shows that the master key can be recovered by performing 2;and 2;computations and injecting 31 and 32 faults on an average for GIFT-64 and GIFT-128 respectively.

关键词： GIFT lightweight block cipher Differential fault attack Key recovery

New observation on the key schedule of RECTANGLE

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第3期62卷 106-118页

作者： Hailun YAN Yiyuan LUO Mo CHEN Xuejia LAI Department of Computer Science and Engineering Shanghai Jiao Tong University School of Electronics and Information Shanghai Dianji University

We evaluate the security of RECTANGLE from the perspective of actual key information(AKI).Insufficient AKI permits the attackers to deduce some subkey bits from some other subkey bits, thereby lowering the overall attack complexity or getting more attacked rounds. By considering the interaction between the key schedule’s diffusion and the round function’s diffusion, we find there exists AKI insufficiency in 4 consecutive rounds for RECTANGLE-80 and 6 consecutive rounds for RECTANGLE-128, although the master key bits achieve complete diffusion in 2 and 4 rounds, respectively. With such weakness of the key schedule, we give a generic meet-in-the-middle attack on 12-round reduced RECTANGLE-128 with only 8 known plaintexts. Moreover, we calculate AKI of variants of RECTANGLE as well as *** we find that both RECTANGLE-128 and PRESENT-128 with no key schedule involve more AKI than the original one. Based on this finding, we slightly modify the key schedule of *** with the original one, this new key schedule matches better with the round function in terms of maximizing AKI. Our work adds more insight to the design of block ciphers’ key schedule.

关键词： lightweight block cipher RECTANGLE key schedule round function diffusion

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第1期26卷 35-41页

作者： XIE Min LI Jingjing ZANG Yuechuan State Key Laboratory of Integrated Service Networks Xidian University

A related-key impossible differential attack on 24-round Lblock is constructed by using new 16-round related-key impossible differentials and adding 4rounds at the top and 4 rounds at the bottom of these 16-round related-key impossible differential paths. The data and time complexities are about 263chosen plaintexts and275.4224-round encryptions respectively.

关键词： Lblock lightweight block cipher Related-key impossible differential attack

MILP-Based Linear Attacks on Round-Reduced GIFT

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2022年第1期31卷 89-98页

作者： CUI Yaxin XU Hong QI Wenfeng Information Engineering University

GIFT is a lightweight block cipher with an substitution-per mutation-net work（SP N） structure proposed in CHES *** has two different versions whose block sizes are 64 and 128 *** RSA 2019,Zhu et *** some differential characteristics of GIFT with mixed integer linear programming（MILP） method and presented corresponding differential *** this paper,we further find some linear characteristics with MILP *** GIFT-64,we find two 11-round linear characteristics with correlation 2-29,and use one of them to present a 16-round linear attack on GIFT-64 by adding4 rounds before and one round after the linear *** GIFT-128,we find a 16-round linear characteristic with correlation *** far as we know,it is the longest linear characteristic found for *** the 16-round linear characteristic,we present a 20-round linear attack on GIFT-128 by adding 2 rounds before and2 rounds after the linear characteristic.

关键词： GIFT-128 RSA 2019 16-round linear attack substitution-permutation-network structure lightweight block cipher GIFT-64 public key cryptography 20-round linear attack CHES 2017 MILP-based linear attacks linear programming integer programming mixed integer linear programming method

Chaos-Based Cryptographic Mechanism for Smart Healthcare IoT Systems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第4期71卷 753-769页

作者： Muhammad Samiullah Waqar Aslam Arif Mehmood Muhammad Saeed Ahmad Shafiq Ahmad Adel M.Al-Shayea Muhammad Shafiq Department of Computer Science&IT The Islamia University of BahawalpurBahawalpur63100Pakistan Department of Computer Science&IT Government Sadiq College Women UniversityBahawalpurPakistan Industrial Engineering Department College of EngineeringKing Saud UniversityP.O.Box 800Riyadh11421Saudi Arabia Department of Information and Communication Engineering Yeungnam UniversityGyeongsan38541Korea

Smart and interconnected devices can generate meaningful patient data and exchange it automatically without any human intervention in order to realize the Internet of Things(IoT)in healthcare(HIoT).Due to more and more online security and data hijacking attacks,the confidentiality,integrity and availability of data are considered serious issues in HIoT *** this regard,lightweight block ciphers(LBCs)are promising in resourceconstrained environment where security is the primary *** prevalent challenge while designing an LBC for the HIoT environment is how to ascertain platform performance,cost,and *** of the existing LBCs primarily focus on text data or grayscale *** main focus of this paper is about securing color images in a cost-effective *** emphasis high confidentiality of color images captured by cameras in resource-constrained smartphones,and high confidentiality of sensitive images transmitted by low-power sensors in IoT *** order to reduce computational complexity and simulation time,the proposed lightweight Symmetric block cipher(LSBC)exploits chaos-based confusion-diffusion operations at the inter-block level using a single *** strength of LSBC is assessed by cryptanalysis,while it is ranked by comparing it to other privacy-preserving *** results show that the proposed cipher produces promising results in terms of key sensitivity and differential attacks,which proves that our LSBC is a good candidate for image security in HIoT.

关键词： IoT healthcare lightweight block cipher symmetric block cipher

Improved Differential Attack on 30-Round SIMON64

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2016年第1期21卷 75-83页

作者： WANG Gaoli GAN Nan LI Yue School of Computer Science and Technology Donghua University

In this paper we present an attack on 30-round SIMON64, which improves the best results on SIMON64 by 1 round. We use a 23-round differential characteristic which was proposed by Itai et al in 2015 to construct a 30-round extended differential characteristized by adding 4 rounds on the top and 3 round on the bottom. Furthermore, we utilize all of the sufficient bit-conditions of the 30-round differential to compute a set of corresponding subkeys. Then we distribute the plaintext pairs over the 286 lists corresponding to the 86-bit subkeys. If a list contains two or more pairs, we regard the subkeys corresponding to the list as candidate subkeys. The time complexity of our attack on 30-round SIMON64/96 （SIMON64/128） is 286.2 （21182） with a success probability of 0.61, while the data complexity and the memory complexity are 263.3 and 290 bytes, respectively.

关键词： SIMON lightweight block cipher differential attack bit condition

维普期刊数据库