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

A chaos-based lightweight encryption scheme using hash-code and cyclic rotation

PHYSICA SCRIPTA 2025年第4期100卷 045203-045203页

作者： Kaya, Yasin Gurkas-Aydin, Zeynep Akgul, Akif Istanbul Univ Cerrahpasa Dept Comp Engn Istanbul Turkiye Hitit Univ Fac Engn Dept Comp Engn TR-19030 Corum Turkiye

This study introduces a novel lightweight encryption scheme for platforms with limited resources utilizing chaotic systems. We employ a dual logistic map, utilizing the first map to determine cyclic rotation step counts for rows and columns in the confusion phase, and the second map for the XoR operation in the diffusion phase. Input parameters of the first logistic map are derived from only the secret key while the input parameters of the second logistic map are derived from the secret key and hash value of plaintext together. Since we use the hash value of the plaintext to determine the input parameter of the second logistic map, our schema is highly resistant to differential attacks. On average, it produces over %99.57 NPCR value and about %33.45 UACI value in case of one-pixel change in the plaintext. It also produces an information entropy value of over 7.9971 on average. Since we use a double logistic map, our scheme is resistant to brute force attacks via about 196 bits of key length. Firstly, we calculate the hash value of the plaintext which will be used to determine the input parameter of the second logistic map. Then we employ cyclic rotation operation for all rows and all columns utilizing the key stream generated by the first logistic map at the permutation stage. Subsequently, we performed the XoR operation to the output, utilizing the key stream of the second logistic map which is initialized with the hash value and secret key. Since we need the hash value of the plaintext in the decryption process, we need to save it in the ciphertext. So, we add a new row at the bottom of the ciphertext to make room for the hash value. We save and distribute it into the matrix by swapping operations and obtaining final ciphertext. To decrypt the ciphertext, we follow these steps in reverse order. First, we extract the hash value of the original plaintext from the ciphertext. Then, we apply XOR and cyclic rotation operations. Our test and analysis results demonstrate

关键词： nonlinear dynamics chaos encryption lightweight algorithms hash-code

来源：评论

学校读者我要写书评

暂无评论

Statistical Differential Fault Analysis of the Saturnin lightweight Cryptosystem in the Mobile Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2023年 18卷 1487-1496页

作者： Li, Wei Liu, Chun Gu, Dawu Gao, Jianning Sun, Wenqian Donghua Univ Sch Comp Sci & Technol Shanghai 201620 Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Shanghai Key Lab Scalable Comp & Syst Shanghai 200240 Peoples R China

Mobile wireless sensor networks (MWSNs) have blended into a new application scenario to create revolutionary intelligent cities and handle numerous challenges of security, adaptability, and robustness as wireless technology has advanced. Exploiting lightweight cryptosystems is considered one of the main approaches for MWSNs to achieve confidentiality, integrity, and authentication to prevent malicious cyberattacks and resource abuses. The Saturnin lightweight cryptosystem, presented at ToSC in 2020, can be applied to protect MWSNs. No literature suggests Saturnin can defend against a ciphertext-only attack, where the attackers are the most susceptible. This study proposes the novel statistical differential fault analysis (SDFA) in this attack scenario with double distinguishers of square Chi-maximum likelihood estimate and Dice-Hamming weight. Following the experiments, it recovered the 256-bit secret key using 656 faults in the fourth-to-last round of Saturnin. Compared to the classic statistical fault analysis (SFA), the novel SDFA can expand fault injections to the deeper round and decrease the faults by half with a reliability of at least 99%. It gives an essential reference for figuring out how secure lightweight cryptosystems in MWSNs are.

关键词： Ciphers Security Robot sensing systems Wireless sensor networks Cryptography Encryption Light emitting diodes Mobile wireless sensor networks lightweight algorithms side-channel analysis statistical fault analysis statistical differential fault analysis Saturnin

来源：评论

学校读者我要写书评

暂无评论

lightweight encryption for short-range wireless biometric authentication systems in Industry 4.0

引用

INTEGRATED COMPUTER-AIDED ENGINEERING 2022年第2期29卷 153-173页

