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

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

来源：评论

学校读者我要写书评

暂无评论

Cryptoanalysis of a tropical triad matrix semiring key exchange protocol

arXiv

引用

arXiv 2025年

作者： Sanchez, Alvaro Otero Universidad de Almería Carretera de Sacramento s/n La Cañada de San Urbano Almería04120 Spain

This article analyzes a key exchange protocol based on the triad tropical semiring, recently proposed by Jackson, J. and Perumal, R. We demonstrate that the triad tropical semiring is isomorphic to a circulant matrix over tropical numbers. Consequently, matrices in this semiring can be represented as tropical matrices. As a result, we conduct a cryptanalysis of the key exchange protocol using an algorithm introduced by Sulaiman Alhussaini, Craig Collett, and Sergĕı Sergeev to solve the double discrete logarithm problem over tropical matrices. © 2025, CC BY.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimized Homomorphic Permutation From New Permutation Decomposition Techniques

arXiv

引用

arXiv 2024年

作者： Ma, Xirong Fang, Junling Duong, Dung Hoang Jiang, Yali Ge, Chunpeng Li, Yanbin School of Software Shandong University China School of Computing and Information Technology University of Wollongong Australia China

Homomorphic permutation is fundamental to privacy-preserving computations based on batch-encoding homomorphic encryption. It underpins nearly all homomorphic matrix operation algorithms and predominantly influences their complexity. Permutation decomposition as a potential approach to optimize this critical component remains under-explored. In this paper, we enhance the efficiency of homomorphic permutations through novel decomposition techniques, advancing homomorphic encryption-based privacy-preserving computations. We start by estimating the ideal effect of decompositions on permutations, then propose an algorithm that searches depth-1 ideal decomposition solutions. This helps us ascertain the full-depth ideal decomposability of permutations used in specific secure matrix transposition and multiplication schemes, allowing them to achieve asymptotic improvement in speed and rotation key reduction. We further devise a new method for computing arbitrary homomorphic permutations, considering that permutations with weak structures are unlikely to be ideally factorized. Our design deviates from the conventional scope of decomposition. But it better approximates the ideal effect of decomposition we define than the state-of-the-art techniques, with a speed-up of up to ×2.27 under minimal rotation key requirements. Copyright © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Generalized cryptographic semi-regular sequences: A variant of Fröberg conjecture and a simple complexity estimation for Gröbner basis computation

arXiv

引用

arXiv 2024年

作者： Kudo, Momonari Yokoyama, Kazuhiro Fukuoka Institute of Technology 3-30-1 Wajiro-higashi Higashi-ku Fukuoka811-0295 Japan Rikkyo University 3-34-1 Nishi-Ikebukuro Toshima-ku Tokyo171-8501 Japan

In this paper, we study generalized cryptographic semi-regular sequences, which are expected to generic in the space of homogeneous polynomial sequences on which the coordinate rings have Krull dimension one. We provi... 详细信息

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Post-Quantum Security: Origin, Fundamentals, and Adoption

arXiv

引用

arXiv 2024年

作者： Barzen, Johanna Leymann, Frank University of Stuttgart IAAS Universitätsstr. 38 Stuttgart70569 Germany

We first describe the relation between discrete logarithms and two well-known asymmetric security schemes, RSA and Elliptic Curve Cryptography. Next, we present the foundations of lattice-based cryptography which is the basis of schemes that are considered to be safe against attacks by quantum algorithms (as well as by classical algorithms). Then we describe two such quantum-safe algorithms (Kyber and Dilithium) in more detail. Finally, we give a very brief and selective overview of a few actions currently taken by governments and industry as well as standardization in this area. The article has a pedagogical character, not presenting any new research results. Especially it strives towards being self-contained, e.g. the required mathematical foundations to understand post-quantum cryptography are provided and examples are given. Thus, a reader interested in getting a first comprehensive overview on the subject doesn’t have to consult text books or several research papers. Copyright © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Tiny Keys Hold Big Secrets: On Efficiency of Pairing-Based Cryptography in Iot

SSRN

引用

SSRN 2024年

作者： Perazzo, Pericle Vallati, Carlo Department of Information Engineering University of Pisa Italy

