检索结果-南通市图书馆

The differential fault analysis on block cipher FeW

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Cybersecurity 2023年第2期6卷 62-74页

作者： Haiyan Xiao Lifang Wang Jinyong Chang School of Computer Science Northwestern Polytechnical UniversityXiAn 710055People's Republic of China Engineering University of PAP XiAn 710055People's Republic of China School of Information and Control Engineering XiAn University of Architecture and TechnologyXi'An 710055People's Republic of China State Key Laboratory of Information Security(SKLOIS) Institute of Information EngineeringChinese Academy of SciencesBeijing 100089People's Republic of China

Feather weight(FeW)cipher is a lightweight block cipher proposed by Kumar et al.in 2019,which takes 64 bits plaintext as input and produces 64 bits ciphertext.As Kumar et al.said,FeW is a software oriented design with the aim of achieving high efficiency in software based environments.It seems that FeW is immune to many cryptographic attacks,like linear,impossible differential,differential and zero correlation attacks.However,in recent work,Xie et al.reassessed the security of FeW.More precisely,they proved that under the differential fault analysis(DFA)on the encryption states,an attacker can completely recover the master secret key.In this paper,we revisit the block cipher FeW and consider the DFA on its key schedule algorithm,which is rather popular cryptanalysis for kinds of block ciphers.In particular,by respectively injected faults into the 30th and 29th round subkeys,one can recover about 55/80~69%bits of master key.Then the brute force searching remaining bits,one can obtain the full master secret key.The simulations and experiment results show that our analysis is practical.

关键词： Differential fault analysis block cipher FeW Side channel attack

Designing Pair of Nonlinear Components of a block cipher over Gaussian Integers

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第6期75卷 5287-5305页

作者： Muhammad Sajjad Tariq Shah Robinson Julian Serna Department of Mathematics Quaid-I-Azam UniversityIslamabad45320Pakistan Escuela de Matemáticas y Estadística Universidad Pedagógica y Tecnológica de ColombiaTunja150003Columbia

