Search

Since the RSA public key cryptosystem was proposed, it has been widely used because of its strong security. Although the proposal of the Shor's algorithm offers hope for cracking RSA, it is debatable whether the algorithm can actually pose a threat in practice. From the perspective of the quantum circuit of the Shor's algorithm, we analyse the feasibility of cracking RSA with improved quantum circuits using an ion-trap quantum computer. We present an improved quantum circuit for the modular exponentiation of a constant, which is the most expensive operation in Shor's algorithm for integer factorization. Whereas previous studies mostly focused on minimizing the number of qubits or the depth of the circuit, we minimize the number of CNOTs, which greatly affects the time to run the algorithm on an ion-trap quantum computer. First, we give the implementation of the basic arithmetic with the lowest known number of CNOTs and the construction of an improved modular exponentiation of a constant by accumulating intermediate data and using a windowing technique. Then, we precisely estimate the number of improved quantum circuits needed to perform the Shor's algorithm for factoring an n -bit integer, which is 217 n 3 / log 2 n + 4 n 2 + n. We analyse the running time and feasibility of the Shor's algorithm on an ion-trap quantum computer according to the number of CNOTs. Finally, we discussed the lower bound of the number of CNOTs needed to implement the Shor's algorithm. [ABSTRACT FROM AUTHOR]

In order to enhance the cyber-security of networked control systems, Kogiso and Fujita (2015) proposed a concept of controller encryption using homomorphic encryption for the first time. Encrypted linear controllers using a homomorphic encryption scheme could conceal the information processed inside the controller device and maintain the original functions of controllers. In this paper, we propose a scheme to encrypt the linear controller using the BGN encryption, which supports homomorphic addition and multiplication. We also compare the efficiency of this scheme with the scheme with an encrypted controller using RSA encryption and Paillier encryption. [ABSTRACT FROM AUTHOR]

This work aims to solve the specific problem in the Power Internet of Things (PIoT). PIoT is vulnerable to monitoring, tampering, forgery, and other attacks during frequent data interaction under the background of big data, leading to a severe threat to the power grid's Information Security (ISEC). Cryptosystems can solve ISEC problems, such as confidentiality, data integrity, authentication, identity recognition, data control, and nonrepudiation. Thereupon, this work expounds on cryptography from public-key encryption and digital signature and puts forward the model of network information attack. Then, the security of the two cryptograms is certified against the two cyberattack modes. On this basis, an Identity-based Combined Encryption and Signature (IBCES) ensemble scheme is proposed by combining public-key encryption with the digital signature. Finally, the security of the proposed IBCES's encryption and the signature schemes is verified, and the results prove their feasibility. The results show that the proposed IBCEs are effective and feasible, fully meeting the information confidentiality requirements. Additionally, smart grid against Information Security (ISEC) algorithms must comprehensively consider network resources and computing power. This work creatively combines the two cryptosystems. The proposal breaks the traditional key segmentation principle by applying the same key to different cryptosystems and ensures the independent security of the two cryptosystems. The conclusion provides technical support for future research on cryptography. [ABSTRACT FROM AUTHOR]

Power load forecasting (PLF) has a positive impact on the stability of power systems and can reduce the cost of power generation enterprises. To improve the forecasting accuracy, more information besides load data is necessary. In recent years, a novel privacy-preserving paradigm vertical federated learning (FL) has been applied to PLF to improve forecasting accuracy while keeping different organizations' data locally. However, two problems are still not well solved in vertical FL. The first problem is a lack of a full data-processing procedure, and the second is a lack of enhanced privacy protection for data processing. To address it, according to the procedure in a practical scenario, we propose a vertical FL XGBoost-based PLF, where multiparty secure computation is used to enhance the privacy protection of FL. Concretely, we design a full data-processing PLF, including data cleaning, private set intersection, feature selection, federated XGBoost training, and inference. Furthermore, we further use RSA encryption in the private set intersection and Paillier homomorphic encryption in the training and inference phases. To validate the proposed method, we conducted experiments to compare centralized learning and vertical FL on several real-world datasets. The proposed method can also be directly applied to other practical vertical FL tasks. [ABSTRACT FROM AUTHOR]

In future, hundreds of years of mathematical problems that the security of public key cryptography algorithms rely on may be defeated by quantum algorithms. How can a digital signature scheme gracefully balance security and efficiency? This study uses the conjugate search problem and the left self-distributive system to combine and uses the RSA-like algorithm as the underlying structure to propose a new aggregated signature scheme. We, through the EUF game, under the random metaphor model, prove that the security of the scheme satisfies the adaptation unforgeability under selective message attack, the scheme can be finally reduced to the discrete logarithm problem or large prime number decomposition problem. In addition, we can achieve antiquantum attack and exhaustive attack by performing matrix calculations on the message, defining and changing the structure of the matrix by encoding, and setting thresholds for the matrix dimension and the length of the private key. In terms of efficiency, the message signature implementation is linear compared with the expansion rate in terms of storage and computing overhead, and the generation and verification of the final signature pair have nothing to do with the number of users. In addition, the length of the signature is fixed and the size is only the length of a single group, which effectively reduces the generation of public and private key pairs and saves a lot of storage space. The storage space and computational complexity are also effectively improved compared with other solutions. [ABSTRACT FROM AUTHOR]

As a promising service paradigm, cloud computing has attracted lots of enterprises and individuals to outsource big data to public cloud. To facilitate secure data using and sharing, dual-policy attribute-based encryption (DP-ABE) is a suitable solution. It allows two access control mechanisms over encrypted data at the same time: one involves access policies over subjective attributes ascribed to user credentials, and the other involves policies over objective attributes ascribed to data. In this work, we are exploring methods to make DP-ABE more flexible, more efficient, and more secure for deployments in cloud scenes. Our proposal features the following achievements simultaneously: (1) beyond the access control mechanisms of DP-ABE, it also supports two flexible features called encryption and key generation in single-policy modes; (2) most operations of key generation, encryption, and decryption are securely outsourced to cloud servers, leaving extremely low overheads for the PKG, data owners, and users; and (3) it realizes the strongest security notion of public-key encryption schemes, namely, CCA security. We formalize the security definition and formally prove its security in the random oracle model. Moreover, we implement the proposed schemes using the Charm framework. The experiment results demonstrate that our schemes are efficient and practical. [ABSTRACT FROM AUTHOR]

