Public Key Encryption Algorithm Research Articles

An Improved Public Key Cryptographic Algorithm Based on Chebyshev Polynomials and RSA

Due to its very desirable properties, Chebyshev polynomials are often used in the design of public key cryptographic systems. This paper discretizes the Chebyshev mapping, generalizes the properties of Chebyshev polynomials, and proposes an improved public key encryption algorithm based on Chebyshev chaotic mapping and RSA, i.e., CRPKC−Ki. This algorithm introduces alternative multiplication coefficients Ki, the selection of which is determined by the size of TrTdxmod N=TdTrxmod N, and the specific value selection rules are shared secrets among participants, overcoming the shortcomings of previous schemes. In the key generation and encryption/decryption stages, more complex intermediate processes are used to achieve higher algorithm complexity, making the algorithm more robust against ordinary attacks. The algorithm is also compared with other RSA-based algorithms to demonstrate its effectiveness in terms of performance and security.

A blind signature scheme for IoV based on 2D-SCML image encryption and lattice cipher

Today’s Internet of Vehicles (IoV) faces many security risks in the data transmission process, and image data is more vulnerable to security threats in the transmission process due to its special characteristics such as large amounts of information and high visibility. Therefore, to guarantee the dependability of data transmission in the IoV environment, this paper designs a blind signature scheme for IoV based on two-dimensional sine cosine cross-chaotic mapping (2D-SCML) image encryption and lattice cipher (BSS-IoV). The innovation of this scheme is that it aims at blind signature of image information, blinds it before sending the information, and combines the lattice public key encryption algorithm to better ensure the safe and reliable transmission of information and reduce the risk of information disclosure. To further ensure the security of the scheme, an image encryption algorithm based on 2D-SCML and pixel splitting (2PS-IEA) is proposed, which is used to blind the information and thus reduce the risk of information leakage on the one hand, on the other hand, it is used in the signature process to ensure the security of the signed information. The 2D-SCML is derived from the cross-model structure proposed in this paper. Through simulation results and experimental analysis, the values of NPCR and UACI, respectively, 99.6094% and 33.4635%, are close to ideal values. And 50% of the cut image can also recover the rough information, which indicates that the signature scheme has the security against differential attacks, cut attacks and noise attacks. Moreover, the security analysis shows that the scheme has the anti-tamper, anti-repudiation and traceability.

Reconfigurable and High-Efficiency Polynomial Multiplication Accelerator for CRYSTALS-Kyber

Recently, NIST has identified the first four quantum-resistant algorithms for post-quantum cryptography (PQC) standardization. CRYSTALS-Kyber (Kyber) is the only public-key encryption and key-establishment algorithm among them. In this paper, we propose a reconfigurable, high-speed, and area-efficient polynomial multiplication accelerator for Kyber to facilitate its practical applications. The cornerstone of polynomial multiplication is the butterfly-unit (BU) structure, composed of modular addition, subtraction, and multiplication. For the modular multiplication, we adopt the Barrett reduction method and reduce the size of operands leveraging the form of modulus with a novel formula transformation, which significantly decreases the computational complexity and increases the maximum clock frequency. On the hardware side, we make 4 BU modules constitute a binomial arithmetic core (Bi-Core) as the basic reconfigurable unit. The memory access scheme tailored for parallel processing is explored with data-reusing and memory-grouping methods, and a compact control logic is devised. The complete polynomial multiplication architecture is coded with Verilog and implemented on a Xilinx Artix-7 xc7a100t-3 device. Experiment results demonstrate that our implementations with different configurations all outperform the state-of-the-art works in area efficiency by up to 39% improvement in terms of area-time product (ATP). Moreover, the proposed design with 4 Bi-Cores achieves the fastest speed among existing designs.

PUBLIC KEY ENCRYPTION SCHEME BASED ON KEYWORD SEARCH

