Rhubobby wrote:I have heard/read lots of people saying to look at the ascii chart, but I have no idea what to do. I am fairly new to this site, and to hacking in general. If somebody could, basically, start me off with encryption, I would definitely be grateful. PM me if you are willing.
That is, if there is a PM system on here...
Start by putting in a few letters and look at what the output is. Then look at an ascii chart (google) and check out what the encryption method is.
To add on, specifically I have noticed it easier to figure out how the encryption works if you add the same number/letter and see how the fuction of the encryption is dealing with it. You do this, because you know that the character you are inserting holds the same value of itself, and use this to determine how the process is running. For instance if someone was to add a piece of chicken to everyones plate that had blue eyes, and you had blue eyes, everytime the person passes by you, you would still get that piece of chicken, otherwise you would not. Now, since you can't change the color of your eyes, or anything else physically for that matter (kind of), then this would always be true, and will not change, as you will always hold the same value. But let's say that it was every other person who had blue eyes got a piece of chicken, and you sat on seat 1, and didn't get a piece, seat 2 did, seat 3 didn't, seat 4 did, etc, you know it's not based purely on your eyes, but your eyes and where you are located at the time.
So ask yourself when looking at the encryption process, is the algorithm actually changing the values of the characters? Is it changing the value of the character based on something else, such as the position of the character, or the entire length of the string inserted? Is it using an algorithm where the sequence of the output becomes repeated at some point?
For instance, we will hypothetically encrypt a character multiple times as follows:
- Code: Select all
<Input> | <output>
y | 10
yy | 10, 15
yyy | 10, 15, 14
yyyy | 10, 15, 14, 19
yyyyy | 10, 15, 14, 19, 24
yyyyyy | 10, 15, 14, 19, 24, 23
If you examine the code above, you notice that there is a pattern.
The first thing you can exclude is that the encryption does not care about the total length of the word. You know this because when you encrypt yy, and yyy, those first two and three characters give the same output (10, 15), while the string has different lengths.
Now if you were to examine the code you could come up with something like:
+5, +5, -1
and this would be the algorithm based on the characters. Now keep in mind you need to reverse this, so you do the opposite such as:
-5, -5, +1, for instance:
- Code: Select all
input | output | math = reverse encryption value
y | 10 | -5 = 5
yy | 10, 15 | -5, -5 = 5, 10
yyy | 10, 15, 14 | -5, -5, +1 = 5, 10, 15
yyyy | 10, 15, 14, 19 | -5, -5, +1, -5 = 5, 10, 15, 14
yyyyy | 10, 15, 14, 19, 24 | -5, -5, +1, -5, -5 = 5, 10, 15, 14, 21
yyyyyy | 10, 15, 14, 19, 24, 23 | -5, -5, +1, -5, -5, +1 = 5, 10, 15, 14, 21, 24
You notice that the value of y remains constant as 5, and the math expressions work on that value based on the position.
Now you could use this to determine the unencrypted string(s)
Once you hit the sixth y, you notice the pattern repeats itself, since there are three expressions to be handled (+5, +5, -1)
Anyways, this will not solve your problem, but it will give you somewhat of an idea of how you should look at it, and some new things to test if you haven't yet. Also, the situation above isn't the greatest, and I probably could have made a better example, but the ideal is still the same.
Best of luck,