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

3rd International Conference on Artificial Intelligence and Computer Information Technology, AICIT 2024

作者： Han, Ya Wang, Mingsheng Li, Yongqiang Ren, Lifeng Institute of Information Engineering CAS Key Laboratory of Cyberspace Security Defense Beijing China Chongqing Research Institute of Big Data Peking University Chongqing China

ISBN: (纸本)9798350365443

In OFB mode, the output of the cryptographic algorithm is fed back to the input of the cryptographic algorithm. The OFB mode does not directly encrypt plaintext through cryptographic algorithms, but generates ciphertext blocks by XOR combining plaintext blocks with the output of cryptographic algorithms. In OFB encryption mode, messages are treated as bitstreams, and the output of block encryption is added to the encrypted messages, making it difficult for bit errors to propagate. The SM4 algorithm is a symmetric cryptographic technique developed by the Chinese National Cryptographic Administration and standardized as part of the State encryption Standard in China. SM4 is widely adopted in various applications, including wireless communication systems and secure data transmissions. In this paper, a fast implementation method of SM4 in OFB mode is proposed. We calculate the possible parallelization operations in OFB mode using the operational relationship between the SM4 algorithm round functions, and ensure the correctness of SM4-OFB encryption through a feedback compensation method. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Radical (formula presented) Isogeny Formulae 44th

Radical (formula presented) Isogeny Formulae

引用

44th Annual International Cryptology Conference, CRYPTO 2024

作者： Decru, Thomas Université Libre de Bruxelles Bruxelles Belgium

ISBN: (纸本)9783031683879

We provide explicit radical N-isogeny formulae for all odd integers N. The formulae are compact closed-form expressions which require one Nth root computation and O(N) basic field operations. The formulae are highly efficient to compute a long chain of N-isogenies, and have the potential to be extremely beneficial for speeding up certain cryptographic protocols such as CSIDH. Unfortunately, the formulae are conjectured, but we provide ample supporting evidence which strongly suggests their correctness. For CSIDH-512, we notice an additional 35% speed-up when using radical isogenies up to N=199, compared to the work by Castryck, Decru, Houben and Vercauteren, which uses radical isogenies up to N=19 only. The addition of our radical isogenies also speeds up the computation of larger class group actions in a comparable fashion. © International Association for Cryptologic Research 2024.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Real Running Time Analysis of Multi Prime RSA Algorithm and XRSA in Securing Digital Messages

Real Running Time Analysis of Multi Prime RSA Algorithm and ...

引用

2024 International Conference on Information Technology Research and Innovation, ICITRI 2024

作者： Syanti, Nurfadhilah Budiman, Mohammad Andri Sawaluddin Universitas Sumatera Utara Faculty of Computer Science and Information Technology Medan Indonesia Universitas Sumatera Utara Faculty of Mathematics and Sciences Medan Indonesia

ISBN: (纸本)9798350376210

All digital information exchange is not free from security threats in terms of information exchange, so a technique or method is needed to make message exchange in today's all-digital era safer. Therefore, this research is expected to become a security reference solution in message exchange by applying a cryptographic algorithm using the Multi Prime RSA and XRSA algorithms which are believed to be able to secure messages with large prime numbers and also to test whether these two algorithms can secure a message. Factorization will be carried out using the Pollard p-1 algorithm. The results of this research show that the larger the prime number, the greater of modulus and greater character, the time results obtained will increase quite significant 1,3 milliseconds of bits. From this results more time will be used and in security testing the results show that it takes a long time to be able to factorize the prime number from the two algorithms. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Block Cipher algorithms Implementations in ARM Architecture 4

Performance Evaluation of Block Cipher Algorithms Implementa...

引用

4th IEEE International Conference on Electrical, Computer, and Energy Technologies, ICECET 2024

作者： Lopez Hernandez, Lissete Cabrera, Alberto Palacios Priego, Mario D. Perez De Abiega-L'eglisse, Alfonso F. Gallegos-Garcia, Gina Escuela Superior de Cómputo Instituto Politécnico Nacional Mexico City Mexico Tecnológico de Monterrey Science and Mathematics Department N.L. Monterrey Mexico Instituto Politécnico Nacional Centro de Investigación en Computación Mexico City Mexico