This study explores the concept of a Public Key Encryption Scheme (PKES) with an emphasis on enabling keyword search functionality. The aim of this research is to develop a cryptographic framework that allows users to securely search over encrypted data without revealing sensitive information. The study investigates various methods and techniques employed in PKES to achieve efficient and privacy-preserving keyword search capabilities. The research highlights the increasing importance of data privacy and the need for secure information retrieval over encrypted data. Traditional encryption methods hinder search functionality, making it challenging to perform keyword searches on encrypted data. To address this limitation, the study focuses on PKES, which facilitates search operations while preserving the confidentiality of the underlying data. Experimental research design was used for this research. To accomplish the objectives, the study employs a combination of cryptographic algorithms and data transformation techniques. Public key encryption algorithms are utilized to secure the data, ensuring that only authorized users can access the information. Additionally, searchable encryption methods, such as Searchable Symmetric Encryption (SSE) and Index-Based Encryption (IBE), are explored to enable efficient and secure keyword searches on encrypted data. The results of the research demonstrate the feasibility and effectiveness of the proposed PKES with keyword search. The developed framework allows users to encrypt their data and store it securely, while still being able to search for specific keywords without decrypting the data. The experiments conducted on different datasets showcase the efficiency of the implemented techniques, providing a practical solution for secure data retrieval. In conclusion, the study presents a robust and privacy-preserving Public Key Encryption Scheme that incorporates keyword search capabilities. The research contributes to the field of cryptography by addressing the limitations of traditional encryption methods and offering an effective solution for secure information retrieval. The findings highlight the significance of PKES in safeguarding sensitive data while allowing users to perform keyword searches conveniently

A blind watermarking algorithm based on specific component quantization in DHT domain

For meeting the higher demands of color image ownership protection in the fifth-generation (5 G) communication network, a blind watermarking algorithm based on specific component quantization of discrete Hartley transform (DHT) is proposed. At first, the color cover image is partitioned into the non-overlapping blocks of sized 4 × 4, and the DHT component of the selected block at specific location is calculated; then the inherent correlation in RGB channels and quantization index modulation (QIM) technique are used to obtain the component difference; finally, without global DHT of forward and inverse, the color watermark logo is inserted into the cover image by the derived modification method. Moreover, RSA public-key encryption algorithm is applied to scramble the parameters of Affine transform, which guarantees the double-layer security of watermark itself and algorithm secret keys. When extracting watermark, an image correction strategy based on geometric features is realized to resist geometric distortion. Experiment results show that the proposed algorithm has low computational complexity, strong robustness and high security at the foundation of good invisibility and large payload, which overcomes the shortcoming of slow execution speed of transform-domain watermarking and has high feasibility of fast copyright protection in 5 G environment.

Post-Quantum Biometric Authentication Based on Homomorphic Encryption and Classic McEliece

Homomorphic encryption is a powerful mechanism that allows sensitive data, such as biometric data, to be compared in a protected way, revealing only the comparison result when the private key is known. This is very useful for non-device-centric authentication architectures with clients that provide protected data and external servers that authenticate them. While many reported solutions do not follow standards and are not resistant to quantum computer attacks, this work proposes a secure biometric authentication scheme that applies homomorphic encryption based on the Classic McEliece public-key encryption algorithm, which is a round 4 candidate of the NIST post-quantum standardization process. The scheme applies specific steps to transform the features extracted from biometric samples. Its use is proposed in a non-device-centric biometric authentication architecture that ensures user privacy. Irreversibility, revocability and unlinkability are satisfied and the scheme is robust to stolen-device, False-Acceptance Rate (FAR) and similarity-based attacks as well as to honest-but-curious servers. In addition to the security achieved by the McEliece system, which remains stable over 40 years of attacks, the proposal allows for very reduced storage and communication overheads as well as low computational cost. A practical implementation of a non-device-centric facial authentication system is illustrated based on the generation and comparison of protected FaceNet embeddings. Experimental results with public databases show that the proposed scheme improves the accuracy and the False-Acceptance Rate of the unprotected scheme, maintaining the False-Rejection Rate, allows real-time execution in clients and servers for Classic McEliece security parameter sets of 128 and 256 bits (mceliece348864 and mceliece6688128, respectively), and reduces storage requirements in more than 90.5% compared to the most reduced-size homomorphic encryption-based schemes with post-quantum security reported in the literature.

