08-12-2009, 02:55 PM
Just joining in...
20 T -> B 2 ( 2+0 = 2 )
3 C -> C 3 ( 3=3 )
17 Q -> H 8 (1+7 = 8)
Not sure how to use this, the transformation is by adding the digits of the corresponding number (or MOD 9). Do we apply this to the cipher text? I don't think so because you would lose too much info changing 26 letters into 9. Maybe just the idea of using MOD for fibonacci addition?
4) THE TWO SEEDS!!!!
3, 9, 7, 4, 8, 9, 5, 7, 11, 6, 6, 13, 7,
8, 6, 9, 6, 11, 8, 13, 10, 15, 8, 11, 4, 9,
Right, so it is important to solve the second one to get the next seed. The first one was solved so we know the next number in the sequence is 5, (and then 15 if we need two seeds from each sequence). So we need these seeds to generate fibonacci sequences which should be our key for decryption.
To use the one-time pad (Vernam) we could use either the fibonacci addition (I haven't quite figured out how that works, is it just mod addition??) or typically XOR is used. We could try both. I think the "Less-safe-procedural-Vernam" just means that we are not using the most secure for Vernam which would be a truly random key. We are using less secure -- a generated sequence.
_Mark
(08-08-2009, 08:23 PM)Bloody_Eugene Wrote: [ -> ]That's what I have:2)
20 T -> B 2 ( 2+0 = 2 )
3 C -> C 3 ( 3=3 )
17 Q -> H 8 (1+7 = 8)
Not sure how to use this, the transformation is by adding the digits of the corresponding number (or MOD 9). Do we apply this to the cipher text? I don't think so because you would lose too much info changing 26 letters into 9. Maybe just the idea of using MOD for fibonacci addition?
4) THE TWO SEEDS!!!!
3, 9, 7, 4, 8, 9, 5, 7, 11, 6, 6, 13, 7,
8, 6, 9, 6, 11, 8, 13, 10, 15, 8, 11, 4, 9,
Right, so it is important to solve the second one to get the next seed. The first one was solved so we know the next number in the sequence is 5, (and then 15 if we need two seeds from each sequence). So we need these seeds to generate fibonacci sequences which should be our key for decryption.
To use the one-time pad (Vernam) we could use either the fibonacci addition (I haven't quite figured out how that works, is it just mod addition??) or typically XOR is used. We could try both. I think the "Less-safe-procedural-Vernam" just means that we are not using the most secure for Vernam which would be a truly random key. We are using less secure -- a generated sequence.
_Mark