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

15th International Conference on Computing Communication and Networking Technologies, ICCCNT 2024

作者： Soumya, S. Chithralekha, T. Department of Computer Science Pondicherry University Puducherry India

ISBN: (纸本)9798350370249

The rise of quantum computing poses a grave threat to current cryptographic methods. While Quantum Key Distribution (QKD) offers a potential solution, guaranteeing its security in real-world implementations remains challenging. This paper addresses the critical need for robust Quantum encryption algorithms, emphasizing the importance of standardized evaluation criteria and it explores the limitations of existing evaluation methods, highlighting their shortcomings in comprehensively assessing security against both classical and quantum attacks. Furthermore, a comprehensive framework for evaluating and standardizing Quantum encryption algorithms is proposed. This framework encompasses not only the algorithm itself but also the security of the generated key. By incorporating a broader range of attack scenarios, theoretical considerations, and key-specific criteria, this framework aims to ensure the confidentiality and integrity of communication in the quantum *** research is believed to make a significant contribution to the development of secure and standardized Quantum encryption algorithms. The goal is to safeguard critical information infrastructure against evolving threats. Existing works have placed a strong emphasis on standardizing QKD (Quantum Key Distribution). However, the evaluation of the effectiveness of quantum encryption algorithms lacks the same level of standardization. This gap serves as the motivation behind this work. ©2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of symmetric encryption algorithms for time-critical cybersecurity application

Performance analysis of symmetric encryption algorithms for ...

引用

2024 Cybersecurity Providing in Information and Telecommunication Systems II, CPITS-II 2024

作者： Kuznetsov, Oleksandr Kuznetsova, Yelyzaveta Frontoni, Emanuele Arnesano, Marco Smirnov, Oleksii Campus University 10 Via Isimbardi Novedrate22060 Italy V. N. Karazin Kharkiv National University 4 Svobody sq. Kharkiv61022 Ukraine University of Macerata 30/32 Via Crescimbeni Macerata62100 Italy Central Ukrainian National Technical University 8 University ave. Kropyvnytskyi25006 Ukraine

This study presents a comprehensive performance analysis of symmetric encryption algorithms in the context of time-critical cybersecurity applications. We evaluate a diverse set of algorithms, including established standards and emerging ciphers, across multiple performance metrics relevant to resource-constrained and latency-sensitive environments. Our methodology encompasses rigorous testing of stream encryption speed, packet encryption efficiency, and key/IV setup times on a standardized hardware platform. The results reveal significant variations in algorithm performance across different operational scenarios, highlighting the importance of context-specific algorithm selection. Notably, newer algorithms such as STRUMOK and SNOW 2.0 demonstrate impressive performance across multiple metrics, challenging the dominance of traditional standards in certain application areas. We discuss the implications of our findings for various time-critical applications, including IoT device security, real-time control systems, and secure data aggregation in smart grids. Our analysis underscores the complex trade-offs between security, performance, and resource efficiency inherent in symmetric encryption implementation. © 2024 Copyright for this paper by its authors.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Using Quantum Resistant Variants of NIST IR 8454 Lightweight encryption algorithms in Image encryption 8

Using Quantum Resistant Variants of NIST IR 8454 Lightweight...

引用

8th International Artificial Intelligence and Data Processing Symposium, IDAP 2024

作者： Kaya, Muhammed Saadetdin Iince, Kenan Ankara University Cyber Security Vocational School Ankara Turkey Inonu University Software Engineering Malatya Turkey

ISBN: (纸本)9798331531492

This work examines the potential of quantum resistant variants of NIST IR 8454 lightweight encryption algorithms in the field of image encryption. Selected algorithms from ASCON, TinyJAMBU and SPARKLE families were analyzed using various performance metrics. The research includes entropy analysis, correlation analysis, histogram analysis, NPCR and UACI tests, PSNR and SSIM tests, and calculation speed analysis. The results show that all tested algorithms meet the basic security requirements for image encryption. In particular, an increase in entropy of approximately 13 % in encrypted images, significant reduction in pixel correlations, and high sensitivity to small changes in the input image are observed. While ASCON80pq shows the fastest performance, all algorithms provide basic resistance to quantum attacks. This work reveals that quantumresistant lightweight encryption algorithms are promising for image security, especially in resource-constrained environments such as IoT. However, it is emphasized that these algorithms need to be further investigated in different image types, specific attack scenarios and real-world applications. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Automated Detection of encryption algorithms Using AI Techniques 5

Automated Detection of Encryption Algorithms Using AI Techni...

引用

5th International Conference on IoT Based Control Networks and Intelligent Systems, ICICNIS 2024

作者： Chidambaranathan, Senthilnathan Santhanaraj, M. Ajitha, E. Syed Fiaz, A.S. Suchithra, B. Kathirvel, T. Virtusa Corporation NJ United States Kongunadu College of Engineering and Technology Department of IT Tamil Nadu Trichy India St. Joseph's Institute of Technology Computer Science and Engineering India Sona College of Technology Department of Information Technology Salem India Sri Eshwar College of Engineering Department of CSE Coimbatore India

ISBN: (纸本)9798331518097