ISBN: (纸本)9798350395914

Since the arrival of devices connected to the Internet, cryptographic goals have become a constant challenge for cybersecurity specialists. Data transmitted between IoT devices can become sensitive depending on the application scenario, which makes it necessary to consider efficient algorithmic implementations if they are used to achieve cryptographic goals on such constrained resource devices. This article presents a performance evaluation of different implementations of block cipher algorithms in devices with ARM architecture. For this purpose, the block encryption algorithms AES, 3DES, CAST5, RC2, Blowfish, Camellia, and SM4 were considered in the 5 modes of operation for confidentiality: ECB, CBC, OFB, CFB and CTR. Our results indicate to us that the AES, Blowfish, and Camellia implementations are the fastest for encrypting and decrypting, with Camellia being the implementation that requires the least amount of memory. In contrast, 3DES and RC2 show slower implementations and higher memory consumption, which makes it possible to suggest implementations of the AES and Camellia algorithms for use in IoT ecosystems. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

An Implementation of R-Ate Pairing Based on FPGA 3

An Implementation of R-Ate Pairing Based on FPGA

引用

3rd International Conference on Big Data, Information and Computer Network, BDICN 2024

作者： Dong, Xiuze Gao, Mingze Ma, Xujian Xiao, Chaoen Zhang, Lei Beijing Electronic Science and Technology Institute Beijing100070 China

ISBN: (纸本)9798350363821

R-Ate pair is an important bilinear mapping in state secret SM9 cryptographic algorithm, and its computational efficiency is closely related to the implementation performance of SM9. This scheme uses variable-length Montgomery multiplication in the bottom-level operation, operates on the elliptic curve field using Jacobian affine coordinates, and uses Karatsuba's approach and new sparse multiplication in the extended field operation. It also reduces the number of loops by using non-Adjacent form representation and employs a subgroup-based fast exponentiation algorithm in the exponentiation process. Finally, After the synthesis of Xilinx Virtex-7 series FPGA platform, R-Ate pair calculation can be completed every 4.48ms when the main frequency is 165.8Mhz and the area is 210375LUTs. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

End to End Encrypted Messaging Application Using ORDEX 6

End to End Encrypted Messaging Application Using ORDEX

引用

6th International Conference on Electrical, Control and Instrumentation Engineering, ICECIE 2024

作者： Vishwas, M. Raghav Loknath, V. Agrawal, Vinti Mehta, Vishwa Mehul Sarasvathi, V. Computer Science and Engineering PES University Bangalore India

ISBN: (纸本)9798350380040

An end-to-end encrypted chatting application focuses on securely transmitting sensitive information. It prevents the intrusion of malicious parties with any ill intent. It is especially needed in organizations where employees exchange messages which may contain trade secrets. This paper discusses the use of OR Diffie Hellman Key Exchange (ORDEX) algorithm to transmit messages securely in chatting applications. Usually, there are multiple key exchanges and layers of security which slows down the application, to avoid this a faster key exchange algorithm is proposed which does not compromise on security. This paper proposes a key exchange algorithm which is a combination of ORDEX algorithm and Extended Triple Diffie Hellman (X3DH) [2] along with Double Ratchet [3]. Advanced encryption Standard (AES) [1] encryption is used to encrypt the messages. The proposed solution is thousand times faster than applications using Elliptic-curve Diffie-Hellman (ECDH) [4] key exchange algorithm. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Construction of Nonlinear Cryptographic Protocol based on Multiple Linear Cryptosystems 14

Construction of Nonlinear Cryptographic Protocol based on Mu...

引用

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

作者： Muliar, Ihor Anikin, Volodymyr Yatskiv, Vasyl Kulyna, Serhii Humennyy, Petro Kulyna, Halyna Khmelnytskyi National University Department of Cybersecurity Khmelnytskyi Ukraine West Ukrainian National University Department of Cybersecurity Ternopil Ukraine West Ukrainian National University Department of Specialized computer systems Ternopil Ukraine West Ukrainian National University Department of Financial Technologies and Banking Business Ternopil Ukraine

