Public Cryptosystem Research Articles

A new public key cryptosystem based on the non-commutative ring R

In this paper, we present a new public cryptosystem based on one of the most problems (word problem, solving a non-linear system problem, integer factorization problem and discrete logarithm problem,...) is the conjugal classical problem (CCP) over a non commutative ring. In generally this cryptosystem is very difficult to solve for decipher. Firstly, by using the elliptic curve over the finite ring Fq[e], where e4 = e3, with q = pd and p is prime number greater than or equal to 5, d ϵ ℕ* [12] we define the non-commutative ring R. Secondly, by using the protocol of Diffie-Hellman [4] we have proposed a novel encryption scheme on R and we study the problem CCP over it. Precisely, we will make a new fully homomorphic encryption scheme over the ring R based on the two difficult problems; conjugal classical problem and discrete logarithm problem.

Resilience Optimization of Post-Quantum Cryptography Key Encapsulation Algorithms

Recent developments in quantum computing have shed light on the shortcomings of the conventional public cryptosystem. Even while Shor’s algorithm cannot yet be implemented on quantum computers, it indicates that asymmetric key encryption will not be practicable or secure in the near future. The NIST has started looking for a post-quantum encryption algorithm that is resistant to the development of future quantum computers as a response to this security concern. The current focus is on standardizing asymmetric cryptography that should be impenetrable by a quantum computer. This has become increasingly important in recent years. Currently, the process of standardizing asymmetric cryptography is coming very close to being finished. This study evaluated the performance of two PQC algorithms, both of which were selected as NIST fourth-round finalists. The research assessed the key generation, encapsulation, and decapsulation operations, providing insights into their efficiency and suitability for real-world applications. Further research and standardization efforts are required to enable secure and efficient post-quantum encryption. When selecting appropriate post-quantum encryption algorithms for specific applications, factors such as security levels, performance requirements, key sizes, and platform compatibility should be taken into account. This paper provides helpful insight for post-quantum cryptography researchers and practitioners, assisting in the decision-making process for selecting appropriate algorithms to protect confidential data in the age of quantum computing.

A type of public cryptosystem using polynomials and pell sequences

In this paper, a kind of Public key Cryptosystem is established using Polynomials and Pell sequences by exploiting the properties of both Polynomials and Pell sequences by converting Polynomial into Octal and Binary system. Securing the digital data and modifying it by using modern Cryptographic methods that plays a vital role in Network Security.

Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”

In [1], Kumar et al. proposed an enhanced and secured RSA public key cryptosystem (ESRPKC) algorithm using Chinese remainder theorem. In their scheme, the public key is defined as (N,e,μ) where N is the product of four distinct large prime numbers, e is a public exponent, and μ is a parameter called encryption key to encrypt the message. Compared to the traditional RSA cryptosystem, the authors used the extra parameter μ, and claimed that security increased due to this extra parameter. They claimed that it is required to use a brute force attack to break the system even if the number N is factorized by an adversary to obtain the private parameters k1 and k2 which are components of μ. The authors claimed that ESRPKC is a highly secure and not easily breakable scheme compared to the traditional RSA scheme.In this paper, we do a cryptanalysis on Kumar et al.'s scheme given in [1] and demonstrate some major security weaknesses. We prove that if N is factorized, there is no need to use brute force to break the system. Additionally, choosing four prime numbers instead of two prime numbers decreases the security significantly and only increases the computation time. Therefore, the proposed system (ESRPKC) is not as efficient as the traditional RSA algorithm.

Quantum logistic image encryption algorithm based on SHA-3 and RSA

This study proposes a quantum logistic image encryption algorithm based on the Rivest–Shamir–Adleman (RSA) and secure hash (SHA-3) algorithms. First, the asymmetric encryption algorithm RSA is used to randomly generate key pairs with private key and public key. A fixed matrix is then produced to confuse the plain image by additive modular operation and get preprocessed image. Second, the preprocessed image is computed by the hash function SHA-3 to obtain the plain message that is then stored secretly. Using RSA algorithm, the cipher message can be obtained corresponding to the plain message. After combining both the plain and cipher messages, the initial conditions of the quantum logistic map are calculated using a new mathematical model. Random keystream can then be generated from the quantum logistic map. Third, the keystream is further employed to cyclically confuse row and column pixels in the preprocessed image with different directions. Then, diffusion operations to odd row and odd column are carried out followed by even row and column, respectively. Finally, the cipher image can be reconstructed by both inverse cyclic confusion and inverse diffusion to each row and column. The test results show that the algorithm has strong plaintext sensitivity and key sensitivity as well as an enhanced ability to resist various cryptographic attacks. Therefore, the proposed algorithm is suitable for secure communication of network image in conjunction with a public cryptosystem.