The reptile search algorithm (RSA) is a swarm-based metaheuristic algorithm inspired by the encirclement and hunt mechanisms of crocodiles. Compared with other algorithms, RSA is competitive but still suffers from low population diversity, unbalanced exploitation and exploration, and the tendency to fall into local optima. To overcome these shortcomings, a modified variant of RSA, named MRSA, is proposed in this paper. First, an adaptive chaotic reverse learning strategy is employed to enhance the population diversity. Second, an elite alternative pooling strategy is proposed to balance exploitation and exploration. Finally, a shifted distribution estimation strategy is used to correct the evolutionary direction and improve the algorithm performance. Subsequently, the superiority of MRSA is verified using 23 benchmark functions, IEEE CEC2017 benchmark functions, and robot path planning problems. The Friedman test, the Wilcoxon signed-rank test, and simulation results show that the proposed MRSA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability. [ABSTRACT FROM AUTHOR]

It is known that, given an RSA modulus, n = p q , the public key e and the corresponding private key d satisfy the modulo congruence e d ≡ 1 mod ϕ n , where ϕ n = p − 1 q − 1 . Usually, the private key d can be computed efficiently using the extended Euclidean algorithm, and it is common knowledge that the private key is unique in the sense of modular ϕ n . This paper shows that there exist multiple private keys d ; they all satisfy that d < ϕ n . This paper also presents the exact relationship between an RSA public key and a corresponding private key. [ABSTRACT FROM AUTHOR]

COVID-19 has made the world realize that the world is a whole, and international trade is the main way to connect countries. With the increase of international trade, the trade data has also become gradually huge. However, the current international trade data is still transmitted using the traditional Internet, which not only is inefficient, but also has poor security. Therefore, this paper aimed to use blockchain technology to explore the big data sharing model and key mechanism of international trade. This paper mainly introduced the design and implementation of a blockchain-based IoT data security sharing system. Firstly, the functional architecture of the prototype system was comprehensively introduced. According to the division of different functional modules, the data interaction design of different modules and the design of related smart contracts were expounded. According to the characteristics of international trade big data, the encryption and decryption algorithms are designed for the transmission of international trade big data. Finally, the prototype system was introduced from data acquisition, experimental environment deployment, system-related functional verification, and performance testing. The experimental test results showed that the encryption and decryption of transaction data by the data security sharing prototype system were more than 2 times faster than those of the traditional algorithm, and the transmission efficiency of the system at different nodes fluctuated within 10%, which showed that the system could perform security interactive sharing of data. [ABSTRACT FROM AUTHOR]

Password-authenticated key exchange (PAKE) protocols play an important role in cryptography. Most of PAKEs are based on the Diffie–Hellman key exchange protocols or RSA encryption schemes, but their security is threatened by quantum computers. In this study, we propose the first code-based PAKE protocol based on Ouroboros, which is a code-based key exchange protocol. Our scheme enjoys high efficiency and provides mutual explicit authentication, with a security reduction to decoding random quasi-cyclic codes in the random oracle model. [ABSTRACT FROM AUTHOR]

In order to solve the partial optimization problems of the RSA algorithm in computer network security, a method of RSA algorithm optimization based on data encryption was proposed. In the research, the application of data encryption in network information security system was mainly investigated, using RSA as the representative algorithm in the public key cryptosystem. The network information security model on the basis of data encryption was built on the public key cryptosystem in the research. Through the introduction of the RSA algorithm and the corresponding optimization scheme, the experiments for comparison were set up. Through the experiments, the feasibility of the optimization scheme was verified. Experimental results show that the efficiency of the RSA algorithm was about 1.0% to 2% higher than that of the traditional algorithm after a reasonable selection of parameters and the use of an optimized algorithm (also known as the combination algorithm), which improved the efficiency of RSA algorithm to a certain extent and achieved the purpose of improving RSA algorithm. It was proved that the method could effectively improve the budget efficiency of the RSA algorithm and solve the optimization problem of the RSA algorithm in computer network security. [ABSTRACT FROM AUTHOR]

In order to solve the practical problem that the security of computer network information cannot be guaranteed, which seriously affects the network performance, the author proposes a public key data encryption system based on PKI. The system proposed by the author is based on the public key cryptographic algorithm RSA, including implementation of data encryption and digital signature and key distribution, an improved RSA algorithm is proposed for the slow speed of RSA. The result obtained is as follows: after reasonable selection of parameters and the use of optimized algorithms (also known as combined algorithms), the RSA algorithm is about 1.0% to 2% more efficient than the traditional algorithm, to a certain extent, the operation efficiency of the RSA algorithm is improved, and the purpose of improving the RSA algorithm is achieved. It is proved that the public key data encryption system is of great significance for modern computer network information encryption and maintaining a green and secure network environment. [ABSTRACT FROM AUTHOR]

In order to promote the research process of information security in the whole society, improve the safety factor of computer data communication, strengthen computer security management, the author proposes a computer data encryption strategy that combines the strong security of the 3DES encryption algorithm and the asymmetric encryption advantages of the RSA algorithm. Through the detailed analysis of DES encryption algorithm and 3DES encryption, creatively uses the RSA encryption algorithm to improve the single 3DES algorithm, consolidates the performance of the 3DES encryption algorithm to ensure data communication, and ensures the data integrity, better improve encryption performance. Experiments show that: The proposed encryption algorithm improves security performance by 10 times, and the response efficiency is only 1 ms away from other algorithms, compared with other algorithms, it has better encryption performance and is suitable for actual computer data communication scenarios. Conclusion: The encryption algorithm proposed by the author has achieved good results in terms of security performance and response efficiency, it is suitable for actual computer data security communication and can effectively improve computer security management. [ABSTRACT FROM AUTHOR]

