This is probably obfuscation, not encryption about stringencrypt-python

[PELock]

Thank you for you kind words, read this if you want to learn more about poly engines in HLL https://www.pelock.com/articles/polymorphic-encryption-algorithms

[PELock]

It generates a list of pseudo VM encryption opcodes (and optional encryption keys), does the encryption running the VM code on the data, reverses the list of pseudo VM opcodes and generates output, really simple, I did it for fun mostly, I don't make much money from it, but I like the challenge of adding new languages and new features.

[PELock]

I don't know what to say honestly. So I won't :)

[54754N4]

It's still a good project x'] Made me want to try to write my own string obfuscator as well, so no offense intended! I really enjoyed your polymorphic masm32 project which I was trying to learn from, so thanks already for these amazing contributions!

[54754N4]

I was actually reading that today hehe but didn't finish it yet, so thanks for that as well! I stopped to read more about the AsmJit library, but will definitely finish =p The visual studio extension article that you wrote had a section on how "StringEncrypt" works which gave me the idea that the code can be reversed
Either way feel free to close this issue or delete it, thanks for your feedback !

[PELock]

Well, the decryption code is doing that :D, so I don't know what you want to reverse.

[54754N4]

Well, the decryption code is doing that :D, so I don't know what you want to reverse.

By reverse I meant understanding what StringEncrypt was doing x'] my bad haha

[54754N4]

For encryption opcodes, perhaps adding modulo and modulus inverses can be feasible? Might have to generate a bigger decryption routine (since languages don't support modulus inverses out of the box) but seems somewhat fun to add
Edit: i just tried it, you can easily add them without making the decryption routine too big, you simply calculate the mod inverse during encryption. Example:
let c the be char code point or ascii value and the a random number while b being the mod inverse and m some modulo where (a*b)%m==1
During encryption you compute z=(a*c)%m and in the decryption routine: (z*b)%m = (a*b*c)%m = c