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

A Novel Cryptographic Algorithm for Securing Data in Cloud Computing 3rd

A Novel Cryptographic Algorithm for Securing Data in Cloud C...

3rd International Conference on Artificial-Business Analytics, Quantum and Machine Learning: Trends, Perspectives, and Prospects, Com-IT-Con 2023

作者： Dagur, Arvind Singh, Mani Shakya, Abhay Pratap School of Computing Sciences and Engineering Galgotia’s University Greater Noida India

ISBN: (纸本)9789819725076

As increase in the technology like Internet of things and Cloud computing the demand of data security is also increasing. Because the people’s data is not safe on the cloud and the internet. So here the encryption algorithms came into existence. encryption means convert the plain text into cipher-text, It is necessary that the cipher-text must be secured and efficient so that it can also be transmit over the cloud and the internet without any leak or theft of data. It is important to provide a strong level of protection against unauthorized access. Some popular encryption techniques are available to us are AES (Advance encryption Standard), DES (Data encryption Standard), TRIPLE DES, BLOWFISH, RC5, SHA1 etc. In this research various encryption techniques are discussed and their advantage and disadvantages. In this paper, a new encryption technique is implemented on the data to make it more secure and reliable than the available encryption techniques. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Three-Input Ciphertext Multiplication for Homomorphic encryption

arXiv

引用

arXiv 2024年

作者： Akherati, Sajjad Tang, Yok Jye Zhang, Xinmiao The Ohio State University OH43210 United States

Homomorphic encryption (HE) allows computations to be directly carried out on ciphertexts and is essential to privacy-preserving computing, such as neural network inference, medical diagnosis, and financial data analysis. Only addition and 2-input multiplication are defined over ciphertexts in popular HE schemes. However, many HE applications involve non-linear functions and they need to be approximated using high-order polynomials to maintain precision. To reduce the complexity of these computations, this paper proposes 3-input ciphertext multiplication. One extra evaluation key is introduced to carry out the relinearization step of ciphertext multiplication, and new formulas are proposed to combine computations and share intermediate results. Compared to using two consecutive 2-input multiplications, computing the product of three ciphertexts utilizing the proposed scheme leads to almost a half of the latency, 29% smaller silicon area, and lower noise without scarifying the throughput. Copyright © 2024, The Authors. All rights reserved.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing Data Security of iOS Client by encryption Algorithm

Enhancing Data Security of iOS Client by Encryption Algorith...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Yuli Shen Hong Wang School of Information Engineering Wuhan University of Technology

iOS devices are steadily obtaining popularity of the majority of users because of its some unique advantages in recent *** can do many things that have been done on a desktop computer or laptop

ISBN: (纸本)9781467389808

iOS devices are steadily obtaining popularity of the majority of users because of its some unique advantages in recent *** can do many things that have been done on a desktop computer or laptop

关键词： encryption algorithms IOS Client Data Security ECC EDS Data Security encryption algorithm computer information security Error correction codes Elliptic curve cryptography EMERGENCY CONTROL CENTERS Excessive daytime sleepiness Energy Dispersive Spectrometer desktop computers Communication Research cryptography security mechanism DES gene Diethylstilbestrol

来源：评论

学校读者我要写书评

暂无评论

Mutations of Cryptographic algorithms 22

Mutations of Cryptographic Algorithms

引用

22nd International Conference on Emerging eLearning Technologies and Applications, ICETA 2024

作者： Pekarčík, Peter Chovancová, Eva Technical University of Košice Faculty of Electrical Engineering and Informatics Department of Computers and Informatics Košice Slovakia

ISBN: (纸本)9798331527716