A flexible continuous-wave quantum cryptography scheme with zero-trust security for Internet of Things

As quantum computing techniques develop rapidly, the security of classical communication, which is usually based on public key encryption algorithm, is under great threat. Therefore, a key establishment method with physics base is demanding, especially for Internet of Things devices, where energy and computational power is quite limited. In this article, we present a flexible continuous-wave quantum cryptography scheme for Internet of Things systems. In this configuration, the IoT controller contains a narrow linewidth laser as a real local oscillator. Thus, it is capable of working as either a host or a client in quantum key distribution with remote servers, and efficiently generating quantum random numbers for quantum key distribution, as well as one time pad communication with deployed sensors. The security of the scheme is analyzed under the assumption of collective attacks in the asymptotic regime, and feasibility is theoretically verified with typical channel and commercial device parameters.

Quantum Key Distribution for Secure Communications

Data protection and information security have been the essence of communication in today's digital era. Authentication and secrecy of secure communication are achieved using key-based cryptographic primitives; the security of which significantly relies upon the underlying computationally complex mathematics. Moreover, these existing cryptographic primitives are considered to be non-deterministic on the basis of the existing computational capabilities. However, the considerable advancements in the development of quantum computers have significantly enhanced parallel computations; thereby, posing a great threat to these existing encryption primitives. Thus, in the future, the physical manifestation of a large successful quantum computer is likely to break all the existing public-key encryption algorithms in no time. This has led to a remarkable surge of interest in propelling quantum mechanics into existence; subsequently, leading cryptographers to research various viable domains to offer quantum-resistant secure communications. Resultantly, quantum cryptography/quantum key distribution has emerged as a futuristic replacement for classical cryptography as it offers unconditionally secure communication along with the inherent detection of any unintended user. Thus, keeping in view the significance of this relatively newer domain of cryptography, this research focuses on presenting a consolidated review of the various Quantum Key Distribution (QKD) protocols. A comparative analysis of the working mechanism of the prominent QKD protocols is presented along with an overview of the various emerging trends that have been proposed to optimize the implementational efficiency of the BB84 protocol.

Status report on the third round of the NIST post-quantum cryptography standardization process

In recent years, there has been steady progress in the creation of quantum computers. If large-scale quantum computers are implemented, they will threaten the security of many widely used public-key cryptosystems. Key-establishment schemes and digital signatures based on factorization, discrete logarithms, and elliptic curve cryptography will be most affected. Symmetric cryptographic primitives such as block ciphers and hash functions will be broken only slightly. As a result, there has been an intensification of research on finding public-key cryptosystems that would be secure against cryptanalysts with both quantum and classical computers. This area is often called post-quantum cryptography (PQC), or sometimes quantum-resistant cryptography. The goal is to design schemes that can be deployed in existing communication networks and protocols without significant changes. The National Institute of Standards and Technology is in the process of selecting one or more public-key cryptographic algorithms through an open competition. New public-key cryptography standards will define one or more additional digital signatures, public-key encryption, and key-establishment algorithms. It is assumed that these algorithms will be able to protect confidential information well in the near future, including after the advent of quantum computers. After three rounds of evaluation and analysis, NIST has selected the first algorithms that will be standardized as a result of the PQC standardization process. The purpose of this article is to review and analyze the state of NIST's post-quantum cryptography standardization evaluation and selection process. The article summarizes each of the 15 candidate algorithms from the third round and identifies the algorithms selected for standardization, as well as those that will continue to be evaluated in the fourth round of analysis. Although the third round is coming to an end and NIST will begin developing the first PQC standards, standardization efforts in this area will continue for some time. This should not be interpreted as meaning that users should wait to adopt post-quantum algorithms. NIST looks forward to the rapid implementation of these first standardized algorithms and will issue future guidance on the transition. The transition will undoubtedly have many complexities, and there will be challenges for some use cases such as IoT devices or certificate transparency.