In order to solve the problem of information security, the process of digital resource development and integration has become the key. A method based on focusing on the development and integration of digital instructions is proposed, which discusses digital data encryption in detail, focusing on the DES algorithm in the symmetric encryption algorithm and the RSA algorithm in the asymmetric encryption algorithm and conducts a security evaluation. Through comparative analysis, the comprehensive communication system based on the combination of DES encryption algorithm and RSA encryption algorithm aims to realize the integration and sharing of digital display. Through experimental analysis and comparison with traditional commonly used encryption methods, 64-bit keys are very easy to generate, but the keys must be distributed before communication, and the keys must be changed from time to time. In this way, key management consumes a lot of system overhead. From the final experimental data, it can be concluded that the encryption algorithm has performance advantages over the separate DES and RSA algorithms. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper mainly proposes a nonrepudiation digital signature authentication scheme based on an enterprise contract computer vision system. Based on the RSA algorithm and MD5 message-digest algorithm, a digital signature scheme of enterprise economic contract based on IC card is proposed. The method realizes digital signature and ensures the confidentiality of the transmitted data. Finally, this paper proposes a concrete digital signature experiment system implemented in Java. The results of this study show that the computer vision signature encryption system helps to improve the reliability of the system. [ABSTRACT FROM AUTHOR]

With the advancements in the new technologies like IoT, the healthcare sector is also growing rapidly. The core concept of introducing IoT in the healthcare centers is to make it remotely accessible, so that communication between doctor and patient can be easy, and diagnosis of any disease can be remotely done through the Internet in case of emergency. The major objective of this study is to develop a security framework for the healthcare industry that can encrypt secret data on cloud servers using block-based data encoding. Since any information that is available on the Internet is vulnerable to various attacks, and the medical records of the patients carry sensitive information that must not be accessible to any unauthorized or unauthentic person, in this context, the concept of Blockchain (BC) technology was introduced in the healthcare systems. In the past few years, a number of BC based healthcare models were proposed in the system; however, these systems are decentralized in nature, which is a feature of Blockchain technology, but in certain applications, especially in healthcare, this feature gave rise to a problem termed as disease overlapping when the count of chains gets increased. To solve this issue, a BC based framework is used in this work that has a feature of creating a separate block in the chain every time whenever any alteration in information about patient's health, any allergies, new symptoms, medications, etc. is updated. In addition to this, securing the sensitive information of patients is taken into consideration by developing an improved and enhanced multilayer Blockchain based IoT data security approach that not only protects the data, but also builds the trust between patients/user and healthcare service providers. The main focused area of this research article is to propose a security framework for healthcare domain that can encrypt the confidential data over cloud server under block-based data encoding. In the proposed approach, 128-bit AES key is generated in order to support the SHA-256 hashing algorithm. Individual user's data is subdivided to blocks and encrypted to secure it from unauthorized access. An interface-based system is designed to present the real-world usage of the proposed model in healthcare application. Finally, the effectiveness of the proposed approach is validated in the MATLAB software in terms of MAE, RMSE, MSE, encryption time, and decryption time. The RSA and DSA are the most trending encryption algorithms. These algorithms are crucial components of Blockchain technology, implemented in the proposed work, and later on, their performances are also compared with each other to check their effectiveness. The simulation results demonstrated that the proposed encrypting algorithm surpasses the other encryption approaches such as RSA and DSA in all factors to prove its supremacy. The experimental results show that the encryption and decryption time are lowest in the proposed framework; therefore, its performance is more effective and robust. It is also more effective and resilient. [ABSTRACT FROM AUTHOR]

For major organizations, establishing financial shared service centers to unify the financial activities of entities in multiple countries and regions for bookkeeping and reporting has become the trend for financial and management optimization. Based on this, this paper selects security company A as a case study, introduces the emerging blockchain technology (BCT) as the core and embeds it into the concept of financial shared center, tries to explore a new model of financial shared service model under BCT from the theoretical perspective, and optimizes the original service model by improving its business process, creating visualized, supervisible, and traceable financial data processing capability, and expanding. This paper first examines the financial shared service model of Company A. This paper starts with the actual situation of Company A's financial shared service model. Complex procedures, highly centralized information, unreasonable division of labor in corporate processes, and a lack of adequate information communication methods are discovered through process analysis. New requirements for accountants have emerged in the digital age, and the security protection of private keys in asymmetric encryption algorithms in organizations, particularly in large and medium-sized enterprises, must be done well. [ABSTRACT FROM AUTHOR]

In light of the continuous development of Internet technology, many problems involving network security based on the blockchain have also been observed gradually. In this paper, the existence forms of network security hazards based on the blockchain are explored to establish a network blockchain security sharing model based on fuzzy logic. In security sharing, network blockchains are often maintained by many parties. This poses new potential threats and challenges to privacy protection in these multiparty network blockchains. This paper proposes a research scheme for a network blockchain security sharing model based on fuzzy logic. The tampering of the protected network blockchain is prevented by blockchain, and the fuzzy logic algorithm is used to ensure its confidentiality. This solution allows the exchange in the protected network blockchain and the security of transaction information based on the fuzzy logic algorithm. According to the results of the experiments, this method can ensure security sharing of the network blockchain with high practicality and achieve the expected design effect. [ABSTRACT FROM AUTHOR]

In mobile cloud services, smartphones may depend on IoT-based cloud infrastructure and information storage tools to conduct technical errands, such as quest, information processing, and combined networks. In addition to traditional finding institutions, the smart IoT-cloud often upgrades the normal impromptu structure by treating mobile devices as corporate hubs, e.g., by identifying institutions. This has many benefits from the start, with several significant problems to be overcome in order to enhance the unwavering consistency of the cloud environment while Internet of things connects and improves decision support system of the entire network. In fact, similar issues apply to monitor loading, resistance, and other security risks in the cloud state. Right now, we are looking at changed arrangement procedures in MATLAB utilizing cardiovascular failure information and afterward protecting that information with the assistance of RSA calculation in mobile cloud. The calculations tried are SVM, RF, DT, NB, and KNN. In the outcome, the order strategies that have the best exactness result to test respiratory failure information will be recommended for use for enormous scope information. Instead, the collected data will be transferred to the mobile cloud for preservation using the RSA encryption algorithm. [ABSTRACT FROM AUTHOR]