In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Gaussian integers(GI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.But the prime field dependent on the Elliptic curve(EC)provides one S-box at a time by fixing three parameters a,b,and p.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.

关键词： Gaussian integers residue class of gaussian integers block cipher S-boxes analysis of S-boxes

Nonlinear Components of a block cipher over Eisenstein Integers

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第12期77卷 3659-3675页

作者： Mohammad Mazyad Hazzazi Muhammad Sajjad Zaid Bassfar Tariq Shah Ashwag Albakri Department of Mathematics College of ScienceKing Khalid UniversityAbha61413Saudi Arabia Department of Mathematics Quaid-I-Azam UniversityIslamabad45320Pakistan Department of Information Technology University of TabukTabuk71491Saudi Arabia Department of Computer Science College of Computer Science&Information TechnologyJazan UniversityJazan45142Saudi Arabia

In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves,chaotic maps,and Gaussian integers has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Eisenstein integers(EI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.However,in the same way,by taking three fixed parameters only one S-box is obtained through a prime field-dependent Elliptic curve(EC),chaotic maps,and Gaussian integers.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.

关键词： Eisenstein integers residue class of Eisenstein integers block cipher S-boxes analysis of S-boxes

A block cipher Algorithm Based on Magic Square for Secure E-bank Systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第10期73卷 1329-1346页

作者： Farah Tawfiq Abdul Hussien Abdul Monem S.Rahma Hala Bahjat Abdul Wahab Computer Science Department University of TechnologyBaghdad10011Iraq

Nowadays the E-bank systems witnessed huge growth due to the huge developments in the internet and technologies.The transmitted information represents crucial information that is exposed to various kinds of attacks.This paper presents a new block cipher technique to provide security to the transmitted information between the customers and the ebank systems.The proposed algorithm consists of 10 rounds,each round involves 5 operations.The operations involve Add round key,Sub bytes,Zigzag method,convert to vector,and Magic Square of order 11.The purpose of this algorithm is to make use of the complexity of the Magic Square algorithm,the speed of addition operation,the confusion provided by the zigzag,using these operations with Galois field 28 GF(28),and repeating these operations for several rounds to build fast high secure encryption algorithm.This algorithm is designed to provide fast with high complexity and security which is suitable to encrypt the data that is transmitted over the internet.Speed,complexity,and The National Institute of Standards and Technology Framework NIST suite tests were done.The complexity of the proposed algorithm is=((256)32)r+1∗((256)89)r+1+(256)121.The proposed technique gives higher speed and security in the encryption and decryption phases,according to the results of the experiments.The degree of randomness has grown by 31.8 percent.Due to a decrease in the time of encrypting and decrypting,as well as the usage of the central processing unit(CPU),efficiency is improved.The encryption process throughput is enhanced by 13%,while the decryption process throughput is increased by 11.6 percent with the recommended approach.

关键词： block cipher magic square order 11 complexity NIST suite zigzag GF(28) MS11

Split-n-Swap: A New Modification of the Twofish block cipher Algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第1期74卷 1723-1734页

作者： Awny Sayed Maha Mahrous Enas Elgeldawi Computer Science Department Faculty of ScienceMinia UniversityMinia61519Egypt Faculty of Computing and Information Technology Information Technology DepartmentKing Abdulaziz UniversityJeddah21589Saudi Arabia Computer Science Department Faculty of Computers and InformationMinia UniversityMinia61519Egypt

Securing digital data from unauthorized access throughout its entire lifecycle has been always a critical concern.A robust data security system should protect the information assets of any organization against cybercriminal activities.The Twofish algorithm is one of the well-known symmetric key block cipher cryptographic algorithms and has been known for its rapid convergence.But when it comes to security,it is not the preferred cryptographic algorithm to use compared to other algorithms that have shown better security.Many applications and social platforms have adopted other symmetric key block cipher cryptographic algorithms such as the Advanced Encryption Standard(AES)algorithm to construct their main security wall.In this paper,a new modification for the original Twofish algorithm is proposed to strengthen its security and to take advantage of its fast convergence.The new algorithm has been named Split-n-Swap(SnS).Performance analysis of the new modification algorithm has been performed using different measurement metrics.The experimental results show that the complexity of the SnS algorithm exceeds that of the original Twofish algorithm while maintaining reasonable values for encryption and decryption times as well as memory utilization.A detailed analysis is given with the strength and limitation aspects of the proposed algorithm.

关键词： Twofish advanced encryption standard(AES) cryptography symmetric key block cipher

Improved RC6 block cipher Based on Data Dependent Rotations

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第1期70卷 1921-1934页

作者： Osama S.Faragallah Ibrahim F.Elashry Ahmed AlGhamdi Walid El-Shafai S.El-Rabaie Fathi E.Abd El-Samie Hala S.El-sayed Mohamed A.Elaskily Department of Information Technology College of Computers and Information TechnologyTaif UniversityP.O.Box 11099Taif21944Saudi Arabia Department of Electrical Communications Faculty of EngineeringKafrelsheikh UniversityKafrelsheikhEgypt Department of Computer Engineering College of Computers and Information TechnologyTaif UniversityP.O.Box 11099Taif21944Saudi Arabia Department of Electronics and Electrical Communications Faculty of Electronic EngineeringMenoufia UniversityMenouf32952Egypt Department of Electrical Engineering Faculty of EngineeringMenoufia UniversityShebin El-Kom32511Egypt Department of Informatics Electronic Research Institute(ERI)CairoEgypt

This paper introduces an Improved RC6(IRC6)cipher for data encryption based on data-dependent rotations.The proposed scheme is designed with the potential of meeting the needs of the Advanced Encryption Standard(AES).Four parameters are used to characterize the proposed scheme.These parameters are the size of the word(w)in bits,the number of rounds(r),the length of the secret key(b)in bytes,and the size of the block(L)in bits.The main feature of IRC6 is the variable number of working registers instead of just four registers as in RC6,resulting in a variable block size for plaintext and ciphertext.The IRC6 cipher is designed to improve the robustness against attacks by increasing the diffusion for each round and providing greater security with fewer rounds.The effectiveness of the proposed IRC6 scheme is verified against theoretical attacks.The proposed IRC6 scheme depends on full diffusion and confusion mechanisms regardless of the utilized block size.The proposed IRC6 scheme saves 70%of the encryption time and 64%of the decryption time of RC6.The simulation results prove that the IRC6 achieves a better encryption/decryption time compared to the traditionalRC6.Therefore,the proposed IRC6 is anticipated to fulfill the market needs and system security requirements.

关键词： Cryptography block cipher RC6,IRC6,AES

Cryptanalysis of Full-Round Magpie block cipher

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2023年第2期32卷 217-224页

作者： YANG Yunxiao SUN Bing LIU Guoqiang College of Liberal Arts and Sciences National University of Defense Technology State Key Laboratory of Cryptology Hunan Engineering Research Center of Commercial Cryptography Theory and Technology Innovation State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Science

Magpie is a lightweight block cipher proposed by Li et al. in Acta Electronica Sinica volumn 45,issue 10. It adopts an substitution-permutation network(SPN) structure with a block size of 64 bits and the key size of 96 bits, respectively. To achieve the consistency of the encryption and decryption, which is both hardware and software friendly, 16 bits of the key are used as control signals to select S-boxes and another 16 bits of the key are used to determine the order of the operations. As the designers claimed, the security might be improved as different keys generate different ciphers. This paper analyzes the security of Magpie, studies the difference propagation of Magpie, and finally finds that the cipher has a set of 280weak keys which makes the full-round encryption weak, and corrects the lower bound of the number of active S-boxes to 10 instead of 25 proposed by the designers. In the weak key model, the security of the cipher is reduced by the claimed 280to only 4×216.

关键词： block cipher Differential cryptanalysis Weak key Active S-boxes Magpie

Continuously non-malleable codes from block ciphers in split-state model

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Cybersecurity 2024年第2期7卷 68-80页

作者： Anit Kumar Ghosal Dipanwita Roychowdhury Department of Computer Science and Engineering I KharagpurKharagpurWest BengalIndia

Non-malleable code is an encoding scheme that is useful in situations where traditional error correction or detection is impossible to achieve.It ensures with high probability that decoded message is either completely unrelated or the original one,when tampering has no effect.Usually,standard version of non-malleable codes provide security against one time tampering attack.block ciphers are successfully employed in the construction of non-malleable codes.Such construction fails to provide security when an adversary tampers the codeword more than once.Continuously non-malleable codes further allow an attacker to tamper the message for polynomial number of times.In this work,we propose continuous version of non-malleable codes from block ciphers in split-state model.Our construction provides security against polynomial number of tampering attacks and it preserves non-malleability.When the tam-pering experiment triggers self-destruct,the security of continuously non-malleable code reduces to security of the underlying leakage resilient storage.

关键词： block cipher Non-malleable code Split-state model Tamper-resilient cryptography

An Innovative Technique for Constructing Highly Non-Linear Components of block cipher for Data Security against Cyber Attacks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2023年第11期47卷 2547-2562页

作者： Abid Mahboob Muhammad Asif Rana Muhammad Zulqarnain Imran Siddique Hijaz Ahmad Sameh Askar Giovanni Pau Department of Mathematics Division of Science and TechnologyUniversity of EducationLahorePakistan Department of Mathematics University of Management and TechnologySialkot CampusSialkot51310Pakistan School of Mathematical Sciences Zhejiang Normal UniversityJinhua321004China Department of Mathematics University of Management and TechnologyLahorePakistan Section of Mathematics International Telematic University UninettunoCorso Vittorio Emanuele II39Roma00186Italy Department of Statistics and Operations Research College of ScienceKing Saud UniversityP.O.Box 2455Riyadh11451Saudi Arabia Faculty of Engineering and Architecturer-Kore University of Enna Enna94100Italy

The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptosystems use substitution-boxes.Nowadays,data privacy has become a key concern for consumers who transfer sensitive data from one place to another.To address these problems,many companies rely on cryptographic techniques to secure data from illegal activities and assaults.Among these cryptographic approaches,AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box(S-box).The S-box disguises the relationship between cipher text and the key to guard against cipher attacks.The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box.Therefore,various researchers have employed different techniques to construct high order non-linear S-box.This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256.The motivation for this work is to study the symmetric group and coset graphs.The authors have performed various analyses against conventional security criteria such as nonlinearity,differential uniformity,linear probability,the bit independence criterion,and the strict avalanche criterion to determine its high cryptographic strength.To evaluate its image application performance,the proposed S-box is also used to encrypt digital images.The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks.

关键词： block cipher coset graphs s-box triangular group