ALERT!
Click here to register with a few steps and explore all our cool stuff we have to offer!
Home
Upgrade
Credits
Help
Search
Awards
Achievements
 1958

[Question] ENC_SEED | ENC_VAR

by GHOSTED - 03-27-2020 - 12:20 PM
#1
can anyone explain me what this does?
i'm confused with it.


[Image: VAUV4VY.png]
DISCORD: xexghosted
Reply
#2
it is a encryption method but it ant that good
Reply
#3
Very poor encryption method, even on compile the raw data is still visible. If you're going to try and encrypt variables I'd suggest incremented XOR, AES or (if you can) write your own multi-layer encryption method.
Reply
#4
(03-27-2020 - 06:15 PM)ChrissyBoy Wrote: Very poor encryption method, even on compile the raw data is still visible. If you're going to try and encrypt variables I'd suggest incremented XOR, AES or (if you can) write your own multi-layer encryption method.
the reason you can still see the data is because the encryption method is in the source it need to be in a tool and the decrypt rewite a tiny bit different
Reply
#5
(03-27-2020 - 05:36 PM)Venom_Modz Wrote: it is a encryption method but it ant that good

simple say its useless?
DISCORD: xexghosted
Reply
#6
its just another meme serves no real purpose and it doesnt even look good
Add my Discord Kiwi2014566#9755
Reply
#7
Its just a function to XOR an address and then another to decrypt the XOR on the address, seen this in a gtav menu before.
Reply
#8
i bet giths just did this to hide it from people
This account is currently banned
Ban reason: Multi
Reply
#9
(03-30-2020 - 04:30 AM)local_hookah Wrote: i bet giths just did this to hide it from people
I don't think he'd do something like that, the guy hates macros.

This is a pretty shitty way of doing XOR, if you want a half decent method of XOR you could do what I like to call 'incremental XOR' which does exactly what it says and increments the XORKey by 'x' each time it encrypts a byte. You could go even further and do quadword HighMidLow key splits but that's for another day. I have left an example of incremental xor below, it's not the best and there's a lot more you can do besides increment by 1 but it's a start.

Code:
void _incremental_xor(byte* array, int arraysize, byte basekey)
{
for (int i = 0x00; i < arraysize; i++)
{
byte xorkey = (basekey + (i * 0x01));
array[i] ^= xorkey;
}
}
Reply
#10
thanks dude man. awesome
Reply

Users browsing: 9 Guest(s)