Email is one of the most commonly utilized communication methods. The confidentiality, the integrity and the authenticity are always substantial in communication of the e-mail, mostly in the business utilize. However, these security goals can be ensured only when the cryptography is utilized. Cryptography is a procedure of changing unique data into a configuration with the end goal that it is just perused by the coveted beneficiary. It is utilized to shield data from other individuals for security purposes. Cryptography algorithms can be classified as symmetric and asymmetric methods. Symmetric methods can be classified as stream cipher and block cipher. There are different operation modes provided by the block cipher, these are Cipher Block Chaining (CBC), Output Feedback (OFB), Cipher Feedback (CFB) and Electronic Code Block (ECB). CBC used to complex the cryptographic systems, by using Initialization Vector (IV), Xoring, and encryption with specified key over chain of blocks, but CBC is vulnerable to chosen plaintext attack because the IV is static and vulnerable to chosen ciphertext attack because the encryption method with the key are static. This paper introduce a proposed E-mail messages encryption systems , the proposal based on modified CBC mode operation hybrid with some of techniques exploited in the encryption such as RADG, DNA, RNA and a suggested permutation methods. The proposed modifications applied on the CBC are generate IV randomly, generate key randomly, and propose encryption method, these modifications proposed to avoid the attacks that CBC is vulnerable to.
Elliptic Curve Cryptography (ECC) is one of the public key cryptosystems that works based on the algebraic models in the form of elliptic curves. Usually, in ECC to implement the encryption, the encoding of data must be carried out on the elliptic curve, which seems to be a preprocessing step. Similarly, after the decryption a post processing step must be conducted for mapping or decoding the corresponding data to the exact point on the elliptic curves. The Memory Mapping (MM) and Koblitz Encoding (KE) are the commonly used encoding models. But both encoding models have drawbacks as the MM needs more memory for processing and the KE needs more computational resources. To overcome these issues the proposed enhanced Koblitz encodi
... Show More
With the wide developments of computer applications and networks, the security of information has high attention in our common fields of life. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is widely accepted due to its strong encryption, and complex processing as well as its resistance to brute force attack. The proposed modifications are implemented by encryption and decryption Rijndael
... Show MoreIn every system of security, to keep important data confidential, we need a high degree of protection. Steganography can be defined as a way of sending confidential texts through a secure medium of communications as well as protecting the information during the process of transmission. Steganography is a technology that is used to protect users' security and privacy. Communication is majorly achieved using a network through SMS, e-mail, and so on. The presented work suggested a technology of text hiding for protecting secret texts with Unicode characters. The similarities of glyphs provided invisibility and increased the hiding capacity. In conclusion, the proposed method succeeded in securing confidential data and achieving high p
... Show More
(3)
(3)
With the development of information technology and means for information transfer it has become necessary to protect sensitive information. The current research presents a method to protect secret colored images which includes three phases: The first phase calculates hash value using one of hash functions to ensure that no tampering with or updating the contents of the secret image. The second phase is encrypting image and embedding it randomly into appropriate cover image using Random Least Significant Bit (RLSB) technique. Random hiding provides protection of information embedded inside cover image for inability to predict the hiding positions, as well as the difficult of determining the concealment positions through the analysis of im
... Show MoreThis paper presents a new RGB image encryption scheme using multi chaotic maps. Encrypting an image is performed via chaotic maps to confirm the properties of secure cipher namely confusion and diffusion are satisfied. Also, the key sequence for encrypting an image is generated using a combination of 1D logistic and Sine chaotic maps. Experimental results and the compassion results indicate that the suggested scheme provides high security against several types of attack, large secret keyspace and highly sensitive.
Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.
(10)
(2)
(3)
(1)
This paper introduces a relationship between the independence of polynomials associated with the links of the network, and the Jacobian determinant of these polynomials. Also, it presents a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network. This model is also represented through a combination of polynomial equations and uses Groebner bases to reach a new simplified network equivalent to the given network, which may make studying the ability to solve the problem of network coding less expensive and much easier.
This research aims to solve the nonlinear model formulated in a system of differential equations with an initial value problem (IVP) represented in COVID-19 mathematical epidemiology model as an application using new approach: Approximate Shrunken are proposed to solve such model under investigation, which combines classic numerical method and numerical simulation techniques in an effective statistical form which is shrunken estimation formula. Two numerical simulation methods are used firstly to solve this model: Mean Monte Carlo Runge-Kutta and Mean Latin Hypercube Runge-Kutta Methods. Then two approximate simulation methods are proposed to solve the current study. The results of the proposed approximate shrunken methods and the numerical
... Show More
(1)