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

6th IEEE International Conference on Civil Aviation Safety and Information Technology, ICCASIT 2024

作者： Zhang, Zhiwen Nankai University College of Cyber Science Tianjin China

ISBN: (数字)9798350389418

ISBN: (纸本)9798350389418

Compared with traditional cryptographic algorithms, neural network encryption algorithm is more aggressive, which is one of the hot issues in the field of intelligent cryptanalysis. In this paper, a simple improvement is made to the generative adversarial network encryption algorithm model established by GoogleBrain. This paper tests the encryption of files by trained and saved encryptors and decrypters. The final model reaches the point that the Bob decryptor decrypted with 100% accuracy with a probability of more than 80%, while the attacker's Eve decryptor decrypts with an accuracy of about 50% all the time, which is no different from a complete guess. Then this paper analyzes the principle that the neural network encryption algorithm can realize anti-attack. In addition, for the ciphertext encrypted by Alice encrypter, this paper conducted randomness test on the ciphertext and compared it with the ciphertext randomness encrypted by AES, 3DES and Blowfish algorithm. It was found that although the encryption algorithm model generated by adversarial network training has stronger anti-attack resistance due to the lack of replacement structure, etc. However, the randomness of its ciphertext is very poor and even shows a certain periodicity, so the future research direction of neural network encryption algorithm needs to improve the randomness of its ciphertext. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Image Cryptography using AES-256 Algorithm

Image Cryptography using AES-256 Algorithm

引用

2024 International Conference on Distributed Systems, Computer Networks and Cybersecurity, ICDSCNC 2024

作者： Chandel, Taniska Gangodkar, Ninad Gautam, Abhiraj Lohumi, Yogesh Ghazi, Mohd Rehan Goyal, Ashtha University Department of Computer Science and Engineering Dehradun India Graphic Era Hill University School of Computing Dehradun India

ISBN: (纸本)9798350375442

Due to the advancement of technology, information security and user privacy have become a critical issue resulting in the use of various encryption techniques. Especially with the increasing use of social networking, it has become necessary to secure multimedia messages and prevent data threats and data manipulation. Image Cryptography focuses on the encryption of images and securing them from unauthorized access and protect their confidentiality and integrity. In order to encrypt and decode pictures, this paper focuses on the Advanced encryption Standard Algorithm (AES) which is a symmetric encryption algorithm. Furthermore, it reflects on the efficiency of the algorithm by determining the security of the algorithm using various parameters like entropy, NPCR, MSE and Histogram analysis. For better comparison all five of AES modes are presented in this paper;Electronic Codebook (ECB), Cipher Block Chaining (CBC), Cipher Feedback (CFB), Output Feedback (OFB), and Counter (CTR). Overall, it can be concluded that AES is a secure algorithm that can be used for safe data transfer. Furthermore, through the result of the parameters used to determine the security of each mode of the AES algorithm, it can further be concluded that CTR mode of the algorithm is the most secure. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Application of Genetics algorithms in Cryptography 28

Application of Genetics Algorithms in Cryptography

引用

28th IEEE International Conference on Intelligent Engineering Systems (INES)

作者： Pekarcik, Peter Chovancova, Eva Chovanec, Martin Stancel, Martin Tech Univ Kosiciach Fak Elektrotechn Informat Katedra Pocitacov Informat Letna 9 Kosice 04200 Slovakia

ISBN: (纸本)9798350367607;9798350367591

One of the most essential subfields of modern IT is undoubtedly cybersecurity. The cybersecurity practice, also known as cryptology, combines various disciplines like computer science, computer engineering, and mathematics to create complex algorithms. In our work, we combine cryptology with the field of genetics algorithms to develop new encryption algorithms. Firstly, we introduced the fundamental theories of these two fields. It aims to teach basic knowledge of using genetic algorithms to select specific parts of encryption algorithms (chromosomes) and combine them to produce new encryption algorithms (offspring). The standard flow of the genetic algorithm is divided into the initial population's creation process, evaluation, fitness score assignments, selection, crossover, and mutation. We will take a deeper look at the process of assignments of fitness score and crossover. These processes ' new design, implementation, and testing allow us to reach the results presented.

关键词： crossover cryptography decryption decryption algorithms encryption encryption algorithms fitness score genetic algorithms initial population mutation selection

来源：评论

学校读者我要写书评

暂无评论

Deepface-based chaotic image encryption using key optimization and semi-tensor product theory

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Ding, Dawei Xie, Dong Zhang, Hongwei Yang, Zongli Liu, Chu'an Anhui university School of Electronic Information Engineering Hefei230601 China