Health information management systems help gather, compile, and analyze health data to help manage population health and reduce healthcare costs. It can support the clinical decision, help diagnose individual patients, and improve patient care. In this study, a personal health information management system based on Java is presented. Based on the Java platform, the overall hierarchical structure of the system is designed including a health information management module, personal health data synchronization module, and full-text retrieval module, to realize the functions of the system. To improve the security of personal health information, the data encryption standard (DES) algorithm is implemented to encrypt and protect personal healthcare information. The system is evaluated in terms of health information acquisition accuracy, information security, and system response time. To verify the robustness of the proposed health information management system, it is compared with two related studies. The maximum health information acquisition accuracy of the system is 99%, the safety factor reported is above 0.9, and the maximum response time is only 0.8 s. The experimental results show that the designed personal health information management system can collect health information more accurately and ensure the security of information, and the overall response time is shorter. [ABSTRACT FROM AUTHOR]

Nowadays, the development of information technology can be described as extremely rapid, especially with the widespread use of the Internet; the security of communications in the network has become an important issue we are facing. The purpose of this article is to solve the problems in today's network security data encryption algorithms. Starting from the computer network communication security data encryption algorithm, we discuss the effects of several different encryption methods on improving network security. The research results show that it is known that the application of link encryption algorithm in network communication security encryption algorithm can increase the security index by 25%, the node encryption algorithm can increase the security index by 35%, and the end-to-end encryption algorithm can make the cyber activity safety index to increase by 40%. Among them, RSA algorithm and DES algorithm are two very representative algorithms; they represent different encryption systems. From the perspective of network data link, there are three methods of encryption algorithm, namely, link encryption algorithm, node encryption algorithm, and end-to-end encryption algorithm. [ABSTRACT FROM AUTHOR]

The previous encryption methods of hospital financial data have the problem of overburden. Therefore, a research study on hybrid encryption of hospital financial data based on Noekeon algorithm is proposed. From the basic principles of the Noekeon algorithm and the application and implementation of the Noekeon algorithm, a hybrid encryption scheme for hospital financial data based on the Noekeon algorithm is designed. In order to improve the security of the encryption system, the RSA algorithm is used to encrypt the encrypted content twice. The hybrid algorithm realizes the hybrid encryption of the hospital's financial data. Finally, a hybrid encryption system for hospital financial data based on Noekeon algorithm is designed. Experimental results show that this method has a higher success rate and better comprehensive performance. It not only improves the encryption efficiency of hospital financial data but also enhances the security of hospital financial data, which has greater application value. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network (WSN) is a particular network built from small sensor nodes. These sensor nodes have unique features. That is, it can sense and process data in WSN. WSN has tremendous applications in many fields. Despite the significance of WSN, this kind of network faced several issues. The biggest problems rising in WSN are energy consumption and security. Robust security development is needed to cope with WSN applications. For security purposes in WSN, cryptography techniques are very favorable. However, WSN has resource limitations, which is the main problem in applying any security scheme. Hence, if we are using the cryptography scheme in WSN, we must first guarantee that it must be energy-efficient. Thus, we proposed a secure hybrid session key management scheme for WSN. In this scheme, the major steps of public key cryptography are minimized, and much of the operations are based on symmetric key cryptography. This strategy extensively reduces the energy consumption of WSN and ensures optimum security. The proposed scheme is implemented, and their analysis is performed using different parameters with benchmark schemes. We concluded that the proposed scheme is energy-efficient and outperforms the available benchmark schemes. Furthermore, it provides an effective platform for secure key agreements and management in the WSN environment. [ABSTRACT FROM AUTHOR]

Traditional identity authentication solutions mostly rely on a trusted central entity, so they cannot handle single points of failure well. In addition, most of these traditional schemes need to store a large amount of identity authentication or public key information, which makes the schemes difficult to expand and use in distributed situations. In addition, the user prefers to protect the privacy of their information during the identity verification process. Due to the open and decentralized nature of the blockchain, the existing identity verification schemes are difficult to apply well in the blockchain. To solve this problem, in this article, we propose a privacy protection identity authentication scheme based on the blockchain. The user independently generates multiple-identity information, and these identities can be used to apply for an identity certificate. Authorities use the ECDSA signature algorithm and the RSA encryption algorithm to complete the distribution of the identity certificate based on the identity information and complete the registration of identity authentication through the smart contract on the blockchain. On the one hand, it can realize the protection of real identity information; on the other hand, it can avoid the storage overhead caused by the need to store a large number of certificates or key pairs. Due to the use of the blockchain, there is no single point of failure in the authentication process, and it can be applied to distributed scenarios. The security and performance analysis show that the proposed scheme can meet security requirements and is feasible. [ABSTRACT FROM AUTHOR]

Cloud 5G and Cloud 6G technologies are strong backbone infrastructures to provide high data rate and data storage with low latency for preserving QoS (Quality of Service) and QoE (Quality of Experience) in applications such as driverless vehicles, drone-based deliveries, smart cities and factories, remote medical diagnosis and surgery, and artificial-intelligence-based personalized assistants. There are many techniques to support the aforementioned applications, but for privacy preservation of Cloud 5G, the existing methods are still not sufficient. Public key encryption (PKE) scheme is an important means to protect user data privacy in Cloud 5G. Currently, the most common PKE used in Cloud 5G is CCA or CPA secure ones. However, its security level maybe not enough. SOA security is a stronger security standard than CPA and CCA. Roughly speaking, PKE with SOA security means that the adversary is allowed to open a subset of challenger ciphertexts and obtains the corresponding encrypted messages and randomness, but the unopended messages and randomness remain secure in the rest of the challenger ciphertexts. Security against SOA in PKEs has been a research hotspot, especially with the wide discussion in Cloud 5G. We revisited the SOA-CLE and proposed a new security proof, which is more concise and user friendly to understand privacy preservation in Cloud 5G applications. [ABSTRACT FROM AUTHOR]

