2

To what kind of compression algorithm could the following sentences belong to?

AxFWR:YRCtIPns<_o%p_=Q>LELBM
AxFWRPA:cXe#<InM=L:Mthwekblc
AxFWREFEp`f?PU`;K;M:;P?MDMCL
AxFWRW%VK>Hk]hhDTSERSHWEKBLC
AxFWRiQifLRCE@t>N<J=<L;QHQGP
AxFWRTWTArlZ[fJhxbtcbrewax%y

I don't think that it is any kind of hash but rather a simpler algorithm. I tried Base64, but I am sure that it is not.

Also I know that fragments of the "plain text" of every of these strings probably include (in order) :

4B3A29
4609
N00852
A00

Just to give you an example it could look like: 4B3A29 ... 4609532N 00852444E A00 ...

  • 1
    It doesn't look compression. If it would be compression AxFWR would not appear here more than one time - and you'd see there non-printable characters. It looks like substitution cipher or other encoding. – w s Mar 15 '16 at 8:34
1

As stated by @ashleydc, it's most likely custom Base64.If you have enough ciphertexts, an easy way to check if it's custom Base64 would be to compute the number of unique characters. (there are 56 unique chars with the few given examples, so it's a fair bet).

After that, it's "just" a substitution cipher. Having a plaintext/ciphertext couple would tremendously help. Otherwise, if the plaintext has enough constraints (only digits/uppercase as you might hint?), you'll have to guess enough about the plaintext (most propable tuples, etc) until you're able to bruteforce it.

|improve this answer|||||
0

This looks like base64 encoding to me, using an alphabet that has been reordered. If you'd like a little more information, there's a paper that describes this sort of thing at https://security.utexas.edu/sites/default/files/Obfuscation.pdf. Unfortunately, since there are so many ways to reorder the alphabet, it may not be easy to decode.

|improve this answer|||||

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.