String decryption: based on the example, how is the string encrypted, encrypted, or compressed?

Question

Programming

there is a string: 111111
not encrypted in HEX ASCII: it looks like this: 31 31 31 31 31 31 of the corresponding bytes 49 49 49 49 49 49
in encrypted form it looks like this: 49 8D 77 1A 4A 99 of the corresponding bytes 73 141 119 26 74 153

Answer 1

Do you think there are psychics or all sorts of Turings sitting here that they can recognize the encryption algorithm by its hex output?
Let's start with the fact that what it is encrypted / encrypted in no way to find out quickly, because the exhaust will be different from different keys.
There is no compression either, as if because the length of the initial and final is the same.
What remains is coding, but the devil knows, go through the coding algorithms and see the output.
Pysy.
Explain for words. Are you given such sequences? Hex and Dec or what?
Where is this assignment from?
I can advise you to look in the direction of cryptanalysis based on the known plaintext and ciphertext to find out the key, but you will have to go through all the encryption algorithms encrypting 111111 with all possible keys until you get 498D771A4A99.... then you will find the key and the encryption algorithm
Maybe, well, his?

Answer 2

Collect more pairs of open-closed text, then come. One line says nothing. Also, if encryption is done with a normal one-time pad, you can't determine anything with any number of pairs.