crypter | shellcode crypto-packing tool | Encryption library

ok i find a way to do it i insert this line of code inside my function and i can save a .txt file on the desktop. ''' def summit(): f = filedialog.asksaveasfile(mode='w', defaultextension=".txt") if f is None: return text2save = nameit(str(entry_text.get(1.0, END))) f.write(text2save) f.close() '''

You don't format at all, just write raw bytes. You are reading raw bytes using

The Manifest gets merged too early for the actual theme implementation to be available on the user's device.

You can add this to your base module's styles.xml:

if input restricted to [0..9] (as code shows at the moment of the answer) then it will work: encryption of 8 is (8 + 7) % 10 = 5. Decryption is 10 + 5 - 7 = 8. your custom algorithm in general: encryption of x is (x + 7) % m == r; decryption is: m + r - 7 == x

But author in question wants to "decrypt a 4-digit number" and just in case I need to make a caution if author considers changing the code: Mod operation is not bijection - it is not reversible: (0 + 7) % 10 = 7; (10 + 7) % 10 = 7.

if algorithm's input is only from range 0..9 then , for instance: 10 % 7 = 3; 7*1 + 3 = 10. That is 7 * (10 / 7) + 3 = 10. Every number a can be represented as a = m * (a/m) + r; where m is modulus, r - remainder. "/" integral devision.

Function of form (k + n) mod m is good for hash functions, used for random numbers generation. If you want to use simple encryption for learning you can achieve better results with minimum efforts - use XOR. Generate key and XOR it with plain text. To decrypt XOR encrypted text with the same key. Read about One-time pad One-time pad - very simple in implementation encryption technique but that cannot be cracked.

UPDATED: As cryptographer I would recommend you (if you are interested in learning basics of cryptography) starting to learn and implement classical simple crypto algorithms like: Caesar cipher, simple substitution, Vigener cryptosystem (they are available in wikipedia).

Your crypto function (t + 7) % 10 is very similar to Caeser educational cipher with some changes: The encryption can be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A → 0, B → 1, ..., Z → 25. Encryption of a letter x by a shift n can be described mathematically as,

Decryption is performed similarly,

Goog luck!

The array needs to be exported from the binary, i.e. it needs to be a public symbol in the executable's symbol table.

On Windows, that would be:

Use the empty_data option to do this.

It seems you are not actually executing the query.

Please try one of this solutions to make it work.

Also I used findById, but it does not matter, you can continue to query with findOne also.

Alternative 1: then catch blocks:

Use encodeToString() rather than encode(). The first returns a String as expected by your function return type, the latter returns a byte[].

Documentation: https://developer.android.com/reference/android/util/Base64

have two lists instead of strings like from_ = "abc".split() and to_ = "def".split() look for your char in from_ and get the index, get the same index char from to_ and stitch it to a new sentence.