ISBN: (纸本)9798350350036

The paper describes the construction of nonlinear cryptographic protocol, based on separate linear cryptosystems. Implementation of suggested construction scheme enables encryption of data blocks with ready-made and proven cryptosystems, without making any changes to their design. The scheme of proposed protocol is presented, using the AES and Twofish cryptosystems as an example. The sequence of using cryptosystems proceeds based on pseudo-random cryptographically strong gamma deployment algorithm, which increases the nonlinearity of encryption and improves the general strong of systems. The article highlights the construction of nonlinear cryptosystems, model of the process of the nonlinear modifiers deployment, and proposes a general scheme of the structure of nonlinear cryptographic protocols using one or more different cryptosystems. Proposed scheme has great flexibility and scalability. This solution allows simple and effective improvement of existing cryptographic systems or their separate algorithms and is promising for further research. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved Secured Hash Algorithm(SHA1) Using Padding Index Method 1

An Improved Secured Hash Algorithm(SHA1) Using Padding Index...

引用

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

作者： De Guzman, Larry B Salvador, Christian Ian P. Isabela State University College of Information Communication technology Isabela San Mateo Philippines

ISBN: (纸本)9798350387728

Today, hashing algorithms are employed in many applications for security purposes. Many developments have been made in the family of hashing algorithms, especially the SHA1 algorithm. Because of flaws in the past years, several modifications have been done to mitigate the collision attack but still, the security is always subject to attack. This paper modified the SHA1 algorithm based on its weaknesses in cryptanalysis. We considered the use of the padding index method as our contribution to the algorithm without affecting the original SHA1 Algorithm. To measure the effectiveness of the padding index method we use SHA1 collider and we obtained none of the pdf files had the same hash value. The Avalanche effect has been applied based on different message sets used and exhibited 51% higher than 44.04% of the Original SHA1 Algorithm and passed to the NIST standard for Security. Overall, the padding index approach has been proven effective and provide collision resistance against cryptanalysis and Man-In-The-Middle-Attack based on the results gathered on this study. © 2024 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Group Ring-Based Provably Secure and Efficient Identity-Based Signature Scheme 1

引用

Congress on Smart Computing Technologies, CSCT 2023

作者： Kumar, Sunil Mittal, Gaurav Yadav, Arvind DRDO Near Metcalfe House New Delhi110054 India Department of Mathematics University of Delhi New Delhi110007 India Department of Mathematics Hansraj College University of Delhi New Delhi110007 India

ISBN: (数字)9789819750818

ISBN: (纸本)9789819750801

Due to the advent of polynomial time quantum algorithms to solve well-known hard mathematical problems, various secure cryptographic primitives are vulnerable against large quantum computers. However, no such quantum algorithm is available to solve hard mathematical problems in group ring. In this paper, we present a group ring-based provably secure identity-based signature scheme (IBSS). Generally, in case of random oracle model (ROM), the response of hash function may not always be random which results in the false security of any cryptographic scheme. We show that our IBSS is secure under standard model rather than ROM and its security relies on the computational Diffie–Hellman assumption in group ring, which is a hard problem even on a quantum computer. We compare our IBSS with several other renowned schemes and show that its computational complexity is low, which makes it useful for achieving authenticity in wireless sensor networks, Internet of things, etc. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Unidirectional Key Update in Updatable encryption, Revisited

arXiv

引用

arXiv 2024年

作者： Jurkiewicz, Mariusz Prabucka, Kamila Military University of Technology Warsaw Poland

In this paper we construct a new efficient updatable encryption (UE) scheme based on FrodoPKE learning with errors key encapsulation [1]. We analyse the security of the proposed scheme in the backward-leak uni-directional setting within the rand-ind-eu-cpa model. Since the underlying computationally hard problem here is LWE, the scheme is secure against both classical and quantum attacks. © 2024, CC BY-NC-ND.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：