Currently, protecting personal privacy through selective encryption of facial images has become a research hotspot. This paper aims to design a new image encryption scheme using chaotic systems, optimization algorithms, and the Semi-Tensor Product (STP) theory. Firstly, we proposed a 3D Coupled Ikeda Map with Bounded Amplitude (3D-CIMBA), which has controllable Lyapunov exponents and high-complexity. Secondly, Particle Swarm Optimization (PSO) algorithm is used to generate control keys of the chaotic system, and produce chaotic sequences. Then, DeepFace model is applied to recognize facial regions for encryption. Moreover, the face image is encrypted by performing row-column alternation cyclic shifting operation and STP diffusion. Finally, cryptographic analysis is conducted using histograms, pixel correlation, information entropy, and SSIM. The simulation results show that this scheme demonstrates robustness against differential attacks and noise attacks, which also exhibits fast encryption speed and large key space. These results show that the proposed algorithm can encrypt facial information more efficiently and securely compared to traditional algorithms. © 1991-2012 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Power efficient and area optimized advanced encryption standard-based cipher for improved cyber security

引用

Journal of Cyber Security Technology 2025年

作者： Upadhyay, Shipra Pandey, Amit Kumar Kumar, Shailendra Mishra, Shivendu Department of Electronics and Communication Engineering Ramaiah Institute of Technology Bangalore India Department of Applied Science and Humanities Rajkiya Engineering College Ambedkar Nagar Uttar Pradesh India Indian Space Research Organization Karnataka Bangalore India Department of Information Technology Rajkiya Engineering College Ambedkar Nagar Uttar Pradesh India

This paper uses reconfigurable hardware (Field-Programmable Gate Array (FPGA) board) for security implementation, which has less complexity, more flexibility, and yields more efficiency. The Data encryption Standard (DES) was the earlier security algorithm for hardware execution, but computers with computational growth can break security in seconds. The Advanced encryption Standard (AES) overcomes the disadvantages of DES by providing more excellent protection with 128, 192, and 256 keys. AES is resistant to attacks and is optimized and power-effective. The paper implements 256-bit key-based AES for 128-bit data on Kintex ultrascale and Virtex 7 FPGA boards. Simulation results show that the Kintex ultra-scale implementation has fewer lookup tables (LUTs), registers, global buffers, bonded IOBs, and flip-flop pairs than the Vertex-7 boards. Additionally, the AES algorithm on the Kintex ultra-scale has less area usage and path delay than the Vertex-7 boards. © 2025 Informa UK Limited, trading as Taylor & Francis Group.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

HERFA: A Homomorphic encryption-Based Root-Finding Algorithm

引用

IEEE Embedded Systems Letters 2024年

作者： Bencini, Christopher Mendola, Jason He, Wei Kim, Sunwoong Rochester Institute of Technology Department of Electrical and Microelectronic Engineering RochesterNY14623 United States

Edge-cloud computing architectures are exposed to significant security challenges. Although general encryption methods can mitigate some of these concerns, they require decryption to perform operations on data, exposing the data and secret keys to potential attacks. Homomorphic encryption (HE), which allows operations on encrypted data without decryption, provides an effective solution to this issue. HE-based root-finding algorithms can expand the use of HE to a wider range of real-world applications that involve solving equations. This letter presents an adaptation of the well-known Newton's method for use in the HE domain. Specifically, it employs a division-free approach to remove the division operation, which is not a basic HE operation. In addition, the proposed method is extended to handle a polynomial multiplicity greater than one for faster convergence. Compared to an alternative implementation that uses a numerical method for division, the proposed HE-based root-finding algorithm (HERFA) significantly reduces the number of sequential multiplications, which is a key factor limiting the feasibility of applications in the HE domain. This reduction allows HERFA to achieve faster execution speeds or higher accuracy. © 2009-2012 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of Chaotic Systems with Multiple Scrolls via Anti-Control Method and its encryption Application

引用

IAENG International Journal of Applied Mathematics 2024年第12期54卷 2636-2644页

作者： Wang, Shiya He, Jianbin School of Mathematics and Statistics Minnan Normal University Zhangzhou363000 China School of Mathematics and Statistics Minnan Normal University Zhangzhou363000 China

