Key Generation Algorithm Research Articles

HAETAE on ARMv8

In this work, we present the highly optimized implementation of the HAETAE algorithm, submitted to the second round of the Korean Post-Quantum Cryptography (KpqC) competition and to the first round of NIST’s additional post-quantum standardization for digital signatures on 64-bit ARMv8 embedded processors. To the best of our knowledge, this is the first optimized implementation of the HAETAE algorithm on 64-bit ARMv8 embedded processors. We apply various optimization techniques to enhance the multiplication operations in the HAETAE algorithm. We utilize parallel operation techniques involving vector registers and NEON (Advanced SIMD technology used in ARM processors) instructions of ARMv8 embedded processors. In particular, we achieved the best performance of the HAETAE algorithm on ARMv8 embedded processors by applying all the state-of-the-art NTT (Number Theoretic Transform) implementation techniques. Performance improvements of up to 3.07×, 3.63×, and 9.15× were confirmed for NTT, Inverse-NTT, and pointwise Montgomery operations (Montgomery multiplication used in modular arithmetic), respectively, by applying the state-of-the-art implementation techniques, including the proposed techniques. As a result, we achieved a maximum performance improvement of up to 1.16× for the key generation algorithm, up to 1.14× for the signature algorithm, and up to 1.25× for the verification algorithm.

PalmSecMatch: A data-centric template protection method for palmprint recognition

While existing palmprint recognition researches aim to improve accuracy in various situations, they often overlook the security implications. This paper delves into template protection in palmprint recognition. The existing template protection methods usually cannot strike a well balance between security, accuracy and usability, which reduces the applicability of the algorithms. In this work, a data-centric approach for palmprint template protection is proposed, called PalmSecMatch. Our solution extracts the key from plaintext data. It extremely reduces the dependency on third-party or independent key generation algorithms. The backbone of PalmSecMatch consists of key data extraction and encryption, order shuffling of the raw vectors, hashing code generation, shuffling basis and hashing code fading. PalmSecMatch subtly exploits the fact that biometric data are random variables and benefits from its data-centric nature. PalmSecMatch allows the same plaintext features to be encrypted into highly different ciphertexts, which greatly ensures security. At the same time, the application of data fading strategy makes it extremely difficult for an attacker to distinguish the user data from the auxiliary data. The security analysis shows that PalmSecMatch satisfies the requirements of ISO/IEC 24745. Adequate experiments on two public palmprint databases validate the effectiveness of the proposed method.

Software implementation of systematic polar encoding based PKC-SPE cryptosystem for quantum cybersecurity

The ever-growing threats in cybersecurity growing with the rapid development of quantum computing, necessitates the development of robust and quantum-resistant cryptographic systems. This paper introduces a novel cryptosystem, Public Key Cryptosystem based on Systematic Polar Encoding (PKC-SPE), based on the combination of systematic polar encoding and public-key cryptographic principles. The Systematic Polar Encoding (SPE), derived from the well-established field of polar codes, serves as the foundation for this proposed cryptographic scheme. Here, we have used MATLAB Software to introduce and implement the PKC-SPE Cryptosystem. The paper examines key generation, encryption, and decryption algorithms, providing insights into the adaptability and efficiency of systematic polar encoding in public-key cryptography. We assess the efficiency of the PKC-SPE Cryptosystem in three aspects: key size, computational complexity, and system implementation timings. In addition, we compare the PKC-SPE Cryptosystem with PKC-PC cryptosystem and find that it has reduced key sizes (Pr\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$P_{r}$$\\end{document} = 0.8436 kbytes). The results obtained through simulations validate the effectiveness of the proposed cryptosystem and highlighting its potential for integration into real-world communication systems. Thus, in the paradigm shift to quantum computing, the PKC-SPE cryptosystem emerges as a promising candidate to secure digital communication in the quantum computing era.

Improving Security on Election Results Data Transmission via Cloud Using Hybrid Homomorphic Encryption