In today's digital era, cryptographic algorithms play a vital role in safeguarding sensitive information, maintaining confidentiality, and defending against cyberattacks. With the growing variety of encryption methods and modes, identifying the specific algorithm used to generate a ciphertext has become increasingly challenging. To address this, we propose a machine learning solution that automatically identifies cryptographic algorithms using the Random Forest classifier. The system processes a vast dataset called 'encrypted-data,' which contains 39 different algorithms and modes, by extracting essential features like byte frequency and entropy from the ciphertexts. These features form a 257-dimensional Feature vector used for classification. Random Forest models are trained with these data. During testing, models are loaded is used to predict the encryption algorithm for a given ciphertext. Our method offers a scalable and efficient approach to cryptographic identification, surpassing traditional techniques. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON PRIVACY DATA SECURITY PROTECTION IN SENSOR NETWORKS USING encryption algorithms

UPB Scientific Bulletin, Series C: Electrical Engineering an...

引用

UPB Scientific Bulletin, Series C: Electrical Engineering and Computer Science 2024年第3期86卷 25-34页

作者： Yao, Yunxia Peng, Renjie Mi, Wenli School of Mathematics and Information Engineering Longdong University Gansu Qingyang745000 China School of Intelligent Manufacturing Longdong University Gansu Qingyang745000 China

This paper briefly introduces wireless sensor networks (WSNs) and proposes an enhancement to a block encryption algorithm using chaotic mapping principles. The proposed encryption algorithm was tested on an established WSN platform in a simulation experiment, and a comparative analysis was conducted with two encryption algorithms, advanced encryption standard (AES) and data encryption standard (DES). The results indicated that, as the volume of encrypted data grew, the encryption time for all three algorithms exhibited an upward trend, the 0-1 balance degree of the ciphertext decreased, and the information entropy increased. Specifically, for a given size of encrypted data, the optimized encryption algorithm demonstrated the shortest encryption time, the smallest 0-1 balance degree in the ciphertext, and the highest information entropy, closely approaching the ideal value. © 2024, Politechnica University of Bucharest. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Post-quantum encryption algorithms of high-degree 3-variable polynomial congruences: BS cryptosystems and BS key generation

arXiv

引用

arXiv 2024年

作者： Daras, Nicholas J. Hellenic Military Academy Department of Mathematics and Engineering Sciences Vari Attikis16673 Greece

We will construct post-quantum encryption algorithms based on three-variable polynomial Beal-Schur congruence. After giving a proof of Beal's conjecture and citing some applications of it to selected cases where the discrete logarithm and some of its generalizations are unsolvable problems, we will investigate the formulation and validity of an appropriate version of the Beal's conjecture on finite fields of integers. In contrast to the infinite case, we will show that the corresponding Beal- Schur congruence equation xp+yq ≡ zr(modN) has non-trivial solutions into the finite field ZN, for all sufficiently large primes N that do not divide the product xyz, under certain mutual divisibility conditions of the exponents p, q and r. We will apply this result to generate the so-called BS cryptosystems, i.e., simple and secure post-quantum encryption algorithms based on the Beal-Schur congruence equation, as well as new cryptographic key generation methods, whose post-quantum algorithmic encryption security relies on having an infinite number of options for the parameters p, q, r, *** Codes 11A41, 11D41, 11D79, 68P25, 94A60 © 2024, CC BY.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Support Verifiable IoT Perception Layer Information Search and encryption algorithms

引用

International Journal of Network Security 2024年第6期26卷 1053-1062页

作者： Zhang, Lijun College of Digital Technology & Design Shanghai Sipo Polytechnic Shanghai 201399 China

With the rise of IoT technology, the usage of IoT devices and systems is steadily increasing. However, concerns over excessive overhead and data security in IoT perceptual layer communication are becoming increasingly pronounced. To tackle this issue, this study developed an enhanced data encryption algorithm rooted in Paillier and Bohen-Lynn-Shacham, with added verifiable support. Additionally, a simulation test experiment was carried out. The results of the experiment demonstrated that the designed algorithm achieved an attack success rate of 6 × 10−5 under all simulated attacks, which is considerably lower than the success rates of the other algorithms that were compared. There was no significant change in the attack success rate by the attackers on the corresponding PBDS and CHMDA systems despite an increase in the number of terminals. However, a noteworthy positive correlation was observed between the success rate of the remaining two algorithms and the number of terminals. Additionally, the PBDS algorithm developed in this study had communication overheads of 426 bits, 819 bits, and 301 bits on the terminal, service network, and base station, respectively, all of which were significantly lower than the comparative algorithms. The research results prove that the information protection capability of the IoT perception layer information search encryption algorithm designed in this research is excellent, and the computational overhead is small. These research outcomes have the potential to enhance the quality of information transfer in IoT systems. © (2024), (International Journal of Network Security). All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust pixel-level image encryption algorithm using 3D infinite collapse coupling map

引用

Multimedia Tools and Applications 2025年 1-24页

作者： Song, Okchol Pak, Chanil Jong, Cholmin Erkan, Ugur Ri, Myongsong Institute of Information Technology Kim Chaek University of Technology Sungri Street Asia Pyongyang950003 Korea People's Democratic Rep Department of Computer Engineering Karamanoglu Mehmetbey University Karaman70200 Turkey