The invention of the Ciphertext-Policy Attribute-Based Encryption scheme opened a new perspective for realizing attribute-based access control systems without being forced to trust the storage service provider, which is the case in traditional systems where data are sent to the storage service provider in clear and the storage service provider is the party that controls the access to these data. In the Ciphertext-Policy Attribute-Based Encryption model, the data owner encrypts data using an attribute-based access structure before sending them to the storage service, and only users with authorized sets of attributes can successfully decrypt the generated ciphertext. However, Ciphertext-Policy Attribute-Based Encryption schemes employ expensive operations (i.e., bilinear pairings and modular exponentiations) and generate long ciphertexts and secret keys, which makes them hard to implement in real-life applications especially for resource-constrained devices. In this paper, we propose two Ciphertext-Policy Attribute-Based Encryption Key Encapsulation Mechanisms that can be provided as services in the cloud, minimizing the user's encryption and decryption costs without exposing any sensitive information to the public cloud provider. In the first scheme, the ABE Service Provider is considered fully untrusted. On the other hand, the second scheme requires the ABE Service Provider to be semi-trusted (Honest-but-Curious) and does not collude with illegitimate users. Both schemes are proved to be selectively CPA-secure in the random oracle. The theoretical and experimental performance results show that both our first and second schemes are more efficient than the reviewed outsourced CP-ABE schemes in terms of user-side computation, communication, and storage costs. [ABSTRACT FROM AUTHOR]

Cloud-assisted Internet of Things (IoT) significantly facilitate IoT devices to outsource their data for high efficient management. Unfortunately, some unsettled security issues dramatically impact the popularity of IoT, such as illegal access and key escrow problem. Traditional public-key encryption can be used to guarantees data confidentiality, while it cannot achieve efficient data sharing. The attribute-based encryption (ABE) is the most promising way to ensure data security and to realize one-to-many fine-grained data sharing simultaneously. However, it cannot be well applied in the cloud-assisted IoT due to the complexity of its decryption and the decryption key leakage problem. To prevent the abuse of decryption rights, we propose a multiauthority ABE scheme with white-box traceability in this paper. Moreover, our scheme greatly lightens the overhead on devices by outsourcing the most decryption work to the cloud server. Besides, fully hidden policy is implemented to protect the privacy of the access policy. Our scheme is proved to be selectively secure against replayable chosen ciphertext attack (RCCA) under the random oracle model. Some theory analysis and simulation are described in the end. [ABSTRACT FROM AUTHOR]

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security. [ABSTRACT FROM AUTHOR]

There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt-freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in conjunction with classic public key encryption, to develop and instantiate a general construction of quantum election protocol. The proposed protocol exhibits the following advantages: (i) no pre-shared key between any two participants is required, and no trusted third party or anonymous channels are required. The protocol is suitable for large-scale elections with numerous candidates and voters and accommodates the situation in which multiple voters vote simultaneously. (ii) It is the first protocol that dismantles the contradiction between verifiability and receipt-freeness in a quantum election protocol. It satisfies all eight requirements stated earlier under the physical assumptions that there exists a one-way untappable channel from the administrator to the voter and that there is no collusion between any of the three parties in the protocol. Compared with current election protocols with verifiability and receipt-freeness, this protocol relies upon fewer physical assumptions. (iii) This construction is flexible and can be instantiated into an election scheme having post-quantum security by applying cryptographic algorithms conveying post-quantum security. Moreover, utilizing quantum digital signature and public key encryption yields a good result: the transmitted ballots are in quantum states, so owing to the no-cloning theorem, ballot privacy is less likely to be compromised, even if private keys of the signature and public key encryption are leaked after the election. However, in existing election protocols employing classic digital signatures and public key encryption, ballot privacy can be easily violated if attackers obtain private keys. Thus, our construction enhances privacy. [ABSTRACT FROM AUTHOR]

A visually meaningful image encryption scheme with an asymmetric structure based on the discrete wavelet transform (DWT) and Schur decomposition is proposed in this study. First, the RSA algorithm is used to generate the initial values for the chaotic system to produce the random sequence. Then, both scrambling and diffusion operations are performed on the plain image to obtain the preencrypted image. Moreover, the Schur decomposition is applied on the preencrypted plain image to obtain the upper triangular and orthogonal matrices. Second, the cover image is scrambled followed by a DWT operation. Four subbands are then formed, namely, LL, HL, LH, and HH. Finally, the former upper triangular matrix and orthogonal matrix are embedded into subbands LH and HH produced by the cover image. After the application of the inverse DWT and inverse scrambling operation, the final visually meaningful cover image embedded with a secret plain image can be obtained. No one can identify any useful information about the plain image from the final embedded cover image, nor can anybody know that there is any hidden secret image. Experimental simulations show that the normalized correlation values between the original cover image and the final visually meaningful cover image are approximately 0.9997. Therefore, the proposed encryption scheme is imperceptible for secret image communications. [ABSTRACT FROM AUTHOR]

Predicate encryption (PE), formalized by Katz et al., is a new paradigm of public-key encryption that conceptually captures the public-key encryption that supports fine-grained access control policy. Because of the nature of PE, it is used for cloud storage so that users can retrieve encrypted data without revealing any information about the data to cloud servers and other users. Although lots of PE schemes have been studied, the predicate-hiding security is seldom considered; that is, the user's secret key may leak sensitive information of the predicate. Additionally, the security of the current predicate-hiding PE schemes relies on the discrete logarithm assumption which cannot resist the quantum attacks in the future. In this paper, we propose a generic PE for inner product under symmetric-key setting, called private IPE, from specific key-homomorphic pseudorandom function (PRF). The rigorous proofs are provided to show that the construction is payload-hiding, attribute-hiding, and predicate-hiding secure. With the advantage of the generic construction, if the underlying PRF can resist quantum attacks, then, through our proposed generic construction, a quantum-resistant private IPE can be obtained. [ABSTRACT FROM AUTHOR]

The blockchain-based management system has been regarded as a novel way to improve the efficiency and safety of Vehicular Ad Hoc Networks (VANETs). A blockchain-based scheme's performance depends on blockchain nodes' computing power composed from the road-side unit (RSU). However, the throughput of blockchain-based application in VANETs is limited by the network bandwidth. A single blockchain cannot record large-scale VANETs' data. In this paper, we design an atomic cross-chain swap-based management system (ACSMS) to boost the scalability of blockchain-based application in VANETs. The blockchain-based public-key encryption with keyword search is further introduced to protect user privacy. The analysis shows that ACSMS achieves cross-chain swap without loss of CAV security privacy. The simulation results show that our method can realize multiple blockchain-based applications in VANETs. [ABSTRACT FROM AUTHOR]