Data security aims to achieve confidentiality, integrity, and availability of data. To reach confidentiality, different encryption algorithms are needed. The most used today are RSA, AES, and Diffie-Helman. Although these algorithms are considered secure today, as the performance of computers increases, their security is radically reduced. Concerning the increasing performance of modern computers and the effort to use encryption algorithms in devices with limited memory, new encryption algorithms are being developed. Although post-quantum encryption algorithms are considered the most promising direction in this area, some scientists are also dealing with mutations of encryption algorithms. In this article, we deal with the design of two simple encryption algorithms - Vigener's cipher and matrix encryption. Next, we test these algorithms from the point of view of time requirements. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Algebraic Attack on LCB and Improved LCB 1

Algebraic Attack on LCB and Improved LCB

引用

1st International Conference on Cyber Security and Computing, CyberComp 2024

作者： Sucipta, I Ketut Yudi Susanti, Bety Hayat Siswantyo, Sepha Politeknik Siber dan Sandi negara Cryptography Engineering Bogor Indonesia

ISBN: (纸本)9798350387728

Various lightweight block cipher algorithms have been proposed to address the security requirements of Internet of Things (loT) devices, one of which is the Light Cipher Block (LCB). Initially proposed by Roy and colleagues in 2021, LCB underwent extensive evaluation against multiple cryptographic attacks. In 2023, Chan and colleagues identified a critical vulnerability in LCB's substitution box (S-box), which increased the cipher's linearity. To mitigate this issue, they improved LCB by integrating the S-box from the PRESENT cipher. This study conducts an algebraic analysis of LCB, identifying the algebraic characteristics underlying its vulnerabilities. In addition, an algebraic attack is performed on the improved LCB to evaluate its resilience against such attacks. Our findings reveal that while the original LCB remains susceptible to algebraic attacks, the improved version exhibits enhanced resistance. These results emphasize the importance of selecting appropriate S-boxes for cryptographic algorithms to strengthen their security against algebraic attacks. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

The system of secured user’s credentials transfer

The system of secured user’s credentials transfer

引用

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

作者： Korchenko, Oleksandr Ivanchenko, Yevheniia Ivanchenko, Ihor Pedchenko, Yevhenii Petrovska, Mari State University of Information and Communication Technologies 7 Solomianska str Kyiv03110 Ukraine National Aviation University 1 Liubomyra Huzara ave. Kyiv03058 Ukraine

This paper describes a developed system of secured user credentials transfer from a user’s web browser to a web application server. This paper will describe in detail the operation of an advanced 10-level encryption algorithm for user credentials and demonstrate a High-Level Design system that represents the algorithm’s step-by-step execution. The basis of this algorithm is the verification of user data to detect illegal (malicious) activity when entering a user’s login and password. Based on the presented encryption algorithm, an experimental study of the developed user authorization web page and the processing of the entered credentials, before sending and after receiving the data processed by the web server. © 2024 Copyright for this paper by its authors.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Shor's Algorithm for Integer Factorization Using Quantum and Classical Approaches 10

Performance Analysis of Shor's Algorithm for Integer Factori...

引用

10th International Conference on Advanced Computing and Communication Systems, ICACCS 2024

作者： Thamaraimanalan, T. Singh, Bhupendra Mohankumar, M. Korada, Santosh Kumar Sri Eshwar College of Engineering Department of Ece Coimbatore India Cair Drdo Bangalore560093 India

ISBN: (纸本)9798350384369

Factoring large numbers poses a significant chal-lenge in contemporary cryptography and security practices. Shor's algorithm presents a remarkable advancement over clas- sical methods by providing exponential acceleration in factoring large numbers, presenting a possible risk to traditional cryptography methods. The algorithm relies on the Quantum Fourier Transform (QFT) and modular exponentiation principles to efficiently ascertain the period (x) of a given large number (N). Upon determining the period using classical methods, the prime factors of the large number can be easily computed. To eval- uate the algorithm's efficiency and scalability, both simulation- based experiments and theoretical analyses are conducted. The algorithm is simulated utilizing the Qiskit back end to estimate resources, including Clifford gates, T gates, T depth, Full depth, and qubits, across a range of large numbers. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

The Built on Feistel Network Architecture Block Ciphers Modification 14

The Built on Feistel Network Architecture Block Ciphers Modi...

