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

30th International Conference on the Theory and Application of Cryptology and Information Security

作者： Cini, Valerio Wee, Hoeteck NTT Res Sunnyvale CA 94085 USA

ISBN: (纸本)9789819608935;9789819608942

We introduce new lattice-based techniques for building ABE for circuits with unbounded attribute length based on the LWE assumption, improving upon the previous constructions of Brakerski and Vaikuntanathan (CRYPTO 16) and Goyal, Koppula, and Waters (TCC 16). Our main result is a simple and more efficient unbounded ABE scheme for circuits where only the circuit depth is fixed at set-up;this is the first unbounded ABE scheme for circuits that rely only on blackbox access to cryptographic and lattice algorithms. The scheme achieves semi-adaptive security against unbounded collusions under the LWE assumption. The encryption time and ciphertext size are roughly 3x larger than the prior bounded ABE of Boneh et al. (EUROCRYPT 2014), substantially improving upon the encryption times in prior works. As a secondary contribution, we present an analogous result for unbounded inner product predicate encryption that satisfies weak attribute-hiding.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

An Algorithmic Approach to (2,2)-Isogenies in the Theta Model and Applications to Isogeny-Based Cryptography 30th

An Algorithmic Approach to (2,2)-Isogenies in the Theta Mode...

引用

30th International Conference on the Theory and Application of Cryptology and Information Security

作者： Dartois, Pierrick Maino, Luciano Pope, Giacomo Robert, Damien Univ Bordeaux CNRS UMR 5251 IMBBordeaux INP Bordeaux France INRIA IMB UMR 5251 F-33400 Talence France Univ Bristol Bristol Avon England NCC Grp Cheltenham Glos England

ISBN: (纸本)9789819608904;9789819608911

In this paper, we describe an algorithm to compute chains of (2, 2)-isogenies between products of elliptic curves in the theta model. The description of the algorithm is split into various subroutines to allow for a precise field operation count. We present a constant time implementation of our algorithm in Rust and an alternative implementation in SageMath. Our work in SageMath runs ten times faster than a comparable implementation of an isogeny chain using the Richelot correspondence. The Rust implementation runs up to forty times faster than the equivalent isogeny in SageMath and has been designed to be portable for future research in higher-dimensional isogeny-based cryptography.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Neural network-based symmetric encryption algorithm with encrypted traffic protocol identification

引用

PeerJ Computer Science 2025年 11卷 e2750-e2750页

作者： Hao, Jiakai Jin, Ming Li, Yuting Yang, Yuxin Information and Communication Branch State Grid Beijing Electric Power Company Beijing China School of Computer Science Beijing University of Technology Beijing China

Cryptography is a cornerstone of power grid security, with the symmetry and asymmetry of cryptographic algorithms directly influencing the resilience of power systems against cyberattacks. Cryptographic algorithm identification, a critical component of cryptanalysis, is pivotal to assessing algorithm security and hinges on the core characteristics of symmetric and asymmetric encryption methods. A key challenge lies in discerning subtle spatial distribution patterns within ciphertext data to infer the underlying cryptographic algorithms, which is essential for ensuring the communication security of power systems. In this study, we first introduce a plaintext guessing model (SCGM model) based on symmetric encryption algorithms, leveraging the strengths of convolutional neural networks to evaluate the plaintext guessing capabilities of four symmetric encryption algorithms. This model is assessed for its learning efficacy and practical applicability. We investigate protocol identification for encrypted traffic data, proposing a novel scheme that integrates temporal and spatial features. Special emphasis is placed on the performance of algorithms within both symmetric and asymmetric frameworks. Experimental results demonstrate the effectiveness of our proposed scheme, highlighting its potential for enhancing power grid security. © 2025 Hao et al.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：