Comparing and Reviewing Modern Primality Tests

Primality tests refer to algorithms that determine whether a number is prime or composite. These tests are essential to modern encryption algorithms, including the widely used RSA public key encryption algorithm. However, with so many different primality tests out there, choosing the correct one for a given application can be challenging. This paper provides an overview of modern primality tests, detailing the differences between different types of tests and when one test may be preferable to another. Furthermore, implementations of popular primality tests are written and compared to one another graphically to better understand their differing performances. Lastly, we look at next steps for the field of primality tests due to the rise of quantum computing, which could serve as a means of creating even better primality tests.

A Study on Scalar Multiplication Parallel Processing for X25519 Decryption of 5G Core Network SIDF Function for mMTC IoT Environment

When 5G telecommunication becomes a standardized and widely used communication medium, it must be implemented in coherence with certain 5G network standards and requirements. One such requirement is a Subscription Concealed Identifier called SUCI. SUCI prevents the exposure of international mobile subscriber identity (IMSI), which was a vulnerability in previous generation mobile telecommunication networks. Unlike IMSI, SUCI is encrypted and transmitted using a symmetric key cryptographic algorithm, to prevent the aforementioned vulnerabilities. However, for the first terminal to be encrypted, it is necessary to exchange a key with the home network, and this key exchange for SUCI encryption is performed through the Elliptic Curve Integrated Encryption Scheme (ECIES) key exchange algorithm, which is a public-key encryption scheme. However, ECIES uses more computing resources compared to a symmetric key cryptographic algorithm. Additionally, for 5G Subscriber Identity Deconcealing Function (SIDF) to satisfy the massive machine-type communication (mMTC) requirements of 5G, it is necessary to decrypt at least a million SUCIs within a short time. This puts a great burden on the 5G home network to provide the mMTC service for IoT. Therefore, in this paper, we propose a method of constructing 5G SIDF in an mMTC IoT environment. A key method of the proposed 5G SIDF configuration is the use of GPUs. This proposal was aimed at reducing the load in the mMTC environment by performing parallel processing of all cryptographic operations performed in the SIDF using a GPU. In particular, we focused on parallelization of public-key encryption algorithms. In addition, we also compared the method proposed in this paper through a survey of various 5G security products.

An Analysis of Hardware Design of MLWE-Based Public-Key Encryption and Key-Establishment Algorithms

This paper presents a review of module ring learning with errors-based (MLWE-based) public-key encryption and key-establishment algorithms. In particular, we introduce the preliminaries of public key cryptography, MLWE-based algorithms, and arithmetic operations in post-quantum cryptography. We then focus on analyzing the state-of-the-art hardware architecture designs of CRYSTALS-Kyber at different security levels, including hardware architectures for Kyber-512, Kyber-768, and Kyber-1024. This analysis is dedicated to providing complete guidelines for selecting the most suitable CRYSTALS-Kyber hardware architecture to apply in post-quantum cryptography-based security systems in reality, with different requirements of security levels and hardware efficiency.

An efficient quantum hash-based CP-ABE framework on cloud storage data

