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

IEEE Transactions on Automatic Control 2025年

作者： Liu, Bing Xie, Furan Chai, Li Wuhan University of Science and Technology Engineering Research Center of Metallurgical Automation and Measurement Technology Wuhan430081 China Zhejiang University College of Control Science and Engineering Hangzhou310027 China

In this paper, we study the privacy-preserving distributed optimization problem, aiming to prevent attackers from stealing the private information of agents. For this purpose, we propose a novel privacy-preserving algorithm based on the Advanced encryption Standard (AES), which is both secure and computationally efficient. By appropriately constructing the underlying weight matrices, our algorithm can be applied to time-varying directed networks. We show that the proposed algorithm can protect an agent's privacy if the agent has at least one honest neighbor at the initial iteration. Under the assumption that the objective function is strongly convex and Lipschitz smooth, we rigorously prove that the proposed algorithm has a linear convergence rate. Finally, the effectiveness of the proposed algorithm is demonstrated by numerical simulations of the canonical sensor fusion problem. © 2025 IEEE.

关键词： encryption algorithms

A Note on Efficient Privacy-Preserving Similarity Search for Encrypted Vectors

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhao, Dongfang University of Washington United States

Traditional approaches to vector similarity search over encrypted data rely on fully homomorphic encryption (FHE) to enable computation without decryption. However, the substantial computational overhead of FHE makes it impractical for large-scale real-time applications. This work explores a more efficient alternative: using additively homomorphic encryption (AHE) for privacy-preserving similarity search. We consider scenarios where either the query vector or the database vectors remain encrypted, a setting that frequently arises in applications such as confidential recommender systems and secure federated learning. While AHE only supports addition and scalar multiplication, we show that it is sufficient to compute inner product similarity—one of the most widely used similarity measures in vector retrieval. Compared to FHE-based solutions, our approach significantly reduces computational overhead by avoiding ciphertext-ciphertext multiplications and bootstrapping, while still preserving correctness and privacy. We present an efficient algorithm for encrypted similarity search under AHE and analyze its error growth and security implications. Our method provides a scalable and practical solution for privacy-preserving vector search in real-world machine learning applications. © 2025, CC BY-NC-ND.

关键词： encryption algorithms

Efficient algorithms for Isogeny Computation on Hyperelliptic Curves: Their Applications in Post-Quantum Cryptography

学校读者我要写书评

暂无评论

arXiv 2025年

作者： El Baraka, Mohammed Ezzouak, Siham Faculty of Sciences Dhar Al Mahraz Sidi Mohammed Ben Abdellah University Fez Morocco

We present efficient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny computations from O(g4) to O(g3) operations for genus 2 curves, achieving significant efficiency gains over traditional elliptic curve methods. Detailed pseudocode and comprehensive complexity analyses demonstrate these improvements both theoretically and empirically. Additionally, we provide a thorough security analysis, including proofs of resistance to quantum attacks such as Shor’s and Grover’s algorithms. Our findings establish hyperelliptic isogeny-based cryptography as a promising candidate for secure and efficient post-quantum cryptographic systems. © 2025, CC BY.

关键词： encryption algorithms

Lattice Based Crypto Breaks in a Superposition of Spacetimes

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Aggarwal, Divesh Agrawal, Shashwat Kumar, Rajendra National University of Singapore Singapore Indian Institute of Technology Delhi India

We explore the computational implications of a superposition of spacetimes, a phenomenon hypothesized in quantum gravity theories. This was initiated by Shmueli (2024) where the author introduced the complexity class BQPOI consisting of promise problems decidable by quantum polynomial time algorithms with access to an oracle for computing order interference. In this work, it was shown that the Graph Isomorphism problem and the Gap Closest Vector Problem (with approximation factor O(n3/2)) are in BQPOI. We extend this result by showing that the entire complexity class SZK (Statistical Zero Knowledge) is contained within BQPOI. This immediately implies that the security of numerous lattice based cryptography schemes will be compromised in a computational model based on superposition of spacetimes, since these often rely on the hardness of the Learning with Errors problem, which is in SZK. © 2025, CC BY.