作者： Bordel, Borja Alcarria, Ramon Robles, Tomas Univ Politecn Madrid Dept Informat Syst Madrid Spain Univ Politecn Madrid Dept Geospatial Engn Madrid Spain

Most recent solutions for users' authentication in Industry 4.0 scenarios are based on unique biological characteristics that are captured from users and recognized using artificial intelligence and machine learning technologies. These biometric applications tend to be computationally heavy, so to monitor users in an unobtrusive manner, sensing and processing modules are physically separated and connected through point-to-point wireless communication technologies. However, in this approach, sensors are very resource constrained, and common cryptographic techniques to protect private users' information while traveling in the radio channel cannot be implemented because their computational cost. Thus, new security solutions for those biometric authentication systems in their short-range wireless communications are needed. Therefore, in this paper, we propose a new cryptographic approach addressing this scenario. The proposed solution employs lightweight operations to create a secure symmetric encryption solution. This cipher includes a pseudo-random number generator based, also, on simple computationally low-cost operations in order to create the secret key. In order to preserve and provide good security properties, the key generation and the encryption processes are fed with a chaotic number sequence obtained through the numerical integration of a new four-order hyperchaotic dynamic. An experimental analysis and a performance evaluation are provided in the experimental section, showing the good behavior of the described solution.

关键词： Cryptography chaos numerical methods XOR Industry 4.0 wireless security privacy lightweight algorithms

来源：评论

学校读者我要写书评

暂无评论

Low-Compute Cryptography for IoT: Challenges, Solutions, and Perspectives 10

Low-Compute Cryptography for IoT: Challenges, Solutions, and...

引用

2024 International Congress on Innovation and Trends in Engineering

作者： Ladino, Ivan Gomez, Camilo Corredor, Camilo Toro, Luisa Univ Catolica Colombia Ingn Elect & Telecomunicaciones Bogota Colombia

ISBN: (纸本)9798331531737;9798331531720

The rapid proliferation of Internet of Things (IoT) devices, projected to reach 75 billion by 2025, presents unprecedented security challenges. This paper explores the critical issues in implementing robust cryptographic solutions for IoT systems, characterized by severe resource constraints, energy limitations, and unique vulnerabilities. We examine the key challenges, including the implementation of standard cryptographic algorithms on devices with as little as 32 KB flash memory and 2 KB RAM, the energy consumption of cryptographic operations in battery-powered devices, and the latency issues in time-critical applications. The paper also addresses the scalability problems of traditional public key infrastructures in the context of billions of IoT devices and the susceptibility of these devices to physical and side-channel attacks. Furthermore, we present justifications for research into low-computation cryptographic schemes tailored for IoT. This includes recent advancements in lightweight cryptographic algorithms, the potential of elliptic curve cryptography for resource-constrained environments, and emerging techniques like partial homomorphic encryption for real-time applications. The paper also discusses the exploration of blockchain technology as a decentralized alternative to traditional PKI and the ongoing efforts in standardizing post-quantum algorithms for IoT. Finally, we consider the broader implications of this research, including its economic impact, the need for global IoT security standards, and the convergence with other emerging technologies like AI and 5G. This comprehensive review underscores the critical importance of developing robust, efficient cryptographic solutions for IoT as a cornerstone of security, privacy, and economic progress in the digital era.

关键词： Internet of Things Cryptography Security Resource Constraints lightweight algorithms Post-Quantum Cryptography

来源：评论

学校读者我要写书评

暂无评论

LBC-IoT: lightweight Block Cipher for IoT Constraint Devices

引用

Computers, Materials & Continua 2021年第6期67卷 3563-3579页

作者： Rabie A.Ramadan Bassam W.Aboshosha Kusum Yadav Ibrahim M.Alseadoon Munawar J.Kashout Mohamed Elhoseny College of Computer Science and Engineering University of Ha’ilHa’il81481Saudi Arabia Department of Computer Engineering Faculty of EngineeringCairo UniversityCairo12613Egypt Department of Computer Engineering Higher Institute of EngineeringElshorouk AcademyCairoEgypt Faculty of Computers and Information Mansoura UniversityEgypt College of Computer Information Technology American University in the EmiratesUnited Arab Emirates