Pairing-Based Cryptography (PBC) is a sub-field of elliptic curve cryptography that has been used to design ingenious security protocols including Short Signatures (SS), Identity-Based encryption (IBE), and Attribute-Based encryption (ABE). These protocols have extremely promising applications in diverse scenarios, including Internet of Things (IoT), which usually involves computing devices with limited processing, memory, and energy capabilities. Many studies in the literature evaluated the performance of PBC on typical IoT devices, giving promising results, and showing that a large class of constrained devices can run PBC schemes. However, in the last years, new advancements in Number Field Seive algorithms threatened the security of PBC, so that all protocols must be re-parametrized with larger keys to maintain the same security level as before. Therefore, past literature reporting PBC performance on IoT devices must be redone because optimistic, and it is not clear whether present IoT devices will bear PBC. In this paper we evaluate the performance of some prominent PBC schemes on a very constrained device, namely the Zolertia RE-Mote platform, which is equipped with an ARM Cortex-M3 processor. From our experiments, the usage of IBE and SS schemes is still possible on IoT devices, but the security level is limited to 80 or 100 bits. Reaching greater security levels leads to higher execution times, which might not be compatible with many IoT applications. The usage of ABE is efficient only with IoT-oriented schemes, which offer good performance at the cost of a limited policy expressiveness. © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating Post-Quantum Cryptography on Embedded Systems: A Performance Analysis

arXiv

引用

arXiv 2024年

作者： Dong, Ben Wang, Qian University of California Merced United States

The National Institute of Standards and Technology (NIST) has finalized the selection of post-quantum cryptographic (PQC) algorithms for use in the era of quantum computing. Despite their integration into TLS protocol for key establishment and signature generation, there is limited study on profiling these newly standardized algorithms in resource-constrained communication systems. In this work, we integrate PQC into both TLS servers and clients built upon embedded systems. Additionally, we compare the performance overhead of PQC pairs to currently used non-PQC schemes. © 2024, CC BY-NC-SA.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Blockchain Technology: Analysis of a Secure Payment Mode for Enterprise E-Commerce Import and Export Trade

引用

International Journal of Network Security 2024年第5期26卷 861-866页

作者： Dong, Xianfeng Li, Jing Henan Mechanical & Electrical Vocational College Henan Zhengzhou451151 China

This paper briefly introduces the payment mode of e-commerce import and export trade based on blockchain. In this mode, the blockchain is utilized to store transaction information, while the Bresson, Catalano, and Pointcheval (BCP) encryption algorithm is employed to encrypt the transaction amount. Additionally, the additive homomorphism of the algorithm is utilized to aid in storing and validating the blockchain. Subsequently, simulation experiments were conducted in a laboratory. The results demonstrated that this payment mode enabled the successful uploading of normal transaction information onto the blockchain while effectively safeguarding the privacy of the transaction amount. It was observed that the receiver exhibited the highest efficiency in processing transaction information, whereas the initiator exhibited the lowest efficiency. Moreover, this mode effectively resisted violent decryption attempts by third parties. © (2024), (International Journal of Network Security). All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

The regular multivariate quadratic problem

arXiv

引用

arXiv 2025年

作者： Joux, Antoine Mora, Rocco CISPA Helmholtz Center for Information Security Germany

In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given multivariate quadratic system must also be regular, i.e. if it is split into multiple blocks of consecutive entries with the same fixed length, then each block has only one nonzero entry. We prove the NP-completeness of this variant and show similarities and differences with other computational problems used in cryptography. Then we analyze its hardness by reviewing the most common solvers for polynomial systems over finite fields, derive asymptotic formulas for the corresponding complexities and compare the different approaches. Copyright © 2025, The Authors. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Computational Secret Sharing

arXiv

引用

arXiv 2025年

作者： Aureliano, Igor L. Cohen, Alejandro D’Oliveira, Rafael G.L. Institute of Mathematics Statistics and Scientific Computing University of Campinas SP Brazil Faculty of Electrical and Computer Engineering Technion–Institute of Technology Haifa Israel School of Mathematical and Statistical Sciences Clemson University ClemsonSC United States

In (t, n)-threshold secret sharing, a secret S is distributed among n participants such that any subset of size t can recover S, while any subset of size t − 1 or fewer learns nothing about it. For information-theoretic secret sharing, it is known that the share size must be at least as large as the secret, i.e., |S|. When computational security is employed using cryptographic encryption with a secret key K, previous work has shown that the share size can be reduced to (formula presented). In this paper, we present a construction achieving a share size of (formula presented). Furthermore, we prove that, under reasonable assumptions on the encryption scheme — namely, the non-compressibility of pseudorandom encryption and the non-redundancy of the secret key — this share size is optimal. Copyright © 2025, The Authors. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：