关键词： encryption algorithms

Electromagnetic Side-Channel Analysis of PRESENT Lightweight Cipher

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Gunathilake, Nilupulee A. Lo, Owen Buchanan, William J. Al-Dubai, Ahmed Blockpass ID Lab Edinburgh Napier University United Kingdom

Side-channel vulnerabilities pose an increasing threat to cryptographically protected devices. Consequently, it is crucial to observe information leakages through physical parameters such as power consumption and electromagnetic (EM) radiation to reduce susceptibility during interactions with cryptographic functions. EM side-channel attacks are becoming more prevalent. PRESENT is a promising lightweight cryptographic algorithm expected to be incorporated into Internet-of-Things (IoT) devices in the future. This research investigates the EM side-channel robustness of PRESENT using a correlation attack model. This work extends our previous Correlation EM Analysis (CEMA) of PRESENT with improved results. The attack targets the Substitution box (S-box) and can retrieve 8 bytes of the 10-byte encryption key with a minimum of 256 EM waveforms. This paper presents the process of EM attack modelling, encompassing both simple and correlation attacks, followed by a critical analysis. © 2025, CC BY.

关键词： encryption algorithms

Enhanced algorithms for the Representation of integers by Binary Quadratic forms: Reduction to Subset Sum

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Mamah, Maher Department of Mathematics The Pennsylvania State University University Park United States

In this paper, we give efficient algorithms for solving the Diophantine equation f(x, y) = m for arbitrary definite binary quadratic form f, given the factorization of m. While Cornacchia’s algorithm to solve x2 + dy2 = m provides an efficient method in many cases, its running time becomes exponentially large when m is highly composite, and inherits some subtleties when generalizing to arbitrary form f. To address these issues, we show how to reduce the problem to an instance of the Subset-Sum, a weakly NP-complete problem, allowing for more efficient solutions. Leveraging this approach, we develop deterministic algorithms that adapt to different cases based on disc(f) and m. In particular, when |disc(f)| = polylog(m), we provide a polynomial-time solution that remains efficient regardless of the structure of m. For more general cases, we present an algorithm that improves upon Cornacchia’s method, achieving a quadratic speedup. Recently, the problem of representation by a form f found important applications in elliptic curves and isogeny-based cryptography, where these algorithms are central to solving norm form *** Codes 11Y16 (primary), 11Y40 (secondary) © 2025, CC BY.

关键词： encryption algorithms

Improving Algorithmic Efficiency using Cryptography

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Vaikuntanathan, Vinod Zamir, Or MIT United States Tel Aviv University

Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to improve the time complexity of solving computational problems. Specifically, we show that under standard cryptographic assumptions, we can design algorithms that are asymptotically faster than existing ones while maintaining correctness. As a concrete demonstration, we construct a distribution of trapdoored matrices with the following properties: (a) computationally bounded adversaries cannot distinguish a random matrix from one drawn from this distribution, and (b) given a secret key, we can multiply such a n × n matrix with any vector in near-linear (in n) time. We provide constructions both over finite fields and the reals. This enables a broad speedup technique: any algorithm relying on a random matrix—such as those using various notions of dimensionality reduction—can replace it with a matrix from our distribution, achieving computational speedups while preserving correctness. © 2025, CC BY-NC-ND.

关键词： encryption algorithms

encryption Methodologies Based on Floating Point algorithms 14

学校读者我要写书评

暂无评论

Encryption Methodologies Based on Floating Point Algorithms

14th International Conference on Cyber Warfare and Security (ICCWS)

作者： Govere, Weston Blackledge, Jonathan Univ Kwazulu Natal Sch Math Stat & Comp Sci Durban South Africa Univ Western Cape Dept Comp Sci Cape Town South Africa

ISBN: (纸本)9781912764112