Chaotic map, due to its excellent unpredictability and complexity, is widely used in various fields, such as information security, information communication, and system control, etc., thus research work is being intensified to improve its chaotic characteristics. In this work, based on the published literatures, we proposed a noble 3D-ICCM (3D Infinite Collapse Coupling Map) by combining three 1D infinite collapse maps, so as to improve its chaotic performance and evaluated its chaotic characteristics. As can be seen from the bifurcation characteristic diagram from experiments, the distribution is very uniform and Lyapunov exponent has an average value of 2.5 over the whole chaotic characteristic range, and the information entropy also has a value of over 7.99. In addition, it has a value of over 0.1 for all 15 test parameters of NIST (National Institute of Standards and Technology) statistical tests. This demonstrates that the proposed 3D-ICCM is completely random, and has better chaotic properties than the previous 3D maps, especially the 3D-ICM (3D Infinite Collapse Map). In addition, in order to validate applicability of the proposed 3D-ICCM to image encryption, simple-structured pixel-level image encryption algorithm with our 3D-ICCM is designed and its robustness is verified through experiments. The experimental results convinced that the proposed image encryption algorithm has a sufficient key sensitivity and super ability to resist differential, Chosen-plaintext, cropping and noise attacks. The experimental results are fully uncovered in tables and images in this paper. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

AES-AUDIO: An encryption Scheme for Audio Supporting Differentiated Decryption

引用

IEEE Transactions on Multimedia 2025年 27卷 2268-2280页

作者： Zhao, Ruoyu Zhang, Yushu Ji, Junhao Yi, Shuang Wen, Wenying Lan, Rushi Jiangxi University of Finance and Economics School of Computer and Artificial Intelligence Nanchang330013 China Jiangxi Provincial Key Laboratory of Multimedia Intelligent Processing Nanchang330013 China Southwest University of Political Science and Law Criminal Investigation School Chongqing401120 China Guilin University of Electronic Technology Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin541004 China Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software Guilin541004 China

In this paper, we propose an audio encryption scheme that supports differentiated decryption, called AES-AUDIO, in which an audio only needs to be encrypted once and can be decrypted into different resolutions as needed. First, we design four security levels, confidential, harsh, noisy, and clear, based on the audio resolution perceived by human auditory perception. Second, the audio data in decimal floating-point numbers (D-FPNs) are unfolded to 32 bits (B-FPNs). Third, we design a region of interest (RoI) encryption algorithm for the audio with the B-FPN format, where the result preserves some perceptual information as needed. Fourth, we construct the AES-AUDIO scheme based on the RoI encryption algorithm, which allows the audio to be encrypted once and then decrypted into different security levels. It supports changing parameters to alter the perception effect corresponding to the security level. Overall, it achieves a balance between the security and usability of the protected audio. User experiments verify that the audios produced by differential decryption can achieve the expected security levels. Some security tests also yielded excellent results, such as an NSCR value of 1. © 1999-2012 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Parallel Color Image encryption Algorithm Based on a 2D Logistic-Rulkov Neuron Map

引用

IEEE Internet of Things Journal 2025年第11期12卷 18115-18124页

作者： Gao, Suo Zhang, Zheyi Ho-Ching Iu, Herbert Ding, Siqi Mou, Jun Erkan, Uğur Toktas, Abdurrahim Li, Qi Wang, Chunpeng Cao, Yinghong The School of Information Science and Engineering Dalian Polytechnic University Dalian116034 China School of Electrical Electronic and Computer Engineering The University of Western Australia Perth6009 Australia School of Mathematical Sciences Dalian University of Technology Dalian116024 China Department of Computer Engineering Faculty of Engineering Karamanoglu Mehmetbey University Karaman70200 Turkey Department of Artificial Intelligence and Data Engineering Engineering Faculty Ankara University Ankara06830 Turkey Jinan250000 China

Images are widely used in social networks, necessitating efficient and secure transmission, especially in bandwidth-constrained environments. This paper aims to develop a color image encryption algorithm that enhances security while optimizing computational efficiency. A novel parallel color image encryption algorithm based on the 2D Logistic-Rulkov neuron map (2D-LRNM) is proposed. In this approach, the three channels of the color image are first separated. Cross-channel information interaction is introduced to form three new channels, which are then processed in parallel. During the encryption process of each channel, a block-wise parallel encryption mechanism is applied, ensuring simultaneous encryption of each block. This block-wise strategy effectively leverages parallel computing resources and balances the task load. To meet the demand for a large number of keystreams during encryption, the 2D-LRNM is introduced. It combines the simplicity and chaotic properties of the Logistic map with the multi-timescale dynamics and neurodynamic behaviors of the Rulkov map. By overcoming the dimensional limitations inherent in the single Logistic map, this approach extends the system to a two-dimensional framework, significantly increasing the complexity of chaotic behavior and improving its unpredictability. Experimental results demonstrate that the proposed encryption algorithm achieves high security and reduces computation time by approximately 83.3%. © 2014 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：