With the new era of the Internet of Things(IoT)technology,many devices with limited resources are *** devices are susceptible to a signicant number of new malware and other risks emerging *** of the most appropriate methods for securing those IoT applications is cryptographic algorithms,as cryptography masks information by eliminating the risk of collecting any meaningful information *** ensures that all data communications are private,accurate,authenticated,authorized,or *** conventional cryptographic algorithms have been developed specically for devices with limited resources;however,it turns out that such algorithms are not ideal for IoT restricted devices with their current ***,lightweight block ciphers are gaining popularity to meet the requirements of low-power and constrained devices.A new ultra-lightweight secret-key block-enciphering algorithm named“LBC-IoT”is proposed in this *** proposed block length is 32-bit supporting key lengths of 80-bit,and it is mainly based on the Feistel ***-efcient cryptographic features in“LBC-IoT”include the use of simple functions(shift,XOR)and small rigid substitution boxes(4-bit-S-boxes).Besides,it is immune to different types of attacks such as linear,differential,and side-channel as well as exible in terms of ***,LBC-IoT achieves reasonable performance in both hardware and software compared to other recent ***-IoT’s hardware implementation results are very promising(smallest ever area“548”GE)and competitive with today’s leading lightweight ***-IoT is also ideally suited for ultra-restricted devices such as RFID tags.

关键词： Security internet of things cryptographic algorithms block cipher lightweight algorithms

来源：评论

学校读者我要写书评

暂无评论

An Estimator for the ASIC Footprint Area of lightweight Cryptographic algorithms

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2014年第2期10卷 1216-1225页

作者： Martin, Honorio Peris-Lopez, Pedro Tapiador, Juan E. San Millan, Enrique Univ Carlos III Madrid Dept Elect Technol Leganes 28911 Spain Univ Carlos III Madrid Comp Secuirty Lab Leganes 28911 Spain

In resource-constrained devices such as RFID tags or implantable medical devices, algorithm designers need to make careful choices to ensure that their proposals are sufficiently efficient for the target platform. A common way of expressing such restrictions is in terms of an upper bound for the maximum available footprint area in gate equivalents (GE). For example, RFID tags conforming to standards EPC Class-1 Generation-2 and ISO/IEC 18000-6C can devote up to 4K GE to security functions. However, in most cases, algorithm designers are not hardware experts, nor they have any quantitative means to find out how much area their designs would occupy in a given technology. In this paper, we attempt to fill this gap by providing an estimate of the upper bound for the footprint area of any algorithm. Our approach takes into account the main components of such algorithms, namely, basic arithmetic/logic operations and additional hardware such as registers and multiplexers. We believe that our proposal can help designers in making informed decisions about what kind of algorithmic structures can be afforded for a target environment.

关键词： ASIC implementations footprint area lightweight algorithms radio frequency identification (RFID) VHDL

来源：评论

学校读者我要写书评

暂无评论

Software randomness analysis and evaluation of lightweight ciphers: the prospective for IoT security

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第14期77卷 18415-18449页

作者： Qasaimeh, Malik Al-Qassas, Raad S. Tedmori, Sara Princess Sumaya Univ Technol Dept Software Engn POB 1438 Amman 11941 Jordan Princess Sumaya Univ Technol Dept Comp Sci POB 1438 Amman 11941 Jordan

In the past few years, various lightweight cryptographic algorithms have been proposed to balance the trade-offs between the requirements of resource constrained IoT devices and the need to securely transmit and protect data. However, it is critical to analyze and evaluate these algorithms to examine their capabilities. This paper provides a thorough investigation of the randomness of ciphertext obtained from Simeck, Kasumi, DES and AES. The design of our randomness analysis is based on five metrics implemented following the guidance of the NIST statistical test suite for cryptographic applications. This analysis also provides performance and power consumption evaluations for the selected cryptographic algorithms using different platforms and measures. Results from the evaluation reveal that lightweight algorithms have competitive randomness levels, lower processing time and lower power consumption when compared to conventional algorithms.

关键词： Randomness analysis lightweight algorithms Data encryption Internet of things NIST test

来源：评论

学校读者我要写书评

暂无评论

Inducing the Lyndon Array 26th

Inducing the Lyndon Array

引用

26th International Symposium on String Processing and Information Retrieval (SPIRE)

