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

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

IEEE Internet of Things Journal 2025年

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Efficient speech encryption algorithm based on three-dimensional quadratic exponential robust chaos

引用

Applied Acoustics 2025年 235卷

作者： Huang, Yibo Li, Chong Li, Zhiyong Zhang, Qiuyu College of Physics and Electronic Engineering Northwest Normal University Lanzhou730070 China School of Mechanical Medical and Process Engineering Queensland University of Technology BrisbaneQLD4000 Australia School of Computer and Communication Lanzhou University of Technology Lanzhou730050 China

The computational accuracy and parameter spacing of the existing chaos result in the gradual degradation of the chaos, which makes the sequence become periodic sequence, and the divergence rate and divergence index of the existing chaos are low. In addition, the current speech encryption algorithm has high complexity and low computational efficiency. To solve these problems, a three-dimensional quadratic exponential chaos is proposed and an efficient speech encryption algorithm is designed. To solve the problem of slow numerical divergence, the double exponential nesting structure is used and the expansion factor beta is introduced to effectively reduce the number of iterations when complete chaos is reached. In order to improve the internal complexity of chaotic sequence, the whole chaotic equation is standardized, so that the generated chaotic sequence has a wide distribution. Considering that the algorithm can be stably deployed in the hardware chip in the future, and take into account the encryption rate. In this paper, the speech encryption algorithm adopts the parallel processing of confusion and diffusion, and makes the residual processing of the generated encrypted speech to improve the scrambling effect and encryption efficiency. Simulation results show that the proposed chaos equation achieves remarkable exponential divergence rate, robustness and hardware deployability. The proposed speech encryption algorithm has high efficiency, low complexity, high noise ratio, can resist a series of attacks, and has high security. This paper presents an efficient encryption strategy for speech encryption. © 2025 Elsevier Ltd

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

An Evaluation of Hashing and Other Applied Cryptography algorithms 5th

An Evaluation of Hashing and Other Applied Cryptography Algo...

引用

5th International Conference on Data Science, Machine Learning and Applications, ICDSMLA 2023

作者： Mishra, Awakash Haripriya Sharma, Apurva Thomas, Jobin S. Maharishi School of Engineering and Technology Maharishi University of Information Technology Uttar Pradesh Lucknow India Karnataka Bengaluru India Department of Computer Science and Engineering School of Engineering and Computing Dev Bhoomi Uttarakhand University Navgaon Manduwala Dehradun India School of Computer Science and Engineering Presidency University Karnataka Bengaluru India

ISBN: (纸本)9789819780426

In the modern digital world, cryptography is critical in protecting personal statistics. Most of the cryptography algorithms used to ease data, hashing, and other implemented cryptography algorithms are extensively used. Hashing refers to transforming plaintext or every other form of statistics into unreadable ciphertext. This type of encryption is used primarily to store passwords, authentication records, and other touchy records. Other applied cryptography algorithms include symmetric encryption, uneven encryption, and key exchanges. In this paper, an assessment of hashing and different implemented cryptography algorithms is conducted. The evaluation will be conscious of each of those algorithms’ distinctive traits, strengths, weaknesses, and safety concerns. The review also appears in the scenarios wherein one-of-a-kind algorithms can be carried out. It is followed by comparing the one-of-a-kind algorithms about their overall performance, protection, and comfort. Numerous pointers are also discussed regarding the application of these algorithms. Finally, the paper concludes with a standard assessment of the multiple algorithms and their suitability in one-of-a-kind contexts. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Unclonable Commitments and Proofs 22nd

Unclonable Commitments and Proofs

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Goyal, Vipul Malavolta, Giulio Raizes, Justin NTT Research SunnyvaleCA United States Carnegie Mellon University PittsburghPA United States Bocconi University Milan Italy

ISBN: (纸本)9783031780196

Non-malleable cryptography, proposed by Dolev, Dwork, and Naor (SICOMP ’00), has numerous applications in protocol composition. In the context of proofs, it guarantees that an adversary who receives a proof cannot maul it into another valid proof. However, non-malleable cryptography (particularly in the non-interactive setting) suffers from an important limitation: An attacker can always copy the proof and resubmit it to another verifier (or even multiple verifiers). In this work, we prevent even the possibility of copying the proof as it is, by relying on quantum information. We call the resulting primitive unclonable proofs, making progress on a question posed by Aaronson. We also consider the related notion of unclonable commitments. We introduce formal definitions of these primitives that model security in various settings of interest. We also provide a near tight characterization of the conditions under which these primitives are possible, including a rough equivalence between unclonable proofs and public-key quantum money. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