With the exponential growth of cloud data and storage space, cloud security has become one of the interesting research areas of cloud computing servers. Attribute-based encryption is a public key encryption algorithm that allows cloud users to secure their sensitive information in the public cloud servers. Quantum key distribution (QKD) is required to improve the security of communication systems. Quantum cryptographic scheme completely depends on quantum mechanics. The major objective of quantum key distribution is to generate a key that takes part in encryption. Traditional attribute-based encryption models are insecure and possible of key distribution attacks using man-in-the-middle attacks. Also, as the size of the input data increases, traditional ABE models failed to compute efficient secret key due to computational time and network overhead. To overcome these issues, a novel chaotic integrity and quantum key distribution (QKD)-based cipher text policy ABE model is implemented in cloud environment. Experimental results proved that the proposed model has high computation speed, storage overhead and secured key distribution compared to traditional CP-ABE, KPABE and QKD-ABE models.

Design of Safety and Integrated Disaster Prevention System Based on Big Data Technology

With the development of Internet technology, with the continuous increase of data volume, it has become more and more difficult to maintain the traditional centralized data storage method. Data is easy to copy, difficult to share, high storage costs, and low data usage efficiency. Further trigger the demand for more efficient data storage technology. This article aims to study the application of blockchain technology in the data security storage and sharing system. On the basis of analyzing the problems of data sharing and cryptography, the functional modules of the data security storage and sharing system are designed. Encryption uses public key encryption algorithm to ensure encryption performance. The simulation experiment results show that the system is effective for file sharing, and the average generation time of the algorithm in this paper is within the controllable range.

Intelligent control of electric automation instrumentation based on blockchain

AbstractWith the development of society and the continuous improvement of residents' living standards, residents have higher and higher requirements for the technical level of power system. This paper mainly studies how to apply intelligent technology to the research of instrument electrical control. Nowadays, the traditional electrical instruments cannot meet the needs of the public, so the research on intelligent instruments is the most important problem at present. This article uses the RSA public key encryption algorithm based on the public blockchain. In the experimental results of this article, big data shows that from 2016 to mid‐2017, there were 50 merchants using non‐smart technologies in electrified dashboards in 2016. There are 40 merchants using smart technology in electrified dashboards, which is lower than the number of non‐smart control technologies. However, in 2017, the number of merchants using non‐intelligent control was 35, and by November 2017, it was 120, a decrease of 5% from 2016. The number of merchants using smart technology in electrified dashboards is increasing every month, from 45 in January 2016 to 285 in November 2017, an increase of 13% in the same year. This shows that intelligent control is more and more widely used in electrical automation instrument panels. Therefore, the research of a more intelligent control system of electrical automation instruments is a problem that has attracted much attention today.

40Gbits−1 Data Transmission in an Installed Optical Link Encrypted Using Physical Layer Security Seeded by Quantum Key Distribution

Data security plays an increasingly important role in modern telecommunications. The advent of quantum computational processors presents a significant threat to today's widely employed public key encryption algorithms, necessitating the adoption of new approaches to data encryption. Whilst quantum key distribution guarantees unconditional security for cryptographic key exchange in optical communication networks, the data rate is slow (Mbit/s), especially when compared to conventional optical communication. Here we present a highly secure encryption approach in which the encryption key, generated by quantum key distribution at a rate of up to 2.9 Mbit/s, was used to seed physical layer encryption performed using time domain spectral phase encoding (TDSPE). This allowed us to demonstrate encrypted 40 Gbit/s quadrature phase shift keyed data communications over 52.3 km of installed optical fiber, which cannot be eavesdropped using brute force computational attacks. Any attempt to eavesdrop the encrypted signal in the physical layer is highly time-sensitive – the phase states must be measured and decrypted prior to optical signal attenuation, which means that the attack procedure typically needs to be completed within a few milliseconds. This work represents the first example of quantum-enhanced physical layer encryption at realistic optical data rates that is fully secure from brute force computational attacks and the first demonstration of TDSPE using continuous-wave laser source and quadrature phase shift key modulation.

Public key image encryption algorithm based on pixel information and random number insertion

