/PROG/RIDERS UNITE
1
Name:
Anonymous
2012-04-08 3:40
Hello /prog/
if i have:
n = a^b
m = b^c
Then how can i take n and m and figure out what b is?
2
Name:
Anonymous
2012-04-08 3:40
fix: (not and)
n = a or b
m = b or c
3
Name:
Anonymous
2012-04-08 3:42
wtf are you are trying to do?
4
Name:
Anonymous
2012-04-08 3:43
this sounds like homework
5
Name:
Anonymous
2012-04-08 3:45
>>3
trying to crack something that uses a simple algorithm:
char *str = "prog";
char[4] newstr;
newstr[0] = str[0]^str[1];
newstr[1] = str[1]^str[2];
newstr[2] = str[2]^str[3];
newstr[3] = str[3]^str[0];
6
Name:
Anonymous
2012-04-08 6:36
For starters you forgot to add room for your null terminator for newstr.
7
Name:
Anonymous
2012-04-08 6:50
>>5
You can do it.
a ^ 0 = a
a ^ a = 0
a ^ b = b ^ a
(a ^ b) ^ c = a ^ (b ^ c)
8
Name:
Anonymous
2012-04-08 7:08
>>2
^ isn't and, it's xor.
9
Name:
Anonymous
2012-04-08 7:15
You can't.
10
Name:
Anonymous
2012-04-08 10:55
NP-ROCK HARD DICK
12
Name:
Anonymous
2012-04-08 13:36
13
Name:
Anonymous
2012-04-08 17:28
You can definitely do it is you know at least one byte of the original string. So that means you can take it down to 256 possibilities in general. If the string is long enough and if you know what it should look like, then you can easily pick the logical one.
14
Name:
bampu pantsu
2012-05-29 4:15
bampu pantsu