Elections in recent years have become topical issues and characterized by violence and conflicts leading to loss of lives and properties. The integrity and confidentiality of the declared collated results have been questioned by individuals and organisations with keen interest in the outcomes of every election. Different countries have adopted different Election Results Management Systems (RMS) to help present a credible, fair and transparent election results. These systems adopted are not without criticisms and suspicions. This research paper has presented various factors that need to be considered when selecting a Results Management System (RMS) for elections. A cloud-based using a Hybrid homomorphic encryption approach is proposed in managing the election results data security and transmission. The proposed scheme has demonstrated effectiveness in handling data integrity, data confidentiality, data privacy and access control. The proposed scheme presented has enhanced the security of election results data against Chosen Ciphetext Attacks (CCA) and Denial of Service (DoS) as well as other cyber related attacks. The time required for the entire election data encryption, transmission, decryption, upload time and download time has been greatly enhanced with the proposed system. The proposed system workflow algorithm, key generation algorithm, encryption algorithm and decryption have been presented in this research paper. The outcome of the research work indicates that only 0.00078 seconds is required to generate keys for about 100 users. About 0.705 seconds and 0.863 seconds is required for the encryption and decryption of a 500MB election results data. It was observed that the overall election results data transmission time is about 51.779 seconds which is less than one minute (60 seconds) for about 500MB data size of the election results data. This paper makes a case for the adoption and implementation of the proposed system since it performs better in terms of securing the election results data and transmission time in the cloud environment.

A randomized encryption deduplication method against frequency attack

Encryption deduplication technology first encrypts the file or chunks of data, then detects and removes duplicate ciphertexts, storing only one copy on the cloud storage server (CSP). Although traditional encryption deduplication schemes have the function of ciphertext deduplication, they also have a serious problem. Since the key generation algorithm and the encryption algorithm are deterministic, the frequency of plaintext chunking will be leaked. It is possible for the attacker to infer the information of the plaintext. We propose a Randomized Encryption deduplication method against Frequency Attack (REFA) that provides high randomness in ciphertexts. The core idea of REFA is that after obtaining a convergence key generated with the aid of a key server, the user randomizes the convergence key with a random value of the same length. Then, REFA encrypts the plaintext chunk with a randomized key. Our scheme hides the random value in the ciphertext and encrypts the convergence key for user ownership verification. REFA perfectly masks the frequency of plaintext chunks and has high storage efficiency and data security. Furthermore, the CSP performs ciphertext updates with ciphertexts uploaded by subsequent users. REFA can effectively protect against frequency analysis attacks.

A provably masked implementation of BIKE Key Encapsulation Mechanism

BIKE is a post-quantum key encapsulation mechanism (KEM) selected for the 4th round of the NIST's standardization campaign. It relies on the hardness of the syndrome decoding problem for quasi-cyclic codes and on the indistinguishability of the public key from a random element, and provides the most competitive performance among round 4 candidates, which makes it relevant for future real-world use cases. Analyzing its side-channel resistance has been highly encouraged by the community and several works have already outlined various side-channel weaknesses and proposed ad-hoc countermeasures. However, in contrast to the well-documented research line on masking lattice-based algorithms, the possibility of generically protecting code-based algorithms by masking has only been marginally studied in a 2016 paper by Chen et al. in SAC 2015. At this stage of the standardization campaign, it is important to assess the possibility of fully masking BIKE scheme and the resulting cost in terms of performances. In this work, we provide the first high-order masked implementation of a code-based algorithm. We had to tackle many issues such as finding proper ways to handle large sparse polynomials, masking the key-generation algorithm or keeping the benefit of the bitslicing. In this paper, we present all the gadgets necessary to provide a fully masked implementation of BIKE, we discuss our different implementation choices and we propose a full proof of masking in the Ishai Sahai and Wagner (Crypto 2003) model. More practically, we also provide an open C-code masked implementation of the key-generation, encapsulation and decapsulation algorithms with extensive benchmarks. While the obtained performance is slower than existing masked lattice-based algorithms, we show that masking at order 1, 2, 3, 4 and 5 implies a performance penalty of x5.8, x14.2, x24.4, x38 and x55.6 compared to order 0 (unmasked and unoptimized BIKE). This scaling is encouraging and no Boolean to Arithmetic conversion has been used.

Blockchain-based efficient verifiable outsourced attribute-based encryption in cloud

