MODIV: A Proposed Method for Data Encryption

Abstract

Starting from the principle of computer security that branched to many fields, whereas the encryption is one from, therefore this paper focused on a new idea of data encryption, it depends on modular and integer division operations, and then will produce two numbers, first one represents the result of (MOD operation), second one represents the result of (DIV operation), and then these two numbers and the secret key will be used within the two functions to produce an encrypted file. The proposed method will use one symmetric key to encrypt the plaintext, also there is another proposed elementary level of encryption depends on substitution technique, Finally this paper includes explanation of how the data will be encrypted and decrypted using the idea of (MODULAR and DIVISION), also include some results, computations, the proposed algorithm. This technique will be named as (MODIV) method