MODIV: A Proposed Method for Data Encryption | Zendy

Qusay Alsaadi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MODIV: A Proposed Method for Data Encryption

Author(s) -

Qusay Alsaadi

Publication year - 2021

Publication title -

journal of al-rafidain university college for sciences ( print issn 1681-6870 online issn 2790-2293 )

Language(s) - English

Resource type - Journals

eISSN - 2790-2293

pISSN - 1681-6870

DOI - 10.55562/jrucs.v27i1.402

Subject(s) - encryption , plaintext , computer science , key (lock) , filesystem level encryption , integer (computer science) , symmetric key algorithm , division (mathematics) , theoretical computer science , modular arithmetic , probabilistic encryption , modular design , on the fly encryption , multiple encryption , deterministic encryption , cryptography , arithmetic , algorithm , mathematics , public key cryptography , computer security , programming language

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research