Attribute-based encryption (ABE) has been widely applied in cloud services for access control. However, a large number of pairing operations required for decryption affect the wide use of ABE on lightweight devices. A general solution is to outsource the heavy computation to the cloud service provider (CSP), leaving the lighter computation to the data user. Nevertheless, it is impractical to assume that the CSP will provide free services. A recent ABE scheme with payable outsourced decryption ABEPOD (TIFS’20) provides a solution for the above payment issue. The CSP is generally untrusted, however, ABEPOD does not offer a verification mechanism for the data user to verify the correctness of the message. Moreover, the use of dual key pairs in ABEPOD incurs a significant computational overhead for data users during the key generation phase. We address the above issues by presenting a new blockchain-based verifiable outsourced attribute-based encryption system that enables data users to verify the correctness of plaintexts. We implement batch verification using homomorphic technical to optimize the verification process. We use the technique of dichotomous search to accurately locate problematic plaintexts. Additionally, we optimize three key-generation algorithms to transfer the computational cost from the data user to the key generation center. We offer the formal security models and the instantiation system with security analysis. As compared to ABEPOD, we further optimize the key-generation algorithms such that the computational overhead of transformation-key and verification-key generation for data users is reduced from O(Ω) to O(1) and reduced by half respectively, where Ω is the number of attributes.

An innovative image encryption algorithm enhanced with the Pan-Tompkins Algorithm for optimal security

This study introduces a cutting-edge image encryption algorithm aimed at elevating security standards. The Pan-Tompkins Algorithm (PTA) for key generation is proposed for the first time in this study. Additionally, employing steganography through the Least Significant Bit (LSB) method for embedding keys within the encrypted image enhances secure key distribution, thereby fortifying the encryption process. On the other hand, the integration of advanced algorithms, such as Zigzag scanning, the Affine Image Encryption Algorithm (AA), and the Vigenere Image Encryption Algorithm (VA), constitutes the fundamental innovation of the proposed image encryption algorithm. The proposed algorithm is named PanAAVA:Affine Algorithm and Vigenere Algorithm Encryption with PTA-Based Key Generation. The PanAAVA algorithm ensures unparalleled security by encrypting the positions and values of pixels using AA and VA. Notably, using PTA for key generation marks a distinctive and new key generation method feature of the algorithm. To assess the effectiveness of the PanAAVA, a comprehensive comparative analysis is conducted against well-established encryption methodologies, including Lena, Baboon, Airplane, and Pepper.The PanAAVA demonstrates exceptional proficiency in histogram analysis. The PanAAVA demonstrates a Unified Average Changing Intensity (UACI) of 33.4044%. Additionally, the Number of Pixels Change Rate (NPCR) is measured at 99.7442%, showcasing the algorithm’s effectiveness in inducing significant pixel changes. The proposed algorithm’s Mean Square Error (MSE) is calculated at 3.20679E5%. The proposed algorithm’s Peak Signal to Noise Ratio (PSNR) is recorded at 9.512475. The Key Space Size of the proposed algorithm is measured at 2209. Regarding correlation analysis, the PanAAVA achieves a high correlation score of 7.9996. The proposed algorithm successfully passes the National Institute of Standards and Technology (NIST) analysis, demonstrating a remarkably strong correlation close to 0 and a Structural Similarity Index Measure (SSIM) of 0.9977. Furthermore, regarding quantum communication, the proposed algorithm maintains stable key rates of 47.5 ± 0.8 kHz during the day and 50.9 ± 0.7 kHz at night. Additionally, PanAAVA achieves low Quantum Bit Error Rate (QBER) values of 4.77 ± 0.02, ensuring reliable and secure communication. The PanAAVA also demonstrates robust asymmetries at 49.81 ± 0.02 and 50.14 ± 0.03 for a crystal length of 20 mm. highlighting PanAAVA’s adaptability and effectiveness in different scenarios. PanAAVA outperforms other encryption algorithms concerning performance measurements and comparisons. In conclusion, the PanAAVA emerges as a beacon of superior security capabilities and innovation in image encryption, showcasing the potential to redefine standards in the field.

Hybrid KuFaI: A novel secure key generation algorithm using fast independent component analysis for physical layer security techniques