The emergence of the cloud storage has brought great convenience to people's life. Many individuals and enterprises have delivered a large amount of data to the third-party server for storage. Thus, the privacy protection of data retrieved by the user needs to be guaranteed. Searchable encryption technology for the cloud environment is adopted to ensure that the user information is secure with retrieving data. However, most schemes only support single-keyword search and do not support file updates, which limit the flexibility of the scheme. To eliminate these problems, we propose a blockchain-enabled public key encryption scheme with multi-keyword search (BPKEMS), and our scheme supports file updates. In addition, smart contract is used to ensure the fairness of transactions between data owner and user without introducing a third party. At the data storage stage, our scheme realizes the verifiability by numbering the files, which ensures that the ciphertext received by the user is complete. In terms of security and performance, our scheme is secure against inside keyword guessing attacks (KGAs) and has better computation overhead than other related schemes. [ABSTRACT FROM AUTHOR]

The Industrial Internet of Things (IIoT), as a special form of Internet of Things (IoT), has great potential in realizing intelligent transformation and industrial resource utilization. However, there are security and privacy concerns about industrial data, which is shared on an open channel via sensor devices. To address these issues, many searchable encryption schemes have been presented to provide both data privacy-protection and data searchability. However, due to the use of expensive pairing operations, most previous schemes were inefficient. Recently, a certificateless searchable public-key encryption (CLSPE) scheme was designed by Lu et al. to remove the pairing operation. Unfortunately, we find that Lu et al.'s scheme is vulnerable to user impersonation attacks. To enhance the security, a new pairing-free dual-server CLSPE (DS-CLSPE) scheme for cloud-based IIoT deployment is designed in this paper. In addition, we provide security and efficiency analysis for DS-CLSPE. The analysis results show that DS-CLSPE can resist chosen keyword attacks (CKA) and has better efficiency than other related schemes. [ABSTRACT FROM AUTHOR]

Password-based authenticated key exchange (PAKE) allows participants sharing low-entropy passwords to agree on cryptographically strong session keys over insecure networks. In this paper, we present two PAKE protocols from lattices in the two-party and three-party settings, respectively, which can resist quantum attacks and achieve mutual authentication. The protocols in this paper achieve two rounds of communication by carefully utilizing the splittable properties of the underlying primitive, a CCA (Chosen-Ciphertext Attack)-secure public key encryption (PKE) scheme with associated nonadaptive approximate smooth projection hash (NA-ASPH) system. Compared with other related protocols, the proposed two-round PAKE protocols have relatively less communication and computation overhead. In particular, the two-round 3PAKE is more practical in large-scale communication systems. [ABSTRACT FROM AUTHOR]

Key-policy attribute-based encryption (KP-ABE) is the cryptographic primitive which enables fine grained access control while still providing end-to-end encryption. Although traditional encryption schemes can provide end-to-end encryption, users have to either share the same decryption keys or the data have to be stored in multiple instances which are encrypted with different keys. Both of these options are undesirable. However, KP-ABE can provide less key overhead compared to the traditional encryption schemes. While there are a lot of KP-ABE schemes, none of them simultaneously supports multiuse of attributes, adaptive security, monotone span programs, and static security assumption. Hence, we propose a fully secure KP-ABE scheme for monotone span programs in prime-order group. This scheme uses selective security proof techniques to obtain the requisite ingredients for full security proof. This strengthens the correlation between selective and full security models and enables the transition of the best qualities in selective security models to fully secure systems. The security proof is based on decisional linear assumption and three-party Diffie–Hellman assumption. [ABSTRACT FROM AUTHOR]

The emergence of quantum computing threatens many classical cryptographic schemes, leading to the innovations in public-key cryptography for postquantum cryptography primitives and protocols that resist to quantum attacks. Lattice-based cryptography is considered to be one of the promising mathematical approaches to achieving security resistant to quantum attacks, which could be built on the learning with errors (LWE) problem and its variants. The fundamental building blocks of protocols for public-key encryption (PKE) and key encapsulation mechanism (KEM) submitted to the National Institute of Standards and Technology (NIST) based on LWE and its variants are called key consensus (KC) and asymmetric key consensus (AKC) by Jin et al. They are powerful tools for constructing PKE schemes. In this work, we further demonstrate the power of KC/AKC by proposing two special types of PKE schemes, namely, revocable attribute-based encryption (RABE). To be specific, on the basis of AKC and PKE/KEM protocols submitted to the NIST based on LWE and its variants, combined with full-rank difference, trapdoor on lattices, sampling algorithms, leftover hash lemma, and binary tree structure, we propose two directly revocable ciphertext-policy attribute-based encryption (DR-ABE) schemes from LWE, which support flexible threshold access policies on multivalued attributes, achieving user-level and attribute-level user revocation, respectively. Specifically, the construction of the ciphertext is derived from AKC, and the revocation list is defined and embedded into the ciphertext by the message sender to revoke a user in the user-level revocable scheme or revoke some attributes of a certain user in the attribute-level revocable scheme. We also discuss how to outsource decryption and reduce the workload for the end user. Our schemes proved to be secure in the standard model, assuming the hardness of the LWE problem. The two schemes imply the versatility of KC/AKC. [ABSTRACT FROM AUTHOR]

The rapid development of the Internet of Things has made the issue of privacy protection even more concerning. Privacy protection has affected the large-scale application of the Internet of Things. Fully Homomorphic Encryption (FHE) is a newly emerging public key encryption scheme, which can be used to prevent information leakage. It allows performing arbitrary algebraic operations on data which are encrypted, such that the operation performed on the ciphertext is directly transformed into the corresponding plaintext. Recently, overwhelming majority of FHE schemes are confined to single-bit encryption, whereas how to achieve a multibit FHE scheme is still an open problem. This problem is partially (rather than fully) solved by Hiromasa-Abe-Okamoto (PKC′15), who proposed a packed message FHE scheme which only supports decryption in a bit-by-bit manner. Followed by that, Li-Ma-Morais-Du (Inscrypt′16) proposed a multibit FHE scheme which can decrypt the ciphertext at one time, but their scheme is based on dual LWE assumption. Armed with the abovementioned two schemes, in this paper, we propose an efficient packed message FHE that supports the decryption in two ways: single-bit decryption and one-time decryption. [ABSTRACT FROM AUTHOR]