作者： Louza, Felipe A. Mantaci, Sabrina Manzini, Giovanni Sciortino, Marinella Telles, Guilherme P. Univ Fed Uberlandia Fac Elect Engn Uberlandia MG Brazil Univ Palermo Dipartimento Matemat & Informat Palermo Italy Univ Piemonte Orientale Alessandria Italy IIT CNR Pisa Italy Univ Estadual Campinas Inst Comp Campinas Brazil

ISBN: (纸本)9783030326852;9783030326869

In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in O(n) time using sigma + O(1) words of working space, where n is the length of the text and s is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use O(n) words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not only space-efficient but also fast in practice.

关键词： Lyndon array Suffix array Induced suffix sorting lightweight algorithms

来源：评论

学校读者我要写书评

暂无评论

SCHEDA: lightweight euclidean-like heuristics for anomaly detection in periodic time series

引用

APPLIED SOFT COMPUTING 2019年 82卷 105594-000页

作者： Guigou, Fabio Collet, Pierre Parrend, Pierre IPLine Caluire Cuire France Univ Strasbourg ICube Lab Strasbourg France Complex Syst Digital Campus UNESCO Unitwin Paris France ECAM Strasbourg Europe Schiltigheim France

Detecting anomalies in time series in real time can be challenging, in particular when anomalies can manifest themselves at different time scales and need to be detected with minimal latency. The need for lightweight real-time algorithms has risen in the context of Cloud computing, where thousands of devices are monitored and deviations from normal behaviour must be detected to prevent incidents. However, this need has yet to be addressed in a way that actually scales to the size of today's network infrastructures. Typically, time series generated by human activity often exhibit daily and weekly patterns creating long-term dependencies that are difficult to process. In such cases, the euclidean distance between subsequences of the time series, or euclidean anomaly score, can be a very effective tool to achieve good detection within constrained latency;however, this computation has a quadratic complexity and a computational footprint too high for any realistic application. In this paper, we propose SCHEDA (Sampled Causal Heuristics for Euclidean Distance Approximation), a collection of three heuristics designed to approximate the euclidean anomaly score with a low computational footprint in time series with long-term dependencies. Our design goals are a low computational cost, the possibility of real-time operation and the absence of tuning parameters. We benchmark SCHEDA against ARIMA and the euclidean distance and show that in typical monitoring scenarios, it outperforms both at only a fraction of the computational cost. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Time series Anomaly detection Real time Cloud monitoring lightweight algorithms

来源：评论

学校读者我要写书评

暂无评论

An Innovative Model for the Enhancement of IoT Device Using lightweight Cryptography

An Innovative Model for the Enhancement of IoT Device Using ...

引用

Amity International Conference on Artificial Intelligence (AICAI)

作者： Thapliyal, Sourav Gupta, Himanshu Khatri, Sunil Kumar Amity Univ Amity Inst Informat Technol Noida Uttar Pradesh India

ISBN: (纸本)9781538693469

The problem statement is that at present there is no stable algorithm which provides security for resource constrained devices because classic cryptography algorithms are too heavy to be implemented. So we will provide a model about the various cryptographic algorithms in this field which can he modified to be implement on constrained devices. The advantages and disadvantages of IOT devices will be taken into consideration to develop a model. Mainly IOT devices works on three layers which are physical layer, application and commutation layer. File have discuss how IOT devices individually works on these layers and how security is compromised. So, we can build a model where minimum intervention of third party is involved i.e. hackers and we can have higher and tight privacy and security system[1].we will discuss about the different ciphers(block and stream) and junctions mash algorithms) through which we can achieve cryptographic algorithms which can he implemented on resource constrained devices. Cost, safety and productivity are the three parameters which determines the ratio for block cipher. Mostly programmers are forced to choose between these two;either cost and safety, safety and productivity, cost and productivity. The main challenge is to optimize or balance between these three factors which is extremely a difficult task to perform. In this paper we will try to build a model which will optimize these three factors and will enhance the security of IOT devices

关键词： lightweight algorithms Internet delta of delta Things (IOT) Radio delta Frequency delta Identification (RFID) Wireless Sensor delta Networksr delta (WSN)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：