As the widespread application of multimedia communication technology, information transmission security has become increasingly important. The multi-scroll chaotic system exhibits complex dynamic behavior, and it is usually used to the design of encryption algorithm for image and video information by the sensitivity of initial values. The chaotic systems with multiple scrolls are investigated by a transformation method of nth order complex polynomial, and two examples of chaotic systems with four and six scrolls are given by the chaos anticontrol theory, respectively. Based on the chaotic system with six scrolls, a simple encryption algorithm is designed for image information by scrambling and confusing operations. A hash sequence generated from the original information is given to obtain the initial keys, and three pseudo-random sequences are designed through the operations of multiplication and modulo. Furthermore, the security analysis is discussed by key space and correlation coefficient, etc. The presented encryption method exists a large key space, and it can resist to common attacks, such as differential attack, crop attack and noise attack. The practicality and effectiveness are verified by the encryption experiments of image information in the end. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

k' -Lucas Sequence for Elliptic Curve Cryptography 1

k' -Lucas Sequence for Elliptic Curve Cryptography

引用

1st International Conference on Advances in Computer Science, Electrical, Electronics, and Communication Technologies, CE2CT 2025

作者： Abhinav Gonder, Surjeet Singh Chauhan Garg, Prachi Dubey, Sudhanshu Shekhar Chandigarh University Department of Mathematics Punjab Gharuan140413 India

ISBN: (纸本)9798331518578

The k′-Lucas sequence is a significant generalization of the classical Lucas sequence, exhibiting various intriguing properties and applications across mathematics and cryptography. The study of k′ -Lucas-like sequences on elliptic curves has gained attention recently, which offer unique structural advantages for cryptographic systems. An extension of the k′ -Lucas sequence defined on elliptic curves (EC) is presented in this study, highlighting its recursive nature and algebraic characteristics. Additionally, we suggest an encryption scheme that makes use of this sequence, leveraging the complexities inherent in 'Elliptic Curve Discrete Logarithm Problem (ECDLP)' [1]. Our findings indicate that this approach enhances security and opens new avenues for robust cryptographic protocols. © 2025 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation 22nd

Reducing the Share Size of Weighted Threshold Secret Shari...

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Farràs, Oriol Guiot, Miquel Universitat Rovira i Virgili Tarragona Spain

ISBN: (纸本)9783031780226

A secret sharing scheme is a cryptographic primitive that allows a dealer to share a secret among a set of parties, so that only authorized subsets of them can recover it. The access structure of the scheme is the family of authorized subsets. In a weighted threshold access structure, each party is assigned a weight according to its importance, and the authorized subsets are those in which the sum of their weights is at least the threshold value. For these access structures, the share size of the best known secret sharing schemes is either linear on the weights or quasipolynomial on the number of parties, which leads to long shares, in general. In certain settings, a way to circumvent this efficiency problem is to approximate the access structure by another one that admits more efficient schemes. This work is dedicated to the open problem posed by this strategy: Finding secret sharing schemes with a good tradeoff between the efficiency and the accuracy of the approximation. We present a method to approximate weighted threshold access structures by others that admit schemes with small shares. This method is based on the techniques for the approximation of the Chow parameters developed by De et al. [Journal of the ACM, 2014]. Our method provides secret sharing schemes with share size n1+o(1), where n is the number of parties, and whose access structure is close to the original one. Namely, in this approximation the condition of being authorized or not is preserved for almost all subsets of parties. In addition, we apply the recent results on computational secret sharing schemes by Applebaum et al. [STOC, 2023] to construct computational secret sharing schemes whose share size is polylogarithmic in the number of parties. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Singularization: A New Approach to Designing Block Ciphers for Resource-Constrained Devices 7th

Singularization: A New Approach to Designing Block Ciphers ...

引用

7th International Conference on Attacks and Defenses for Internet-of-Things, ADIoT 2024

作者： Macario-Rat, Gilles Plesa, Mihail-Iulian Orange Chatillon France Orange Services Bucharest Romania

ISBN: (纸本)9783031855924

Running traditional symmetric encryption algorithms, such as AES, on resource-constrained devices presents significant challenges due to the limited computational resources available. A common bottleneck in these algorithms is the number of rounds, which is typically determined through cryptanalysis efforts. In this paper, we introduce a novel framework for designing block ciphers, termed Singularization. This framework is based on a generic Feistel network with dynamically generated pseudorandom functions (PRFs). We demonstrate that Singularization may enable the design of symmetric ciphers with fewer rounds without compromising security. This is evidenced by a case study of a 6-round DES, which is vulnerable to differential cryptanalysis attacks. By redesigning DES using our framework, we mitigate this vulnerability, suggesting that it is possible to achieve almost the same level of security as a full-round DES with a reduced number of rounds. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：