The Multi-Way Path Over the Blockchain: The Development of the Security Algorithm RB-24-1 6

The Multi-Way Path Over the Blockchain: The Development of t...

引用

6th International Conference on Mobile Computing and Sustainable Informatics, ICMCSI 2025

作者： Rajaprakash, S. Bagath Basha, C. Rathish Babu, T.K.S. Karthik, S. Subapriya, V. Kavitha, S. Department of Computer Science & Engineering Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology Tamil Nadu Chennai India Department of Computer Science & Engineering Kommuri Pratap Reddy Institute of Technology Telagana Hyderabad India Department of Computer Science & Engineering SRM Institute of Science and Technology Ramapuram Tamil Nadu Chennai India Department of Computer Science & Engineering Aarupadai Veedu Institute of Technology Vinayaka Missions Research Foundation Tamil Nadu Chennai India Department of Computer Science & Engineering Sathyabama Institute of Science and Technology Tamil Nadu Chennai India

ISBN: (数字)9798331522667

ISBN: (纸本)9798331522667

In the current world, a lot of new technologies are becoming famous. The Block Chain is one of these technologies. A very high amount of safety is offered by the technology in question;it is extremely robust. Users are not privy to a great deal of information regarding Block Chain;however, Protecting the data that is sent in multiple ways is what its security features are for. The "SalSa and RBJ25 algorithms" were still being used by this person. We are going to talk about the new "security mechanism" we have named RB-24-1. This method is comprised of these four different techniques. The procedure begins with the "Latin Alphabet code" being assigned to T. This is the first step in the process. To proceed to the next step, use Equation (1) to perform four times the multiplication of the number by itself. "Exchanging the values of the cells" is what the third step does., and it is carried out with the help of encrypted data. Putting the "SalSa" algorithm into action within the matrix constitutes the fourth step throughout the process. Finally, the plain text is converted into the encrypted text format. This has been a long time coming. There is a higher level of security offered by the method that has been suggested in compare and contrast with the method that is being used at the moment. © 2025 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Faster algorithms for Isogeny Computations over Extensions of Finite Fields 4th

Faster Algorithms for Isogeny Computations over Extensions...

引用

4th International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2024

作者： Cai, Shiping Chen, Mingjie Petit, Christophe School of Mathematics Sun Yat-sen University Guangzhou China COSIC KU Leuven Leuven Belgium University of Birmingham Birmingham United Kingdom Université libre de Bruxelles Brussels Belgium

ISBN: (纸本)9783031823794

Any isogeny between two supersingular elliptic curves can be defined over Fp2, however, this does not imply that computing such isogenies can be done with field operations in Fp2. In fact, the kernel generators of such isogenies are defined over extension fields of Fp2, generically with extension degree linear to the isogeny degree. Most algorithms related to isogeny computations are only efficient when the extension degree is small. This leads to efficient algorithms used in isogeny-based cryptographic constructions, but also limits their parameter choices at the same time. In this paper, we consider three computational subroutines regarding isogenies, focusing on cases with large extension degrees: computing a basis of -torsion points, computing the kernel polynomial of an isogeny given a kernel generator, and computing the kernel generator of an isogeny given the corresponding quaternion ideal under the Deuring correspondence. We then apply our algorithms to the constructive Deuring correspondence algorithm from [EPSV23] in the case of a generic prime characteristic, achieving around 30% speedup over [EPSV23]. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards Optimally Small Smoothness Bounds for Cryptographic-Sized Smooth Twins and Their Isogeny-Based Applications 31st

Towards Optimally Small Smoothness Bounds for Cryptographic...

引用

31st International Conference on Selected Areas in Cryptography, SAC 2024

作者： Sterner, Bruno Institut Polytechnique de Paris Palaiseau France

ISBN: (纸本)9783031828515