Non-Invertible Public Key Certificates.

Post-quantum public cryptosystems introduced so far do not define a scalable public key infrastructure for the quantum era. We demonstrate here a public certification system based on Lizama’s non-invertible key exchange protocol which can be used to implement a secure, scalable, interoperable and efficient public key infrastructure (PKI). We show functionality of certificates across different certification domains. Finally, we discuss a method that enables non-invertible certificates to exhibit perfect forward secrecy (PFS).

A centralized key management scheme for space network with resistance of nonlinear channel noise

The channel noise in space is nonlinear and pseudorandom so that the efficiency and security of existing group key management schemes are constrained seriously. To solve these problems, we proposed a centralized and identity-based key management scheme by using McEliece public key cryptosystem. In this scheme, the node identity is used as the parameter to generate the public key. Thus the authentication can be embedded into the verification of the public key. The group key is distributed with the protection of public key so that it can be implemented safely. Furthermore, the error correction capacity provided by McEliece public cryptosystem can eliminate the disturbance of noise. It transfers the negative influence caused by pseudorandom noise to an enhancement of security and increases the efficiency of the group key distribution over the noisy channel. The security of public key generation, forward secrecy and backward secrecy is analyzed. The performance is analyzed and compared with other schemes. The error correction capacity is simulated. The results show that our scheme can provide confidentiality, integrity, authentication, non-repudiation, failure tolerance and error correction with lower computation overhead and interaction rounds.

Geo Security using GPT Cryptosystem

This paper describes an implementation of location-based encryption using a public key cryptosystem based on the rank error correcting codes. In any code based cryptosystem, public and private keys are in the form of matrices based over the finite field. This work proposes an algorithm for calculating public and private key matrices based on the geographic location of the intended receiver. The main idea is to calculate a location specific parity check matrix and then corresponding public key. Data is encrypted using public key. Some information about the parity check matrix along with other private keys are sent to receiver as cipher-text, encrypted with another instance of the public or GPT cryptosystem using public key of the receiver. The proposed scheme also introduces a method of calculating different parity check matrix for each user.

Choosing a Suitable Public Cryptosystem for Internet of Things

The Internet of Things (IoT) has ushered in numerous devices in many areas in our life and in industries. It could comprise devices with sensors to gather and broadcast data over the internet. As the devices are IP-based and the media are shared, any user in the network can have an access to the communication contents. The only way to impose access control in the sensor networks is through cryptography. A key is applied to encrypt the communication to prevent from unauthorized access to the network. Choosing a suitable key management scheme is very important in sensor networks as it should satisfy the constraints of the sensors. There are two indispensable public cryptosystems available in the literatures-RSA and Elliptic curve cryptography (ECC). ECC gives strong resistance to cryptanalytic attacks. So, it is used with smaller key sizes than RSA (Valenta, L., et al., 2018. In Search of CurveSwap: Measuring Elliptic Curve Implementations in the Wild. 2018 IEEE European Symposium on Security and Privacy (EuroS&P), April; IEEE. pp.384–398). The most prettiness of using elliptic curve cryptography over other cryptosystems (i.e., RSA) is that it provides same security strength for a lesser key without breaching the system, thereby consuming less resources and ameliorating performances and fast data throughput of the devices. To choose a suitable public cryptosystem for use in IoT devices like sensor networks, elliptic curve cryptography and RSA are comparatively analyzed in this paper.

Block Cipher Based Public Key Encryption via Indistinguishability Obfuscation

The article is devoted to generation techniques of the new public key crypto-systems, which are based on application of indistinguishability obfuscation methods to selected private key crypto-systems. The techniques are applied to symmetric key crypto-system and the target system is asymmetric one. As an input for our approach an implementation of symmetric block cipher with a given private-key is considered. Different obfuscation methods are subjected to processing. The target system would be treated as a public-key for newly created public crypto-system. The approach seems to be interesting from theoretical point of view. Moreover, it can be useful for information protection in a cloud-computing model.

Mutual Heterogeneous Signcryption Schemes for 5G Network Slicings