AbstractMany real‐world applications, such as smart cities, industrial automation, health care, and so forth, utilize IoT‐enabled devices as a part of wireless networks. IoT devices must have low power and low computation complexity requirements with proper measures of security challenges. Since traditional cryptography techniques are not computationally efficient, other alternatives, such as physical layer key generation (PLKG), is one of the attractive means to achieve security. In this paper, we propose to use a fast independent component analysis (FICA) based KuFaI (Kurtosis and FICA) algorithm for a secured PLKG system. This method reduces data dimensions and improves system performance regarding Bit Disagreement Rate (BDR) and randomness. In KuFaI, we rearrange the received signal strength indicator (RSSI) data set using FICA and then select components based on the kurtosis function. Results demonstrate that the performance of the proposed algorithm is far better than the previously used PCA‐based algorithm.

A Statistical Analysis of Wireless Body Area Network using Clustering Based Routing Protocols

Recently, research on wireless body-area sensor networks (WBASN) or wireless body area networks (WBANs) has gained great importance in medical applications, and now plays an important role in patient monitoring. Clustering is the most important task in wireless sensor networks (WSNs) by data aggregation through each cluster head (CH). The development of technology has seen comfort in the domestic and professional life of an individual. However, such survival was not able to meet medical emergencies during the pandemic COVID-19 and other health surveillance scenarios. As a result, it is important to design an energy-efficient routing system for WBAN. Existing routing algorithms focus more on energy efficiency than security. A Secure Optimal Path-Routing (SOPR) protocol is proposed to identify and discover routes in WBAN that are secure against black-hole attacks. In this paper the sensor's wireless capability has been tested with a simulator to detect and transmit signals across a wide range of frequencies and to ensure that data is transferred successfully. CARF reduces the maximum work done by relay nodes in case of overloaded nodes and thereby increases the energy distribution in the network. The proposed CARF design reduces packet loss and time delay, thereby increasing network lifetime compared to other fuzzy and heuristic methods used for routing in WSNs. The proposed algorithm maintains more than 75% of the residual energy in the network at a minimum initial energy level of 1 J to enable data syncing. A SAC-TA approach for data aggregation in WSNs is presented. False injection attacks are identified based on traffic analysis at the time of the route discovery process. One-time key generation algorithm is introduced to eliminate malicious nodes from the network. The presented paper proposes a congestion-free routing framework for data transmission from source to sink nodes in WSNs. Congestion-aware routing mechanisms modeled using fuzzy sets (CARF) include operations such as establishing non-localized nodes, by which more paths can be created for traffic distribution, and predicting an optimal congestion.

An Access Control Scheme With Privacy-Preserving Authentication and Flexible Revocation for Smart Healthcare.

IoT and 5G-enabled smart healthcare allows medical practitioners to diagnose patients from any location via electronic health records (EHRs) by wireless body area network (WBAN) devices. Privacy, including the medical practitioner's identity and the patient's EHR, can easily be leaked from hospitals or cloud servers, and secret keys used to access EHRs must be revoked after diagnosis. In response to the challenges associated with user authentication and secret key revocation, this paper proposes an access control scheme with privacy-preserving authentication and flexible revocation for smart healthcare using attribute-based encryption (ABE), named PAFR-ABE, which provides access control to prevent malicious users from decrypting EHRs. Meanwhile, PAFR-ABE ensures privacy-preserving authentication for users during secret key generation, which safeguards users' identities and prevents unauthorized requests for secret keys. In addition, PAFR-ABE achieves flexible revocation and recovery of secret keys, which eliminates the need to update secret keys for unrevoked users. Security analysis indicates that PAFR-ABE meets the security requirements of an access control scheme for smart healthcare, especially in terms of forward security and backward security. Performance analysis shows that PAFR-ABE is efficient in the key generation and revocation algorithms compared with typical access control schemes.

Key Generation Algorithms Based on Complex Components of Channel Impulse Response for Massive MIMO Wireless Communication Systems

Key Generation Algorithms Based on Complex Components of Channel Impulse Response for Massive MIMO Wireless Communication Systems

Filter generators with increased resistance against algebraic attacks