We give a new approach for finding large smooth twins. Those twins whose sum is a prime are of interest in the parameter setup of certain isogeny-based cryptosystems such as SQIsign. The approach to find such twins is to find two polynomials in Q[x] that split into a product of small degree factors and differ by 1. Then evaluate them on a particular smooth integer. This was first explored by Costello, Meyer and Naehrig at EUROCRYPT’21 using polynomials that split completely into linear factors which were found using Diophantine number theory. The polynomials used in this work split into mostly linear factors with the exception of a few quadratic factors. Some of these linear factors are repeated and so the overall smoothness probability is either better or comparable to that of the prior polynomials. We use these polynomials to search for large smooth twins whose sum is prime. In particular, the smoothness bounds of the 384 and 512-bit twins that we find are significantly smaller than those found in EUROCRYPT’21. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm for Code Equivalence 16th

An Improved Algorithm for Code Equivalence

引用

16th International Workshop on Post-Quantum Cryptography, PQCrypto 2025

作者： Nowakowski, Julian Ruhr University Bochum Bochum Germany

ISBN: (纸本)9783031865985

We study the linear code equivalence problem (LEP) for linear [n, k]-codes over finite fields Fq. Recently, Chou, Persichetti and Santini gave an elegant algorithm that solves LEP over large finite fields (with q=Ω(n)) in time 212Hknn, where H(·) denotes the binary entropy function. However, for small finite fields, their algorithm can be significantly slower. In particular, for fields of constant size q=O(1), its runtime increases by an exponential factor in n. We present an improved version of their algorithm, which achieves the desired runtime of 212Hknn for all finite fields of size q≥7. For a wide range of parameters, this improves over the runtime of all previously known algorithms by an exponential factor. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Post-Quantum Backdoor for Kyber-KEM 31st

Post-Quantum Backdoor for Kyber-KEM

引用

31st International Conference on Selected Areas in Cryptography, SAC 2024

作者： Xia, Wenwen Wang, Geng Gu, Dawu School of Cyber Engineering Xidian University Xi’an710071 China Lab of Cryptology and Computer Security Shanghai Jiao Tong University Shanghai200240 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China

ISBN: (纸本)9783031828515

Kleptography, also known as cryptographic backdoor, poses a significant threat to cryptographic algorithms by clandestinely embedding a backdoor through the use of another cryptographic algorithm, often leveraging public-key encryption techniques. Achieving a carefully designed kleptographic attack demands reducing the detectability of the backdoor to the complexity of cryptographic hard problems. In this paper, we explore the application of kleptography to CRYSTALS-Kyber, a post-quantum algorithm standardized by NIST. Leveraging the Classic McEliece Key Encapsulation Mechanism (KEM), also a NIST round-4 candidate, we devise a backdoor for both Kyber-768 and Kyber-1024. Similar to the approach proposed by Yang et al. [AsiaCCS 2020], our backdoor manipulates only the key generation algorithm, ensuring compatibility with the key encapsulation mechanism (KEM) variant of Kyber, rather than solely the public key encryption. Moreover, we present a stronger definition of undetectability within a public-key framework, capturing the intuition that the backdoor could be hidden in both the Key Generation and encryption processes, and prove the undetectability of our backdoor under this new definition. In addition, compared with Yang et al., our backdoor has two advantages: (1) We provide post-quantum undetectability;(2) Our backdoor remains independent of the public key seed, preserving public undetectability against certain potential countermeasures. The undetectability of our backdoor hinges on reducing it to the decisional version of the syndrome decoding problem (SDP) for Goppa codes. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Univariate Attack Against the Limited-Data Instance of Ciminion 31st

A Univariate Attack Against the Limited-Data Instance of C...

引用

31st International Conference on Selected Areas in Cryptography, SAC 2024

作者： Bariant, Augustin Inria Paris France ANSSI Paris France

ISBN: (纸本)9783031828409

With the increasing interest for advanced protocols for Multi-Party Computation, Fully-Homomorphic encryption or Zero-Knowledge proofs, a need for cryptographic algorithms with new constraints has emerged. These algorithms, called Arithmetization-Oriented ciphers, seek to minimize the number of field multiplications in large finite fields F2n or Fp. Among them, Ciminion is an encryption algorithm proposed by Dobraunig et al. at Eurocrypt 2021. In this paper, we focus on the limited-data instance of Ciminion;the parameters of this instance were chosen to provide s-bit security against an attacker that has access to at most 2s/2 data. We present a new univariate modeling of Ciminion and show that the designers choice to reduce the number of rounds under this data constraint leads to full-round attacks for security levels s≥93. We also propose some slight modifications of Ciminion that would overcome this vulnerability. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：