检索结果-内蒙古大学图书馆

An efficient construction of S-box based on the fractional-order Rabinovich-Fabrikant chaotic system

INTEGRATION-THE VLSI JOURNAL 2024年 94卷

作者： Ullah, Saeed Liu, Xinge Waheed, Adil Zhang, Shuailei Cent South Univ Sch Math & Stat Changsha 410083 Hunan Peoples R China Natl Univ Modern Languages Fac Engn & Comp Sci Islamabad 44000 Pakistan Univ Educ Dept Informat Sci Div Sci & Technol Lahore 54770 Pakistan

For many block encryption algorithms, confusion properties are only related to the substitution box (S-box). The S-box is a crucial component of cryptography. The security of the whole system is affected by the Sbox. Consequently, alternative S-box designs and construction methods have been explored in various studies. In this paper, based on the chaotic Rabinovich-Fabrikant fractional order (FO) system, a new method for constructing a strong initial S-box is proposed. To comply with the objective, the numerical results of the FO chaotic Rabinovich-Fabrikant system are provided by using the four-step Runge Kutta method/Adams-Bashforth-Moulton method for a= 0.87,b= 1.1, and alpha= 0.99. A novel key-based permutation technique is also presented to enhance the functionality of the initial S-box and construct the final S-box. A comparison is made between the performance of the substitution boxes (S-boxes) proposed and that of some other existing chaotic S-box designs. It is perceived that the S-boxes obtained by our proposed methods are stronger. The results of the analysis of the initial and final S-box yield favorable statistics, which make sure of its importance in the use of secure communications. Furthermore, the proposed final S-box's effectiveness in image encryption applications is evaluated through the majority logic criterion (MLC), resulting in exceptional outcomes.

关键词： Cryptology Chaos S-box FO Rabinovich-Fabrikant system encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Možnosti postkvantové kryptografie

Možnosti postkvantové kryptografie

引用

作者： Burda, Patrik Brno University of Technology

S rychlostí jakou se vyvíjejí technologie je potenciální hrozbou vývoj kvantových počítačů, které mají ohrozit veškerou dnešní bezpečnou komunikaci a je potřeba h... 详细信息

S rychlostí jakou se vyvíjejí technologie je potenciální hrozbou vývoj kvantových počítačů, které mají ohrozit veškerou dnešní bezpečnou komunikaci a je potřeba hledat způsoby jak této hrozbě čelit. Tato práce se zabývá rozborem kryptografických schémat odolných vůči dnešním známým kvantovým útokům jako je například Shorův algoritmus. Dále práce obsahuje měření a vyhodnocení rychlosti a paměťové náročnosti. Na základě měření pak vybírá vhodné postkvantové schéma pro implementaci na čipovou kartu, na které poté tuto implementaci realizuje.

关键词： postkvantová kryptografie Raspberry Pi 3 Model B šifrovací schéma podpisové schéma New Hope NTRU NIST knihovna měření postkvantových schémat postkvantová kryptografie na IoT postquantum cryptography Raspberry Pi 3 Model B encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Softwarová podpora výuky kryptosystémů založených na problému faktorizace velkých čísel

Softwarová podpora výuky kryptosystémů založených na p...

引用

作者： Vychodil, Petr Brno University of Technology

Tato diplomová práce se zabývá softwarovou podporou výuky asymetrických šifrovacích algoritmů, založených na problematice faktorizace velkých čísel. Byl vytvořen vzoro... 详细信息

Tato diplomová práce se zabývá softwarovou podporou výuky asymetrických šifrovacích algoritmů, založených na problematice faktorizace velkých čísel. Byl vytvořen vzorový program, který umožňuje provádět operace spojené se šifrováním a dešifrováním s interaktivním ovládáním, s jehož pomocí lze jednoduchým způsobem pochopit princip šifrovací metody RSA. V kapitolách 1 a 2 je rozebrána problematika šifrovacích algoritmů všeobecně. Kapitoly 3 - 5 se již podrobně věnují problematice šifrovacího algoritmu RSA, principům získání, správy a použití šifrovacích klíčů. Kapitola 5 popisuje možnosti zvolení vhodné technologie pro vytvoření konečného softwarového produktu, která by umožňovala vhodným způsobem prezentovat vlastnosti tohoto rozšířeného šifrovacího algoritmu RSA. Konečným softwarovým produktem je java aplet, popsán v kapitole 6 a 7, který je rozdělen na teoretickou a praktickou část. Teoretická sekce prezentuje všeobecné informace o šifrovacím algoritmu RSA. V praktické části si uživatelé programu vyzkouší vlastní výpočetní úkony spojené s algoritmem RSA. Informace získané uživatelem v různých sekcích programu jsou dostačující k pochopení principu fungování tohoto algoritmu.

关键词： Šifrovací algoritmy RSA podpora výuky faktorizace čísel generování a testování prvočísel digitální podpis encryption algorithms RSA teaching support number factorization prime number generating and testing digital signature Text

来源：评论

学校读者我要写书评

暂无评论

Peer-to-Peer User Identity Verification Time Optimization in IoT Blockchain Network