Functional encryption (FE) can implement fine-grained control to encrypted plaintext via permitting users to compute only some specified functions on the encrypted plaintext using private keys with respect to those functions. Recently, many FEs were put forward; nonetheless, most of them cannot resist chosen-ciphertext attacks (CCAs), especially for those in the secret-key settings. This changed with the work, i.e., a generic transformation of public-key functional encryption (PK-FE) from chosen-plaintext (CPA) to chosen-ciphertext (CCA), where the underlying schemes are required to have some special properties such as restricted delegation or verifiability features. However, examples for such underlying schemes with these features have not been found so far. Later, a CCA-secure functional encryption from projective hash functions was proposed, but their scheme only applies to inner product functions. To construct such a scheme, some nontrivial techniques will be needed. Our key contribution in this work is to propose CCA-secure functional encryptions in the PKE and SK environment, respectively. In the existing generic transformation from (adaptively) simulation-based CPA- (SIM-CPA-) secure ones for deterministic functions to (adaptively) simulation-based CCA- (SIM-CCA-) secure ones for randomized functions, whether the schemes were directly applied to CCA settings for deterministic functions is not implied. We give an affirmative answer and derive a SIM-CCA-secure scheme for deterministic functions by making some modifications on it. Again, based on this derived scheme, we also propose an (adaptively) indistinguishable CCA- (IND-CCA-) secure SK-FE for deterministic functions. The final results show that our scheme can be instantiated under both nonstandard assumptions (e.g., hard problems on multilinear maps and indistinguishability obfuscation (IO)) and under standard assumptions (e.g., DDH, RSA, LWE, and LPN). [ABSTRACT FROM AUTHOR]

Currently, space information network (SIN) has become an increasingly important role in real life. As a large heterogeneous wireless network, SIN can better provide global mobile services to users anytime and anywhere, even in extreme geographic environments. In addition, there is no need to build the communication base-stations every few kilometers on the ground to ensure high service quality, which greatly reduces the construction costs and can be used as an economical communication method in sparsely populated areas. So there is a trend that more and more end users are more likely to get SIN services than traditional terrestrial cellular networks. However, due to the openness and publicity of the satellite wireless channel and the limited resources of the satellite nodes, the privacy and security cannot be perfectly guaranteed and may even be vulnerable to attacks initiated by the adversary such as replay attacks, impersonation attacks, and eavesdropping attacks. To improve the access security of SIN, researchers have proposed a series of authentication protocols based on different cryptographic assumptions. Nevertheless, existing research shows that these protocols cannot meet the requirements of higher and higher security and short authentication delay. In addition, these protocols are mainly based on public key cryptography mechanisms such as DLP and ECDLP, which can be solved by postquantum computers in polynomial time, so these protocols will no longer be secure. To solve the vulnerability of these protocols, in this paper, we propose a new RLWE-based anonymous mutual authentication and key agreement protocol, which guarantees higher security with low computational overhead even in the postquantum era. Detailed security analysis shows that our protocol meets security requirements and is resistant to a variety of known attacks. Besides, combining security comparison and performance analysis, our proposed protocol is more practical than other protocols in SIN. [ABSTRACT FROM AUTHOR]

In the ubiquitous networks, mobile nodes can obtain roaming service that enables them to get access to the services extended by their home networks in the field of foreign network. To provide secure and anonymous communication for legal mobile users in roaming services, there should be a mutual authentication between mobile user and foreign agent with the help of home agent. There are many roaming authentication schemes which have been proposed; however, with the progress of quantum computation, quantum attack poses security threats to many traditional public key cryptography-based authentication schemes; thus, antiquantum attack roaming authentication schemes need to be investigated. On account of the limitation of computational resources for mobile nodes, a lightweight anonymous and antiquantum authentication schemes need to be developed to enable mobile nodes to roam across multiple service domains securely and seamlessly. In consideration of the advantages of lattice in antiquantum, an NTRU-based authentication scheme with provable security and conditional privacy preservation is proposed to remedy these security weaknesses. Compared with the existing scheme, the proposed scheme not only improves efficiency but also can resist the quantum attack. [ABSTRACT FROM AUTHOR]

This study proposes a new image encryption scheme based on a generalized Arnold map and Rivest–Shamir–Adleman (RSA) algorithm. First, the parameters of the generalized Arnold map are generated by an asymmetric encryption-system RSA algorithm, and the keystream is produced iteratively. To change the distribution of pixel values, the image data are hidden by XOR diffusion. Second, both rows and columns of the image are cyclically confused to hide the image data again. Then, the additive mode diffusion operation is performed to realize third-layer hiding for image content. The overall diffusion and confusion operations are conducted twice to obtain the final cipher image. Test results prove that the encryption scheme proposed in this study is effective and has strong antiattack capabilities and key sensitivity. In addition, because the scheme security relies on the RSA algorithm, it has high security. [ABSTRACT FROM AUTHOR]

In this work, we first design a function encryption scheme by using key encapsulation. We combine public key encryption with symmetric encryption to implement the idea of key encapsulation. In the key encapsulation, we use a key to turn a message (plaintext) into a ciphertext by symmetric encryption, and then we use public key encryption to turn this key into another ciphertext. In the design of function encryption scheme, we use the public key encryption system, symmetric encryption system, noninteractive proof system, indistinguishable obfuscator, and commitment scheme. Finally, we prove the indistinguishable security of our function encryption scheme. [ABSTRACT FROM AUTHOR]

