Asymmetric Confidentiality in Blockchain Embedded Smart Grids in Galois Field

Economic growth requires a sharp increase in the utilization of energy. Since the initial mechanical era, financial development has been driven by industrialization, transportation, and, most important of all, electrification, majorly achieved by petroleum product ignition. This way of development has had malicious and abusive aftershocks on the environment since the beginning. Smart grids are an idea to slightly diminish the burden on our Mother Nature, but this idea is getting tainted by the anticipation of ferocious technophiles who may try to get the grid down using quantum computers in the coming years. Thus, security becomes one of the major concerns for the smart grid. In this paper, we propose a quantum-resistant framework for associating smart grids and blockchain embedded with a permutation-substitution-based public-key cryptosystem in Galois Field to prevent unauthorized access and perform encryption of the private information of the user and consumption statistics. Permutation and substitution are performed to increase the diffusion and confusion of the data. Expenditures are quantified from the dissipation particulars, and the payment of electricity bill is performed using our blockchain wallet. The prediction model of consumption data is generated availing stochastic gradient descent. The performance analysis of the proposed cryptosystem is predicted after a simulation of the smart grid.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

A Public Key Cryptosystem Using Cyclotomic Matrices

Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this chapter, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the formulation of cyclotomic matrices correspond to a diophantine system. The strategy uses in cyclotomic matrices to design a one-way function. The result of a one-way function that is efficient to compute, however, is hard to process its inverse except if privileged information about the hidden entry is known. Also, we demonstrate that encryption and decryption can be efficiently performed with the asymptotic complexity of Oe2.373. Finally, we study the computational complexity of the cryptosystem.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

Comparison and intelligent analysis of NTRU and ETRU signature algorithms for public key digital signature

Three American mathematicians made the NTRU public-key cryptosystem in 1996, it has a fast speed, small footprint, and also it is easy to produce key advantages. The NTRU signature algorithm is based on an integer base, the performance of the signature algorithm will change when the integer base becomes other bases. Based on the definition of “high-dimensional density” of lattice signatures, this paper chooses the ETRU signature algorithm formed by replacing the integer base with the Eisenstein integer base as a representative, and analyzes and compares the performance, security of NTRU and ETRU signature algorithms, SVP and CVP and other difficult issues, the speed of signature and verification, and the consumption of resources occupied by the algorithm.

MSB BASED IMAGE STEGANOGRAPHY USING MCELIECE CRYPTOSYSTEM

Steganography is the science of embedding secret data inside data so they can be sent to destination security. Encryption algorithms used to save information from sly activities when sent from one device to another over the wireless network. In this paper McEliece will be used to text encryption by Goppa code, where McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes; then embedding the ciphertext as steganography image by MSB method. This lead to save information from attackers.