With the emerging of mobile communication technologies, we are entering the fifth generation mobile communication system (5G) era. Various application scenarios will arise in the 5G era to meet the different service requirements. Different 5G network slicings may deploy different public key cryptosystems. The security issues among the heterogeneous systems should be considered. In order to ensure the secure communications between 5G network slicings, in different public cryptosystems, we propose two heterogeneous signcryption schemes which can achieve mutual communications between the Public Key Infrastructure (PKI) and the CertificateLess public key Cryptography (CLC) environment. We prove that our schemes have the INDistinguishability against Adaptive Chosen Ciphertext Attack (IND-CCA2) under the Computational Diffie-Hellman Problem (CDHP) and the Existential UnForgeability against adaptive Chosen Message Attack (EUF-CMA) under the Discrete Logarithm Problem (DLP) in the random oracle model. We also set up two heterogeneous cryptosystems on Raspberry Pi to simulate the interprocess communication between different public key environments. Furthermore, we quantify and analyze the performance of each scheme. Compared with the existing schemes, our schemes have greater efficiency and security.

Oblivious Transfer Based on NTRUEncrypt

Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract. However, since most implementations of the Internet of Things are time-sensitive, existing works that are based on traditional public cryptosystems are not efficient or secure under quantum machine attacks. In this paper, we argued that the fastest known 1-out-of-n oblivious transfer ( ${\mathrm {OT}}_{n}^{1}$ ) protocol, which was proposed by Chou, cannot achieve semantic security and is time-consuming due to exponent arithmetic of large parameters. Utilizing NTRUEncrypt and OT extension, we devised a one-round post-quantum secure ${\mathrm {OT}}_{n}^{1}$ protocol that is also proved to be active and adaptively secure under the universal composability framework. Compared with Chou’s protocol, the computational overheads of our scheme are approximately 6 and 1.7 times smaller on the sender and receiver sides, in line with the standard security level.

Digital Image Encryption Algorithm Based on Elliptic Curve Public Cryptosystem

With the increasing use of media in communications, the content security of digital images attracts much attention in both the academia and the industry. Meanwhile, for the symmetric cryptosystem, the key transmission and management is burden on users. This paper proposes an asymmetric image encryption algorithm based on an elliptic curve cryptosystem (ECC). The sender and the recipient agree on an elliptic curve point based on the Diffie–Hellman public key sharing technique. First, to reduce the encryption times, the sender groups pixel values together and converts them into big integers. Second, the sender encrypts big integers with ECC and the chaotic system. Finally, the encrypted image is obtained from encrypted big integers. The proposed algorithm makes the key transmission and management relatively simple and secure. Simulation data show that the proposed algorithm exhibits both the strong security and the high efficiency.

A new cluster-based secure communication scheme for mobile ad hoc networks

Mobile ad hoc networks have attracted considerable interest because of their use by the military and emergency rescue personnel as well as in mining operations and vehicular networks. However, mobile ad hoc networks are more vulnerable to security attacks than other types of wireless networks, such as wireless local area network or 3G/LTE networks. As a countermeasure to attack, clustering is used, where each node must be authenticated with the corresponding clusterhead in the cluster, and all data must be encrypted. In this paper, a new cluster-based secure communication scheme is proposed in which mutual authentications are performed before data transmission. In contrast to conventional schemes that use public key infrastructure cryptosystems, resulting in serious overheads in terms of computation and communication, our authentication process uses a station-to-station protocol, which is in itself an extended version of the Diffie-Hellman key exchange protocol to establish authenticated context. Moreover, attacks like replay attacks and man-in-the-middle attacks can be prevented by additional security mechanisms in the authentication and communication processes such as hash-function message authentication codes. Our proposed scheme not only meets all the security requirements, but also supports efficient communication. Performance analysis demonstrates the superiority of our scheme to related schemes.

A Robust and Secure Lightweight Authentication for the Limited Resource Wireless Ad-hoc Network

Objectives: The proposed security model is specifically designed to increase the level of the security by implementing the node integrity verification and data encryption service over the wireless ad-hoc networks. Methods/Statistical Analysis: The proposed security and authentication model has been defined using the 8 bytes to 16 bytes length based variable key length authentication scheme, which is difficult to predict and cryptanalysis attacks, as there is no uniform mechanism to perform the cryptanalysis attack over the authentication data during the exchange or propagation in the wireless ad-hoc networks. Findings: In this paper, we have proposed the public cryptosystem based encryption for light and secure authentication scheme, which utilizes the RSA encryption as the public cryptosystems. The proposed security and authentication model has been deeply analyzed to protect against the variety of attacks using the primary parameter of authentication delay and data loss. This model has been analyzed over the three primary attacks for the resource jamming, which includes the Distributed Denial of Service (DDoS), selective jamming, and black hole attacks for the data dropping and jamming attacks. The proposed authentication and security model for wireless ad-hoc routing has been analyzed for its performance on the basis of the specific performance parameters. The robust and flexible performance of security and authentication based proposed model has been deeply observed from the versatile results obtained from the all paradigms of the simulation. Application/Improvements: The light weight and robust authentication based security mechanism has been proposed for the higher order suitability to serve the specific purpose of security against the attacks over the wireless networks.