In this study, a public key image encryption algorithm is proposed based on pixel information and random number insertion. In the first step, two large prime numbers and the public key are selected randomly to produce the private key. According to the pixel information of the plain image and utilizing the Rivest-Shamir-Adleman (RSA) algorithm, the corresponding cipher information can be obtained by using the public key to encrypt the plain information extracted from the plain image. Both the plain and cipher information are then converted into the initial keys of the chaotic system based on a key transformation mapping. Consequently, the keystreams are generated based on iterative calculations. In the second step, different keystreams are selected for pixel arrangement and modulo operation preprocessing for the plain image. Subsequently, random numbers are inserted in the preprocessed image to obtain an extended image. The final cipher image can be got by selecting different keystreams to encrypt the extended image using XOR diffusion and add modulus operations. Combined with public key cryptosystem RSA, the proposed algorithm can achieve the effect of a one-time pad. Finally, experimental test results show that the cipher image obtained using our algorithm is highly random and robust, and can effectively resist violent, statistical, and differential attacks. A series of security analyses are implemented to validate the proposed asymmetric image encryption algorithm.

Blockchain-based Fair and Decentralized Data Trading Model

Abstract Data is a kind of important asset in the digital economy and is driving the rise of data markets. Meanwhile, data markets promote data trading efficiently and improve the utilization of data. However, several challenges about data trading need to be addressed. Here, we resolve these challenges via our blockchain-based fair and decentralized data trading model. Disputes about data correctness is settled by the decentralized arbitration mechanism in our model. To ensure the fairness of data trading, we integrate a sale contract and a deterministic public-key encryption algorithm. The decentralization feature of blockchain cuts off the single-point failure for the data trading platform. In addition, we prove that the proposed protocol achieves the desirable security properties that a secure data trading protocol should have. Moreover, utilizing the smart contract in Solidity and program in Java, we implement our model and then evaluate its performance.

Healthchain: A novel framework on privacy preservation of electronic health records using blockchain technology.

The privacy of Electronic Health Records (EHRs) is facing a major hurdle with outsourcing private health data in the cloud as there exists danger of leaking health information to unauthorized parties. In fact, EHRs are stored on centralized databases that increases the security risk footprint and requires trust in a single authority which cannot effectively protect data from internal attacks. This research focuses on ensuring the patient privacy and data security while sharing the sensitive data across same or different organisations as well as healthcare providers in a distributed environment. This research develops a privacy-preserving framework viz Healthchain based on Blockchain technology that maintains security, privacy, scalability and integrity of the e-health data. The Blockchain is built on Hyperledger fabric, a permissioned distributed ledger solutions by using Hyperledger composer and stores EHRs by utilizing InterPlanetary File System (IPFS) to build this healthchain framework. Moreover, the data stored in the IPFS is encrypted by using a unique cryptographic public key encryption algorithm to create a robust blockchain solution for electronic health data. The objective of the research is to provide a foundation for developing security solutions against cyber-attacks by exploiting the inherent features of the blockchain, and thus contribute to the robustness of healthcare information sharing environments. Through the results, the proposed model shows that the healthcare records are not traceable to unauthorized access as the model stores only the encrypted hash of the records that proves effectiveness in terms of data security, enhanced data privacy, improved data scalability, interoperability and data integrity while sharing and accessing medical records among stakeholders across the healthchain network.

A Crypto Compression System Using ElGamal Public Key Encryption Algorithm and Even-Rodeh Codes

Confidentiality and size of data are some significant aspects in data exchange. Public key encryption algorithms, such as El-Gamal is known as to preserve confidentiality. On the other hand, public key encryption algorithms tend to increase the size of the encrypted data, making it difficult to transmit to the other party. This research will combine the ElGamal public key encryption algorithm with Even-Rodeh codes. ElGamal is used to secure data and Even-Rodeh codes are used to compress data. The parameters is being tested are the compression ratio and space savings. In this research, we will do an experiment that includes some data texts from Artificial Corpus. The results show that the crypto compression system can reduce the size of the transmitted data and the transmitted data could be revert back to the original data while still maintains its confidentiality.