Filter generators form one of the best known and most studied classes of key stream generators used in synchronous stream ciphers. Each such generator consists of a binary linear shift register with a primitive feedback polynomial and a nonlinear Boolean function, which has a number of requirements related to the condition of generator security against known attacks. One such requirement is the high algebraic immunity of the generator's filter function; this parameter characterises security filter generator against modern algebraic attacks. In certain cases, this requirement is too restrictive in sense of practicality, as it increases the computational or circuit complexity of the key stream generation algorithm. This makes the actuality of increasing the resistance of filter generators with fixed filter functions, that have limited (low) algebraic immunity. The paper proposes to solve this problem by modifying the feedback function of the linear shift register. the security of the proposed generators against algebraic attacks is investigated and is shown that (under certain natural conditions) such generators are more secure at the same initial state length as compared to traditional filter generators. The proposed solution seems to be useful for practical application in advanced hardware-oriented stream ciphers design.

Polar code-based cryptosystem: comparative study and analysis of efficiency

<p><span>This review paper aims to examine the use of polar codes in public key cryptosystems, providing a comprehensive overview of the state-of-the-art in this field at present. This study thoroughly searches databases such as IEEE Xplore, Scopus, and the ACM digital library to locate relevant research articles. In this study, we demonstrate the use of polar codes in public key cryptography and provide valuable insights for researchers interested in this field of research. The paper identifies several areas for further research and development, such as improved security and reliability of polar code-based cryptosystems. An analysis of the review highlights the major challenges and open research questions in this area, including the need for efficient key generation algorithms and the trade-offs between security and performance. An analysis of various existing encryption techniques as well as their security proofs is provided in the tables.</span></p>

WVC: Towards Secure Device Paring for Mobile Augmented Reality

In mobile augmented reality applications, how to build a secure device connection between two previously unassociated devices without prior set-up is challenging, which also refers to the problem of device pairing. Most existing approaches to device pairing either have certain limits to be utilized in the environment of augmented reality or lack considerations of security issues. In this article, we design WVC, an intuitive, user-friendly, and secure device paring system for mobile augmented reality. It enables users to connect to a neighboring device by waving a finger to click towards it in the air. The system uses critical features from finger tracking trajectories to understand which device a user wants to interact with. Then, it designs key generation and correction algorithms to enhance security in device communication. In addition, we present solutions to defend against malicious attacks. We implement and test the system with 10 volunteers. The experimental results demonstrate the feasibility and effectiveness of the system under varied scenarios in which devices are close to each other at a small angle or located at different heights within 2 m .

Security enhancement in a cloud environment using a hybrid chaotic algorithm with multifactor verification for user authentication

A hybrid chaotic-based DNA and multifactor authentication strategy are created to improve the protection of the cloud environment. Initially, multimodal data are collected from the data owner then the information is compressed by utilizing the deflate compression approach. The data is then encrypted using hybrid chaotic-based DNA cryptography to increase the security of data. In this hybrid algorithm DNA is used for the key generation and chaotic algorithm is utilized for the encryption process. On the other hand, a multifactor authentication method is created to access data from the cloud to block access by unauthorized users. In that technique, users are requested to enter the registered Password with the generated OTP from the mobile number. Then, the device serial number is another factor to verify the accessing device. Likewise, the user's fingerprint and iris recognition are also validated for accessing the data. The cloud-based data can be accessible following users' successful authentication. The simulation analysis shows that the encryption and decryption time reached for image, string and integer data is 24, 0.065, 37, 0.14, 28 and 0.14 s, respectively, for the cloud security algorithm. The proposed algorithm effectively mitigates space consumption and provides improved data security in a cloud environment.

MKSS: An Effective Multi-authority Keyword Search Scheme for edge–cloud collaboration

The rapid development of cloud computing motivates Internet of Things users to outsource their data to enjoy value-added cloud services: data storage, data sharing, etc. To provide reliable but searchable results, searchable encryption (e.g., Ciphertext-Policy Attribute-Based Keyword Search (CP-ABKS)) become an area of active research. One major drawback of existing CP-ABKS designs lies in the private key being generated and distributed by a trusted Central Authority (CA), which is a single point of failure/attack. Another limitation is that the cloud server may return forged or incomplete query results to the data user. This paper proposes a novel Multi-authority Keyword Search Scheme for edge–cloud collaboration (MKSS). To protect the security of the private key, we design a private key generation algorithm based on secure multi-party computation. To preserve the integrity of search results, we construct an efficient verification algorithm that detects forged or incomplete results. We evaluate the security and performance of our protocol using real-world datasets to demonstrate robustness and efficiency. Our construction advances the existing body of research towards secure and efficient keyword search protocols in cloud systems.