Light Weight Secure Key Generation Protocol with Hidden Generator Point using ECC

Key generation and distribution is one of the most important primitive of any security framework. This is irrespective of using a symmetric or asymmetric cryptosystem. However, while securing a WSN, its resource constraint nature cannot be ignored. Therefore Elliptical Curve Cryptography (ECC) based solutions like Elliptical Curve Digital Signature algorithm (ECDSA), Elliptical Curve Diffie-Hellman (ECDH) are becoming more and more popular in comparison to other Public crypto system like RSA. In ECC, the Generator point is treated as a public parameter along with other domain parameters. This can make communication within the WSN vulnerable to man-in-the-middle attack. The attack can be thwarted by keeping the Generator point Private and still be able to establish a common Generator Point across communication parties .It will result in establishing a light weight secure key between a sender and a receiver and achieve other security primitives like generation of MAC and Node identification. This paper discusses and analyses the generation of Shared keys using 1 hidden generator point in comparison to 2- hidden point generator and the conventional ECDH method.

Chaotic Maps for Biometric Template Protection-A Proposal

Modern biometric technologies claim to provide alternative solution to traditional authentication processes. Even though there are various advantages of biometric process, it is vulnerable to attacks which can decline its security. Towards addressing these concerns and improving public confidence, Biometric Cryptosystems and Cancelable Biometrics represent emerging technologies. This paper presents a comprehensive survey of Biometric Cryptosystems and Cancelable Biometrics along with the open issues and challenges. A new approach is proposed to address these open issues and challenges based on Cancellable Biometrics using chaotic maps, which are known to posses desirable properties of pseudo randomness, high sensitivity to initial conditions and very large key space.

Cocks' ID-based Scheme 기반 문턱 암호화 기술

Since one of weak points of public crypto-systems is to require the verification of public key, identity based crypto-systems were proposed as an alternative. However, such techniques need a private key generator which can be a single point of failure. To improve such weakness, threshold identity-based crypto-systems were proposed. In this paper, we propose a new threshold identity-based encryption scheme which is constructed to extend an identity-based encryption scheme by Cocks. Since the proposed scheme is based on quadratic residues, it has smaller complexity of encryption. And we prove that the proposed scheme is secure against a chosen identity attack.

Comment on an Enhanced RSA-Based Partially Blind Signature

Hwang et al. showed that the Chien et al.'s partially blind signature scheme based on RSA public cryptosystem could not meet the untraceability property of a blind signature. Wen et al. and Wu et al. claimed that Hwang et al.'s attack is incorrect. Later, Fang et al. gave an improvement to against Hwang et al.'s method. In this paper, we pointed out some typographical errors in Wen et al. and Wu et al.'s article; and certained their claims are correction. Thus, the Fang et al. improved scheme may not becomes to be necessary. Chien et al.'s partially blind signature scheme is still satisfy the untraceability property.

Spiking Neurons With ASNN Based-Methods for the Neural Block Cipher

Problem statement: This paper examines Artificial Spiking Neural Network (ASNN) which inter-connects group of artificial neurons that uses a mathematical model with the aid of block cipher. The aim of undertaken this research is to come up with a block cipher where by the keys are randomly generated by ASNN which can then have any variable block length. This will show the private key is kept and do not have to be exchange to the other side of the communication channel so it present a more secure procedure of key scheduling. The process enables for a faster change in encryption keys and a network level encryption to be implemented at a high speed without the headache of factorization. Approach: The block cipher is converted in public cryptosystem and had a low level of vulnerability to attack from brute, and moreover can able to defend against linear attacks since the Artificial Neural Networks (ANN) architecture convey non-linearity to the encryption/decryption procedures. Result: In this paper is present to use the Spiking Neural Networks (SNNs) with spiking neurons as its basic unit. The timing for the SNNs is considered and the output is encoded in 1’s and 0’s depending on the occurrence or not occurrence of spikes as well as the spiking neural networks use a sign function as activation function, and present the weights and the filter coefficients to be adjust, having more degrees of freedom than the classical neural networks. Conclusion: In conclusion therefore, encryption algorithm can be deployed in communication and security applications where data transfers are most crucial. So this paper, the neural block cipher proposed where the keys are generated by the SNN and the seed is considered the public key which generates the both keys on both sides In future therefore a new research will be conducted on the Spiking Neural Network (SNN) impacts on communication.