Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
I have these two encoded strings but I can't figure it out what type of encryption was used to encode:
lgGggAJp03czFtABAQAbAGlzU2FsZT1GYWxzZSNwcm9kdWN0SWQ9MTAwMQEBARXgQOoQm2IxgpYaAMcu5PS9BxkOQ7H6ezQsZZ4LjqHl5qOQgJQAESr3N5xVvZ5MCg==
and this:
b/d19ASvboAn5QBDCVieHoNTokXm0EaJKcSfrgwPlKykTKcIf7hhAibrCYuP0fK8dLH0SKvF6JWuZUftc7bG8wsVhn1uHX5Q4A6VR3POJ8zdbhiHkTcgQwG8wYYpsP3Vn8hLuoOrZbj6FAqO76GkrBYVfDYyF7GYHXdtBZQm4Dk=
I used base64 but it doesn't work.
Looks like Base64 to me. Any time I see encoding ending with '=' or '==' it is my first guess. I can see 'sales' and 'product id' after decoding your first example though it isn't completely readable. May be double encoded or have other non-printable characters as field delimiters. Hopefully this gets you heading in the right direction.
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 4 years ago.
Improve this question
so I've been trying to figure out what this is for a while:
MzggMTAgMTA=
is it base64? Or a hash?
It looks so familiar to me but I can't find what it is...
Thanks and sorry if my question is silly, I am a beginner, thank you!
My rule of thumb is, if there's a = or even two at the end, then it's Base64 encoded. In this case, the decoded message of your text is "38 10 10".
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 5 years ago.
Improve this question
How to advance edit distance with operation take an anagram of the existing word. every interim step must be a word from a list of words .
The standard technique for anagrams is to store words in canonical sorted order, e.g. "Banana" becomes "aaabnn". Do that for all valid words, then consider Levenshtein distances between those. You will want to map from canonical to a valid set, e.g. valid['dgo'] = {'dog', 'god'}
Take a look at tail /usr/share/dict/words if you need a set of valid words.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
Please suggest any widely used query parameter encryption technique that works best for common servers and client side libraries?
The requirement is to encrypt entire query string right after the '?' so that no field names or values can be read in clear.
Is there any HTTP level standard for the same?
One of the ways could be,
mycommerce.com/gp/goldbox?gb_f_GB-SUPPLE=sortOrder:BY_SCORE,enforcedCategories:165796011&pf_rd_p=2208383682&pf_rd_s=slot-3&pf_rd_t=701
would become
mycommerce.com/gp/goldbox?params=<encrypted string>
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
Is it considered correct in order to do a binary or hexadecimal operation to convert to decimal, do the operation, and then convert back to the original numeral system?
Is the above not advised?
Is the above frawned upon?
The context is a (first year) Programming Open University Course and the guide (in lack of a better word to describe him) is delaying my enquiry.
Yes, it's generally correct. Numbers are numbers, no matter how you represent them as text. Note that binary, decimal, and hexadecimal are all text representations of numbers.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
Suppose im given a large essay. Whats the best method available to shrink it down into a small string of letters which I can decode later? Suppose Im allowed to keep a set of predefined keys if i need to?
Assuming the text is English and you want to minimize the size of the "small string", you will find a number of algorithms here: http://www.maximumcompression.com/data/text.php
For ease-of-implementation, however, you might simply want to use zlib, as it's generally available.
Further, if you want to encrypt the compressed text, you should use AES in CTR mode (and possibly appending an HMAC; ref: http://www.daemonology.net/blog/2009-06-11-cryptographic-right-answers.html).
Finally, assuming that by "asring of letters" you meant "a string of letters", you could base-64 encode the encrypted data, which would give you a string of letters, numbers, and a limited amount of punctuation.