引用

SENSORS 2023年第4期23卷 2106-2106页

作者： Kairaldeen, Ammar Riadh Abdullah, Nor Fadzilah Abu-Samah, Asma Nordin, Rosdiadee Univ Kebangsaan Malaysia Fac Engn & Built Environm Dept Elect Elect & Syst Engn Bangi 43600 Selangor Malaysia

Blockchain introduces challenges related to the reliability of user identity and identity management systems;this includes detecting unfalsified identities linked to IoT applications. This study focuses on optimizing user identity verification time by employing an efficient encryption algorithm for the user signature in a peer-to-peer decentralized IoT blockchain network. To achieve this, a user signature-based identity management framework is examined by using various encryption techniques and contrasting various hash functions built on top of the Modified Merkle Hash Tree (MMHT) data structure algorithm. The paper presents the execution of varying dataset sizes based on transactions between nodes to test the scalability of the proposed design for secure blockchain communication. The results show that the MMHT data structure algorithm using SHA3 and AES-128 encryption algorithm gives the lowest execution time, offering a minimum of 36% gain in time optimization compared to other algorithms. This work shows that using the AES-128 encryption algorithm with the MMHT algorithm and SHA3 hash function not only identifies malicious codes but also improves user integrity check performance in a blockchain network, while ensuring network scalability. Therefore, this study presents the performance evaluation of a blockchain network considering its distinct types, properties, components, and algorithms' taxonomy.

关键词： digital integrity user integrity P2P blockchain smart contract encryption algorithms hash functions Internet of Things (IoT) privacy protection

来源：评论

学校读者我要写书评

暂无评论

Construction of Asymmetric Cryptosystems Using Finite Non-commutative Algebraic Groups

Construction of Asymmetric Cryptosystems Using Finite Non-co...

引用

International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)

作者： Zakasovskaya, E. Glushchenko, A. Tarasov, V Far Eastern Fed Univ Vladivostok Russia

ISBN: (纸本)9781509056484

This article considers the work done to find a suitable group implementation for the creation of new cryptosystems which work is based on the use of finite non-commutative algebraic groups. In particular, some subgroup structures of matrix groups over finite fields are described, and one of the possible methods for representing of open texts as elements of the group is used. At the preliminary stage of the cryptosystem, the developed concept of generating keys is described, and recommendations are given for selecting the elements of the secret key. The structure and features of the cryptosystem under investigation are given, earlier studies and experiments that were carried out in this field are considered. To generate subgroups of the groups under study, it is proposed to use elementary transvections, in particular, long and short root unipotent elements. A classification of certain groups of the Chevalley type by types A(l)-D-l is provided. Some assumptions are made concerning the possible improvement of reliability and speed of such cryptosystems based upon the finite non-commutative algebraic groups, as well as relating to the prospects of further research in this direction and minimizing or eliminating the shortcomings of this data encryption model.

关键词： finite non-commutative algebraic groups matrix groups Chevalley groups cryptographic systems encryption algorithms information security

来源：评论

学校读者我要写书评

暂无评论

POWER-AWARE FRAMEWORK FOR ENCRYPTED COMMUNICATIONS

POWER-AWARE FRAMEWORK FOR ENCRYPTED COMMUNICATIONS

引用

20th International Danube-Adria-Association-for-Automation-and-Manufacturing Symposium

作者： Botezatu, Nicolae Stan, Andrei Panduru, Lucian

ISBN: (纸本)9783901509704

In battery powered embedded systems it is essential to minimize power consumption. If the systems have communication security necessities, the task of maximizing battery life becomes critical, because of the additional processing, required by encryption algorithms. This paper presents a power-aware framework that bridges the system 's security requirements for communication and the limited power budget. The framework is evaluated on a two node wireless communication application.

关键词： embedded systems communication systems power-aware API encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Digital-Signature Oriented Steganography Approach against Man-in-the-Middle Attack

International Journal of Interactive Mobile Technologies

引用

International Journal of Interactive Mobile Technologies 2024年第16期18卷 158-173页

作者： Mwakajwanga, Gwamaka Mwambe, Othmar Dar es salaam Tanzania United Republic of Dar es salaam Tanzania United Republic of

Nowadays, man-in-the-middle (MITM) attacks have become a large problem due to the advancement of computational power and interactive mobile technologies. Message security is a crucial concern that ought to be managed in order to help protect vital data from unauthorized people, such as MITM. Steganography is the technique of hiding secret data within an ordinary, non-secret file or message in order to avoid detection when communicating through an unsecured network. Steganography applications play a vital role in various fields that involve classified data transfer, such as healthcare, multimedia, and the military. Hence, the application of steganography in those fields attracts MITM attacks. Thus, in an attempt to address the challenge. This study proposes a hybrid approach that integrates an image steganography technique, the Advanced encryption Standard (AES) for message encryption, and EdDSA (Edward-Curve Digital Signature Algorithm) for signature verification to enhance steganography against MITM attacks. The proposed hybrid approach was tested and measured using image metrics (MSE, PSNR, and SSIM) and histogram visualization and verified through experimentation. The results have proven that the proposed hybrid approach is an enhanced security approach with low execution time, more payload size for hiding messages, and a high invisibility embedded message to MITM compared with other existing approaches. This study has potential limitations. It does not explore tamper resistance or algorithm robustness, and it was not tested on a public image dataset. © 2024 by the authors of this article.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Information Security by employing RSA Algorithm and Graph Labeling

