RSME: A Reactive Stability Mutation Encryption Algorithm for Active Defense and Lightweight Cybersecurity

def rsme_encrypt(data, Y, P, S, M):
    # Formula: C = [(((Data * Y) - P) + Y) XOR S] MOD M
    # k = restoration constant (integer quotient)
    pre_mod = (((data * Y) - P) + Y) ^ S
    c = pre_mod % M
    k = pre_mod // M
    return c, k

def rsme_decrypt(c, k, Y, P, S, M):
    # Reverse Formula: Data = ([(C + (k * M)) XOR S] - Y + P) / Y
    x_restored = (c + (k * M)) ^ S
    data = (x_restored - Y + P) / Y
    return int(data)

# --- QUICK TEST ---
# Parameters Example:
Y, P, S, M = 5, 10, 7, 100
input_val = 123

# Encrypting
cipher, k_val = rsme_encrypt(input_val, Y, P, S, M)
print(f"Encrypted Ciphertext (C): {cipher}")
print(f"Restoration Constant (k): {k_val}")

# Decrypting
original = rsme_decrypt(cipher, k_val, Y, P, S, M)
print(f"Decrypted Result: {original}")

The Python code is just a functional demonstration of the logic. The goal is to implement this in low-level C for IoT devices.