Archive

Archive for June, 2009

FE100 0.22 with updated keygrabber

June 10th, 2009

I’ve seen the below forum thread and thought it would be a nice addition to add an alternative to ecc key extraction in the FE100’s keygrabber tool.

Extracting the ECC Key without xyzzy

quoting bushing from there…
>Um… the entire contents of OTP (including all keys) are tacked on the end of the nand.bin dump that BootMii
>creates. Xyzzy is officially obsolete.

>The last 1K of the file contains both the OTP and SEEPROM; you can find the structure definitions here:

>[snipped link to the header file]

Having learned this, I added ecc key extraction from bootmii nand dump into the keygrabber tool (third button in the keygrabber to get the keys)

Enough crap, here is the new keygrabber & bugfixed FE100 : FE100 V0.22

ps: By the way, if you are reading this and you are a member of wiibrew forums : could you pm an admin there and notify them that “forgot my password” feature there doesn’t seem to work for quite a long time… That’s why I didn’t reply to the original topic mentioned at the top of the post.

Below key stuff is just for the first button (Get stuff from Interwebz) to work correctly…

Here are the shared keys (the first two actually) that are necessary to unpack a wii savefile.

SD key (ab01b9d8e1622b08afbad84dbfc2a55d)
SD IV (216712e6aa1f689f95c5a22324dc6a98)
MD5 blanker (0e65378199be4517ab06ec22451a5793)

More information about these and other keys can be found on hackmii,
here : http://hackmii.com/2008/04/keys-keys-keys/

Only reason I included them here is because the previous version of keygrabber was leeching those keys from hackmii blog. Now it will leech them from here… The reason I didn’t bundle this stuff into the FE100 package is to folow the common practice…

Hacks, Homebrew, Wii , , , , , ,

Weirdo

June 3rd, 2009


PROGRAM WEIRDO;
USES CRT;

VAR
N:INTEGER;
TMP:INTEGER;
I:INTEGER;
J:INTEGER;
A:ARRAY[1..7] OF INTEGER;

BEGIN
A[1]:=1;A[2]:=3;A[3]:=5;A[4]:=7;A[5]:=6;A[6]:=4;A[7]:=2;
N:=7;

J:=A[N];

FOR I:=1 TO N-1 DO
BEGIN
TMP:=A[J];
A[J]:=J;
J:=TMP;
END;

WRITELN('RESULT IS');
FOR I:=1 TO N DO
BEGIN
WRITE(A[I],' ');
END;

END.

What the heck you’ll say… I’ll tell you later…

Here I go, this was just posted after a lengthy study about data structures & algoirthms. And this was just an implementation to one of the possible questions that could have came out in the exam. And the question is, A word is getting scrambled using an array like this {1, 3, 5, 7, 6, 4, 2 } (N=7) such that odd numbers are written from start of the array to the middle whereas even numbers from the end of the array to the middle. unscramble a word given, without using a secondary array.

– Btw, question not asked…

Lame stuff, Personal