引用

IAENG International Journal of Applied Mathematics 2024年第12期54卷 2563-2568页

作者： Vani Shree, S. Dhanalakshmi, S. Department of Mathematics SRM Institute of Science and Technology - Ramapuram Chennai600089 India Department of Mathematics Faculty of Engineering and Technology SRM Institute of Science and Technology - Ramapuram Chennai600089 India

The RSA technique provides security for every user connected across the network. The mathematical factorization problem, which demonstrates how challenging it is to find two prime numbers whose product equals a particular extremely large number, provides the foundation for this theory. In order to have a decent public key cryptosystem, it need really high integers, it can be dealt using RSA technique. In this work we have introduced a Total Edge Bimagic Mean Labeling of Graphs (TEBMML). TEBMML of a graph G is a bijection ψ: V (G) → {1, 2, 3,… |V|} such that ψ * (uv) = (Formula presented.) is either k1 or k2, a constant for any edge uv ∈ E(G). A graph is known as Total edge bimagic mean graph if it admits Total edge bimagic mean labeling. Also it is examined that Comb graph, Bistar graph, twig graph and Coconut tree graph are total edge bimagic mean graphs. Along with that information security is determined by exerting RSA algorithm with the above quoted labeling technique. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A study on the role of hash function in encrypting sensitive information in network security protection

引用

Applied Mathematics and Nonlinear Sciences 2024年第1期9卷

作者： Wu, Ju Wang, Dehong Peng, Xiaoxia School of Continuing Education Jiangxi Modern Vocational and Technical College Jiangxi Nanchang330029 China

The fields of information encryption and privacy protection widely use hash functions, but the traditional hash functions still struggle to handle the increasingly complex encryption tasks of sensitive data. The study enhances the traditional hash function and develops a hash function (SHF) that is based on random and chaotic structures. The SHF random function and SHF chaotic mapping are constructed, respectively. The SHF chaotic hash encryption algorithm encrypts the database, and the choice of encryption method constructs the overall architecture for encrypting and decrypting sensitive information. Finally, we examine the performance of the SHF chaotic hash encryption algorithm from four aspects: security, information entropy, resistance to differential attacks, and encryption and decryption time. The field distribution of the ciphertext encrypted by the SHF chaotic hash algorithm for plaintext is between [-150, 150], and the distribution of the unencrypted plaintext is in the range of [-100, 100]. Compared to plaintext, the distribution of the ciphertext is more dispersed and uniform. The information entropy results of the SHF chaotic hash encryption algorithm consistently exceed 7.998, the NPCR values fall within the standard range of 99.6094%, and the UACI values essentially hover around the standard value of 33.4%, indicating its ability to effectively withstand attacks. The SHF chaotic hash encryption algorithm has an encryption time of 0.398S and a decryption time of 0.398S, making it ideal for use in wireless sensor networks. © 2024 Ju Wu et al., published by Sciendo.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Construction of Big Data Information Security Protection System in Industrial Internet Environment

引用

Applied Mathematics and Nonlinear Sciences 2024年第1期9卷

作者： Na, Rongcui Co. Ltd. Chongqing401122 China

With the continuous development and integration of information technology and industrialization-related technologies, industrial Internet control system security attacks occur frequently, and it is more and more important to build an information security protection system. This study focuses on the research improvement from two aspects of access control and intrusion prevention and designs an industrial Internet security access control strategy based on the homomorphic encryption algorithm of the Hyper Elliptic Curve Cryptosystem (HCC) and the key splitting algorithm based on threshold. Meanwhile, the convolutional neural network, two-way gating loop unit, and multi-head attention mechanism are integrated to construct the CMAG intrusion detection model. The encryption algorithm and CMAG model are applied and analyzed. The encryption and decryption times of this paper's algorithm are both relatively smooth, with an average time consumption of about 1.93ms and 0.46ms, respectively, and significantly better than other algorithms with the increase in the number of bits. The throughput of this paper's encryption algorithm is 13.68 KB/s, which is approximately 2 times, 19 times, and 29 times higher than the throughput of GM, ElGamal, and Paillier algorithms, respectively. The other algorithms cannot match its throughput rate during decryption. The CMAG model has an accuracy of 99.14%, which is better than that of the other models, and its average checking accuracy, average recall, and average F1-Score are 0.9889, 0.9783, and 0.9834, respectively, which are 1.25%-5.16%, 4.31%-7.19%, and 3.32%, respectively, compared with that of the other three algorithms. 7.19% and 3.32%-6.76%, respectively. This paper is of great practical significance for the construction and optimization of a big data information security protection system in an industrial Internet environment. © 2024 Rongcui Na, published by Sciendo.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：