Efficient and secure chaotic PRNG for color image encryption

Random number generation is considered a major problem for any digital color image cipher algorithm and secret communication protocol. Pseudo-random number generators (PRNGs) are used in many security applications because they afford both features, the randomness efficiency and quality of the PRNG. The paper proposes a new PRNG depending on a combination of the Secure Hash Algorithm (SHA-2(256)) with the results of three chaotic maps: the 2D Henon map, the 2D Kaplan-Yorke map, and the 2D Tinkerbell map. In the proposed chaotic generator, 6 initial floating-point numbers with 10−16 precision are inputs to SHA-2(256) for generating the initial values of the three chaotic maps. Then the chaotic maps are iterated to produce a binary sequence that is processed to enhance the sequence complexity based on binary XOR addition operation and 2D shifting scrambling method. The random binary sequences produced by the proposed PRNG algorithm were tested using several number of analyses like the national statistical test suite, correlation analyses, key space analyses, Sum of absolute analyses (SAD), key sensitivity analyses, and histogram analyses. The results proved that scrambling binary sequences have passed successfully the NIST tests where the ratio η of p-value concerns individual sequences between [0.9805, 0.9994], the correlation between the produced sequences is very small where the distributions of Pearson's correlation coefficients belong to [-0.03, 0.03] and the distributions of Hamming distance coefficients belonging to [0.49, 0.52], all the results of the SAD between [0.33237, 0.33451] which are almost close ideal values, and the key space of proposed PRNG is very large which is 2319. The proposed PRNG was applied as a random key generation algorithm on a new color image cipher algorithm, with strong permutation and substitution methods to encrypt and decrypt each image color channel. The practicableness of the algorithm was tested by different statistical and security analyses.

Salp Swarm Algorithm to solve Cryptographic Key Generation problem for Cloud computing

Cryptographic keys are long strings of random bits generated using specialized algorithms and help secure data by making it unpredictable to any adversary. Cryptographic keys are used in various cryptographic algorithms in many domains, i.e., Cloud computing, Internet-of-Things (IoT), Fog computing, and others. The key generation algorithms are essential in cryptographic data encryption and decryption algorithms. This work proposed a cryptographic key generation algorithm based on Shannon entropy and the Salp Swarm algorithm (SSA) for generating randomized keys. The proposed Cryptographic Key Generation algorithm utilizes the dynamic movement of salps to create high-quality, robust, and randomized keys against attacks. The transfer function and quantization method convert a salp into a cryptographic key. The proposed Cryptographic Key Generation algorithm has been evaluated on four transfer functions against three state-of-the-art swarm intelligence metaheuristics, i.e., particle swarm optimization, BAT, and grey wolf optimization algorithms. The keys of eight different bit lengths, i.e., 512, 256, 192, 128, 96, 80, 64, were generated and evaluated due to their applications in the different encryption algorithms, i.e., AES, DES, PRESENT, SIMON, SPECK, and 3DES. The simulation study confirms that the proposed key generation algorithm effectively produces secure cryptographic keys.

Lattice based distributed threshold additive homomorphic encryption with application in federated learning

In federated learning (FL), a parameter server needs to aggregate user gradients and a user needs to protect the value of their gradients. Among all the possible solutions to the problem, those based on additive homomorphic encryption (AHE) are natural. As users may drop out in FL and an adversary could corrupt some users and the parameter server, we require a dropout-resilient AHE scheme with a distributed key generation algorithm. In this paper, we aim to provide a lattice based distributed threshold AHE (DTAHE) scheme and to show their applications in FL. The main merit of the DTAHE scheme is to save communication bandwidth compared with other latticed based DTAHE schemes. Embedding the scheme into FL, we get two secure aggregation protocols. One is secure against a semi-honest adversary and the other is secure against an active adversary. The latter exploits a smart contract in a ledger. Finally, we provide security proofs and performance analysis for the scheme and protocols.