引用

14th International Conference on Advanced Computer Information Technologies, ACIT 2024

作者： Naumenko, Serhii Rozlomii, Inna Yarmilko, Andrii Bohdan Khmelnytsky National University of Cherkasy Department of Information Technologies Cherkasy Ukraine Bohdan Khmelnytsky National University of Cherkasy Department of Automated Systems Software Cherkasy Ukraine

ISBN: (纸本)9798350350036

The article considers the method of implementing Shannon's idea of building a cryptographically stable system by repeatedly applying relatively simple cryptographic transformations. At the same time was being solved the problem of simultaneously reducing the level of statistical vulnerabilities of the original sequence typical for block ciphers and fundamentally justified by the Kerckhoffs principle. It is suggested to reduce the sensitivity of existing cryptographic algorithms to existing cryptanalysis tools by implementing a universal solution suitable for any encryption algorithm. The main property of this solution is to increase crypto resistance by increasing the length of the key and the encrypted information block. The developed algorithms use the modification technique of symmetric block ciphers built on the architecture of the Feistel network. The proposed method is characterized by simplicity and transparency of solutions. An analysis of its main characteristics concerning classical algorithms built on the architecture of the Feistel network was carried out. It has been established that the time of multi-stage encryption decreases to the time of implementing a single round of encryption. Accordingly, the decryption time reduces to the execution time of two rounds - the encryption round and the decryption round. Therefore, high indicators of the cipher's two main properties - bandwidth and reliability - are provided. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Encrypted system identification as-a-service via reliable encrypted matrix inversion 63

Encrypted system identification as-a-service via reliable en...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Adamek, Janis Binfet, Philipp Schluter, Nils Darup, Moritz Schulze Tu Dortmund University Control and Cyber-physical Systems Group Department of Mechanical Engineering Germany

ISBN: (纸本)9798350316339

Encrypted computation opens up promising avenues across a plethora of application domains, including machine learning, health-care, finance, and control. Arithmetic homomorphic encryption, in particular, is a natural fit for cloud-based computational services. However, computations are essentially limited to polynomial circuits, while comparisons, transcendental functions, and iterative algorithms are notoriously hard to realize. Against this background, the paper presents an encrypted system identification service enabled by a reliable encrypted solution to least squares problems. More precisely, we devise an iterative algorithm for matrix inversion and present reliable initializations as well as certificates for the achieved accuracy without compromising the privacy of provided I/O-data. The effectiveness of the approach is illustrated with three popular identification tasks. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast Distributed Polynomial Multiplication Algorithm for Lattice-based Cryptographic Decryption In Blockchain Systems 22

Fast Distributed Polynomial Multiplication Algorithm for Lat...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Zhao, Hongjian Tao, Yunting Kong, Fanyu Zhang, Guoyan Zhang, Hanlin Yu, Jia Shandong University School of Software Jinan China Binzhou Polytechnic College of Information Engineering Binzhou China Shandong University Shandong Sansec Information Technology Co. Ltd School of Software Jinan China Shandong University School of Cyber Science and Technology Qingdao China Qingdao University College of Computer Science and Technology Qingdao China

ISBN: (纸本)9798331509712

Lattice-based Post-Quantum Cryptography (PQC) can effectively resist the quantum threat to blockchain's underlying cryptographic algorithms. Blockchain node decryption is one of the most commonly used cryptographic computations in blockchain systems, and polynomial multiplication, a time-consuming operation for decryption, is one of the factors limiting blockchain efficiency. This paper proposes a novel distributed computing algorithm for polynomial multiplication, applicable in blockchain decryption. By splitting polynomials into lower-degree terms and delegating tasks to distributed nodes, our approach reduces computation time. A novel verification strategy based on the Karatsuba algorithm ensures result accuracy. The experimental results demonstrate that our proposed scheme improves the execution efficiency of NTT and INTT operations by approximately 47.8% and 52.4%, and reduces Kyber decryption time by up to 23.5%. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：