12
edits
Talk:Pokémon data substructures (Generation III): Difference between revisions
Talk:Pokémon data substructures (Generation III) (view source)
Revision as of 14:01, 29 October 2007
, 29 October 2007no edit summary
Kyoufu Kawa (talk | contribs) (DVs) |
No edit summary |
||
| Line 13: | Line 13: | ||
Investigation of Fire Red assembly code reveals that the DVs field is not exactly as described. More to follow. --[[User:Kyoufu Kawa|Kyoufu Kawa]] 20:06, 10 August 2007 (UTC) | Investigation of Fire Red assembly code reveals that the DVs field is not exactly as described. More to follow. --[[User:Kyoufu Kawa|Kyoufu Kawa]] 20:06, 10 August 2007 (UTC) | ||
== Little Endian == | |||
Using little endian. This means for every word (two bytes), you reverse the order of the byte. The encryption and decryption will work as long as you keep the order the same for the key and the data. | |||
Let's work on the first problem: 0xEA98B8CE (your pers value, 3935877326) | |||
If you had compensated for little endian, you would have 0x98EACEB8, which is 2565525176 in decimal. | |||
Mod that by 24 and the answer = 8. AEGM. Hmmm... now that just opens a new can of worms. Hehe. | |||
After I'm finished having my fun with Leaf Green, I'll check out Ruby. | |||
[[User:Twigpi|Twigpi]] 14:01, 29 October 2007 (UTC) | |||
== Data Checksum == | |||
The checksum loops. Adding the unencrypted values should give you a value greater then 0xFFFF (max size), so it just loops. To find the correct value, MOD by 65536 (decimal) or 0x10000. | |||
[[User:Twigpi|Twigpi]] 14:01, 29 October 2007 (UTC) | |||