Chaos can be thought of as a superset of pseudo random number generators employed as a part of standard encryption algorithms and is a noteworthy and fundamental consequence of nonlinear dynamics. The important estimation of disarray is the capacity to create a wide range of different pseudo random number generating algorithms. While there are, on a fundamental level, a boundless number of chaos based algorithms that can be designed, they generally depend on the utilization of floating point arithmetic and require high precision floating point computations to produce sensibly extensive cycles. These floating point schemes are computationally intensive given that the number streams they create are generally changed into bit streams. In this context, this paper audits encryption methodologies in view of floating point algorithms.

关键词： chaos encryption algorithms floating point schemes encryption methodologies

Peer-to-Peer User Identity Verification Time Optimization in IoT Blockchain Network

学校读者我要写书评

暂无评论

SENSORS 2023年第4期23卷 2106-2106页

作者： Kairaldeen, Ammar Riadh Abdullah, Nor Fadzilah Abu-Samah, Asma Nordin, Rosdiadee Univ Kebangsaan Malaysia Fac Engn & Built Environm Dept Elect Elect & Syst Engn Bangi 43600 Selangor Malaysia

Blockchain introduces challenges related to the reliability of user identity and identity management systems;this includes detecting unfalsified identities linked to IoT applications. This study focuses on optimizing user identity verification time by employing an efficient encryption algorithm for the user signature in a peer-to-peer decentralized IoT blockchain network. To achieve this, a user signature-based identity management framework is examined by using various encryption techniques and contrasting various hash functions built on top of the Modified Merkle Hash Tree (MMHT) data structure algorithm. The paper presents the execution of varying dataset sizes based on transactions between nodes to test the scalability of the proposed design for secure blockchain communication. The results show that the MMHT data structure algorithm using SHA3 and AES-128 encryption algorithm gives the lowest execution time, offering a minimum of 36% gain in time optimization compared to other algorithms. This work shows that using the AES-128 encryption algorithm with the MMHT algorithm and SHA3 hash function not only identifies malicious codes but also improves user integrity check performance in a blockchain network, while ensuring network scalability. Therefore, this study presents the performance evaluation of a blockchain network considering its distinct types, properties, components, and algorithms' taxonomy.

关键词： digital integrity user integrity P2P blockchain smart contract encryption algorithms hash functions Internet of Things (IoT) privacy protection

A study on the role of hash function in encrypting sensitive information in network security protection

学校读者我要写书评

暂无评论

Applied Mathematics and Nonlinear Sciences 2024年第1期9卷

作者： Wu, Ju Wang, Dehong Peng, Xiaoxia School of Continuing Education Jiangxi Modern Vocational and Technical College Jiangxi Nanchang330029 China

The fields of information encryption and privacy protection widely use hash functions, but the traditional hash functions still struggle to handle the increasingly complex encryption tasks of sensitive data. The study enhances the traditional hash function and develops a hash function (SHF) that is based on random and chaotic structures. The SHF random function and SHF chaotic mapping are constructed, respectively. The SHF chaotic hash encryption algorithm encrypts the database, and the choice of encryption method constructs the overall architecture for encrypting and decrypting sensitive information. Finally, we examine the performance of the SHF chaotic hash encryption algorithm from four aspects: security, information entropy, resistance to differential attacks, and encryption and decryption time. The field distribution of the ciphertext encrypted by the SHF chaotic hash algorithm for plaintext is between [-150, 150], and the distribution of the unencrypted plaintext is in the range of [-100, 100]. Compared to plaintext, the distribution of the ciphertext is more dispersed and uniform. The information entropy results of the SHF chaotic hash encryption algorithm consistently exceed 7.998, the NPCR values fall within the standard range of 99.6094%, and the UACI values essentially hover around the standard value of 33.4%, indicating its ability to effectively withstand attacks. The SHF chaotic hash encryption algorithm has an encryption time of 0.398S and a decryption time of 0.398S, making it ideal for use in wireless sensor networks. © 2024 Ju Wu et al., published by Sciendo.

关键词： encryption algorithms