In leakage resilient cryptography, there is a seemingly inherent restraint on the ability of the adversary that it cannot get access to the leakage oracle after the challenge. Recently, a series of works made a breakthrough to consider a postchallenge leakage. They presented achievable public key encryption (PKE) schemes which are semantically secure against after-the-fact leakage in the split-state model. This model puts a more acceptable constraint on adversary's ability that the adversary cannot query the leakage of secret states as a whole but the functions of several parts separately instead of prechallenge query only. To obtain security against chosen ciphertext attack (CCA) for PKE schemes against after-the-fact leakage attack (AFL), existing works followed the paradigm of "double encryption" which needs noninteractive zero knowledge (NIZK) proofs in the encryption algorithm. We present an alternative way to achieve AFL-CCA security via lossy trapdoor functions (LTFs) without NIZK proofs. First, we formalize the definition of LTFs secure against AFL (AFLR-LTFs) and all-but-one variants (ABO). Then, we show how to realize this primitive in the split-state model. This primitive can be used to construct AFLR-CCA secure PKE scheme in the same way as the method of "CCA from LTFs" in traditional sense. [ABSTRACT FROM AUTHOR]

Cloud computing is a platform to share the data and resources used among various organizations, but the survey shows that there is always a security threat. Security is an important aspect of cloud computing. Hence, the responsibility underlines to the cloud service providers for providing security as the quality of service. However, cloud computing has many challenges in security that have not yet been addressed well. The data accessed or shared through any devices from the cloud environment are not safe because they are likely to have various attacks like Identity Access Management (IAM), hijacking an account or a service either by internal/external intruders. The cryptography places a major role to secure the data within the cloud environment. Therefore, there is a need for standard encryption/decryption mechanism to protect the data stored in the cloud, in which key is the mandatory element. Every cloud provider has its own security mechanisms to protect the key. The client cannot trust the service provider completely in spite of the fact that, at any instant, the provider has full access to both data and key. In this paper, we have proposed a new system which can prevent the exposure of the key as well as a framework for sharing a file that will ensure security (CIA) using asymmetric key and distributing it within the cloud environment using a trusted third party. We have compared RSA with ElGamal and Paillier in our proposed framework and found RSA gives a better result. [ABSTRACT FROM AUTHOR]

The cloud-assisted Internet of Things (CIoT) is booming, which utilizes powerful data processing capabilities of the cloud platform to solve massive Internet of Things (IoT) data. However, the CIoT faces new security challenges, such as the confidentiality of the outsourced data. Data encryption is a fundamental technique that can guarantee the confidentiality of outsourced data, but it limits target encrypted data retrieval from cloud platform. Public key encryption with keyword search (PEKS) provides a promising solution to address this problem. In PEKS, a cloud server can be authorized to search the keyword in encrypted documents and retrieve associated encrypted documents for the receiver. However, most existing PEKS schemes merely focus on keyword search function while ignoring the associated documents encryption/decryption function. Thus, in practice, a PEKS scheme must cooperate with another separated public key encryption (PKE) scheme to fulfill a completely secure data sharing scheme. To address this problem, in this paper, we propose a secure data sharing scheme with designated server that combines PKE scheme with PEKS scheme, which provides both keyword search and documents encryption/decryption functions. Furthermore, only the designated server can search the keyword via encrypted documents for enhanced security in our work. Moreover, our scheme also satisfies the public verifiability of search results, which includes both keywords and documents ciphertexts' correctness and integrity. As to the security, our scheme provides stronger indistinguishability security of document and keyword in the proposed security model. [ABSTRACT FROM AUTHOR]

Among cryptographic systems, multivariate signature is one of the most popular candidates since it has the potential to resist quantum computer attacks. Rainbow belongs to the multivariate signature, which can be viewed as a multilayer unbalanced Oil-Vinegar system. In this paper, we present techniques to exploit Rainbow signature on hardware meeting the requirements of efficient high-performance applications. We propose a general architecture for efficient hardware implementations of Rainbow and enhance our design in three directions. First, we present a fast inversion based on binary trees. Second, we present an efficient multiplication based on compact construction in composite fields. Third, we present a parallel solving system of linear equations based on Gauss-Jordan elimination. Via further other minor optimizations and by integrating the major improvement above, we implement our design in composite fields on standard cell CMOS Application Specific Integrated Circuits (ASICs). The experimental results show that our implementation takes 4.9 us and 242 clock cycles to generate a Rainbow signature with the frequency of 50 MHz. Comparison results show that our design is more efficient than the RSA and ECC implementations. [ABSTRACT FROM AUTHOR]

Advanced modern processors support single instruction, multiple data instructions (e.g., Intel-AVX and ARM-NEON) and a massive body of research on vector-parallel implementations of modular arithmetic, which are crucial components for modern public-key cryptography ranging from Rivest, Shamir, and Adleman (RSA), ElGamal, Digital Signature Algorithm (DSA), and elliptic curve cryptography, have been conducted. In this paper, we introduce a novel double operand scanning method to speed up multi-precision squaring with non-redundant representations on single instruction, multiple data architecture where the part of the operands are doubled to compute the squaring operation without read-after-write dependencies between source and destination variables. Afterwards, Karatsuba algorithm is applied to both multiplication and squaring operations. For modular multiplication, separated Montgomery algorithm is chosen. Finally, the Rivest, Shamir, and Adleman (RSA) implementations outperform the best-known results on the ARM-NEON platforms. Copyright © 2017 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Cryptography is used for secure communication since ancient days for providing confidentiality, integrity and availability of the information. Public key cryptography is a classification of cryptography having pair of keys for encryption and decryption. Public key cryptography provides security and authentication using several algorithms. The Rivest-Shamir -Adleman (RSA) algorithm is prominent since its inception and is widely used. Several modified schemes were introduced to increase security in the RSA algorithm involving additional complexity. In this paper, we introduce a generalized algorithm over RSA that is advanced, adaptable and scalable in using a number of primes. Our algorithm uses 2k prime numbers with secure key generation involving additional complexity, making it computationally infeasible to determine decryption key. A user can use 4, 8, 16, 32, ... (2k) prime numbers for generating public and private components securely. In our algorithm, public key and private key components are generated by making use of N, where N is a function of 2k prime numbers. When an attacker obtains a public key component n out of {E, n} by using factorization techniques such as general number field sieve or elliptic curve factorization, he or she can only obtain two initial prime numbers (because n is a product of the first two prime numbers). However, finding the remaining prime numbers is computationally infeasible as no relevant information is available to the attacker. Hence, it is difficult for the attacker to determine the private key component D out of {D, n} knowing the public key component {E, n}. Thus, it is practically impossible to break our system using a brute force attack. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]