RES: Randomized Encryption Standard

Description

RES is a simple symmetric key encryption algorithm designed to encrypt using randomization. It uses a hashing algorithm to generate random numbers from the input key. Then it goes through 3 stages of ciphers before before using key block encryption. This algorithm uses 128, 256, and 512 char blocksizes

Table of Contents

• Installation
• Usage
• Other Notes
• Examples
• License

Installation

This algorithm uses no requirements and can be installed by simply cloning the repo.

git clone https://github.com/harbingeroffire/RES.git

USAGE

Example For encrypting and decrypting using RES:

import RES

#Example for RES-128
key=b"key"
cipher=RES.Cipher("RES-128", key)

#encrypt
ciphertext=cipher.encrypt(b"buffer")
print("Encrypted Text: ", ciphertext)

#decrypt
plaintext=cipher.decrypt(ciphertext)
print("Decrypted Text: ", plaintext)

Other Notes

The code also has a built in function to encrypt and decrypt files using fencrypt() and fdecrypt() as well as outputing the encryption in hexadecimal using hencrypt() and hdecrypt(). Conviently I also combined them to encrypt and decrypt files with hexadecimal with hfencrypt() and hfdecrypt().

License

MIT License, you all know what that is.