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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Smart and Secured Communication Using Applied Cryptography algorithms 5th

The Smart and Secured Communication Using Applied Cryptograp...

引用

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

作者： Agarwal, Trapty Jebakumari, S. Adlin Hemlata Ayesha, Amreen Maharishi School of Engineering & Technology Maharishi University of Information Technology Uttar Pradesh Lucknow India Department of Computer Science and Information Technology Jain University Karnataka Bangalore India Department of Computer Science & Engineering School of Engineering and Computing Dev Bhoomi Uttarakhand University Manduwala Dehradun Navgaon India School of Computer Science and Engineering Presidency University Karnataka Bengaluru India

ISBN: (纸本)9789819780426

This paper describes the implementation of a at ease communication device the usage of an implemented cryptography algorithm. The gadget is designed to provide comfy statistics and voice communique between endpoints using techniques consisting of encryption and digital signature. The applied cryptography set of rules includes primary components, the symmetric and the uneven algorithms. The symmetric algorithms, along with AES and DES, are used for statistics encryption, even as the uneven algorithms, which include RSA and DSA, are used for virtual signature. The proposed gadget additionally focuses on security of physical places to defend the important thing exchange by means of the use of physical access control measures which include biometric identification. The system additionally employs advanced safety strategies together with message authentication codes and protection protocols like SSL/TLS. The device is examined for robustness and safety using real communique experiments. The results confirm that the proposed machine is cozy and green in supplying comfortable communication among endpoints. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid Ultra-Lightweight Algorithm: Hummingbird-2 and PRESENT with a Chaotic System 2nd

Hybrid Ultra-Lightweight Algorithm: Hummingbird-2 and PRESEN...

引用

2nd International Conference on Cyber Intelligence and Information Retrieval, CIIR 2023

作者： Khanjar, Ibtihal Ali Hoomod, Haider K. Yousif, Intisar Abd Education College Mustansiriyah University Baghdad Iraq

ISBN: (纸本)9789819776023

Computing in the cloud is a burgeoning sector that requires architectures that are both lightweight and safe. In this study, we suggest a strong hybrid structure that is created by fusing existing structures of HUMMINGBIRD-2 and PRESENT. With the help of the chaotic system, we have improved and increased the complexity and provided robust architecture that generates keys HUMMINGBIRD-2 by chaos key. and using the PRESENT is also generated by chaotic keys to increase its security and complexity. The PRESENT generated by chaos key into the HUMMINGBIRD-2 algorithm in one round in R3 and K3. we proposed a new modified hybrid two lightweight encryption algorithm for robust design by an amalgam of PRESENT in hummingbird-2. This hybrid cipher design is secure against linear and differential cryptanalysis. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 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

来源：评论

学校读者我要写书评

暂无评论

Area and Power Efficient Modified Karatsuba Multiplier for Error-Free Cryptography algorithms 1

Area and Power Efficient Modified Karatsuba Multiplier for E...

引用

1st International Conference on Intelligent Systems and Computational Networks, ICISCN 2025

作者： Neelima, K. Hemalatha, Kanumuri Bhavana, Nagella Karthik, Parapu Kumar, Satrapu Sai Mohan Babu University Erstwhile Sree Vidyanikethan Engineering College Department of Ece Tirupati India Sree Vidyanikethan Engineering College Department of Ece Tirupati India

ISBN: (纸本)9798331529246

Data security and authentication are critical in cryptography, especially in elliptic curve cryptography (ECC), where usage of efficient finite field multipliers becomes essential. However, these multipliers consume significant hardware resources and impact performance. This paper investigates the Karatsuba algorithm and its variants to improve hardware efficiency on FPGA devices. While the overlap-free Karatsuba algorithm enhances performance. They introduce 20% errors due to issues in recombining intermediate results. To address this, a modified Karatsuba algorithm is proposed for error-free computation of four key outputs for 2-bit inputs. Implemented in Verilog HDL and evaluated on Artix-7 FPGA, the modified design reduces area usage by 95% and power consumption by 73.95% compared to the original Karatsuba algorithm. Although it shows a 3.22% increase in area and 11.12% in power compared to the overlap-free version, it significantly improves overall efficiency while ensuring accuracy. © 2025 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis 22nd

Bit Security: Optimal Adversaries, Equivalence Results, and...

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Micciancio, Daniele Schultz-Wu, Mark University of California San Diego United States

ISBN: (纸本)9783031780165

We investigate the notion of bit-security for decisional cryptographic properties, as originally proposed in (Micciancio & Walter, Eurocrypt 2018), and its main variants and extensions, with the goal clarifying the relation between different definitions, and facilitating their use. Specific contributions of this paper include: (1) identifying the optimal adversaries achieving the highest possible MW advantage, showing that they are deterministic and have a very simple threshold structure;(2) giving a simple proof that a competing definition proposed by (Watanabe & Yasunaga, Asiacrypt 2021) is actually equivalent to the original MW definition;and (3) developing tools for the use of the extended notion of computational-statistical bit-security introduced in (Li, Micciancio, Schultz & Sorrell, Crypto 2022), showing that it fully supports common cryptographic proof techniques like hybrid arguments and probability replacement theorems. On the technical side, our results are obtained by introducing a new notion of "fuzzy" distinguisher (which we prove equivalent to the "aborting" distinguishers of Micciancio and Walter), and a tight connection between the MW advantage and the Le Cam metric, a standard quantity used in statistics. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Key Generation Algorithm Utilizing Lattice-Based Cryptography Principles 3rd

A Novel Key Generation Algorithm Utilizing Lattice-Based Cry...

引用

3rd International Conference on Computing and Communication Networks, ICCCN 2023

作者： Arul, Rajakumar Sivaselvam, B. Choudhary, Ankush Centre for Smart Grid Technologies Vellore Institute of Technology Chennai India Department of Computer Science and Engineering IIITDM Kancheepuram Chennai India School of Computer Science and Engineering Vellore Institute of Technology Chennai India

ISBN: (纸本)9789819726707

Technology advancement is inevitable, and it has created a revolution in all the sectors creating huge opportunities. Artificial intelligence and machine learning have boosted the advancement of all the sectors making the life easier and comfortable. On the other hand, these advancements highly depend on the connectivity through which all the terminals are communicating. Thus, all the technology developments depend on the communication paradigm, particularly on the wireless medium. Securing the information and infrastructure is crucial, and it demands highly complex problems that cannot be breached with high computation machines like quantum computer. The emergence of quantum computer has made all the existing cryptographic algorithms vulnerable creating a space for advanced algorithms that are safe from quantum computer attacks. Key generation is the foundational process of any cryptographic algorithm, and in this research, we propose a novel key generation mechanism based on lattice using mathematical functions. The proposal is evaluated using theoretical assumptions, and it is found to be safe and secure. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：