(08-12-2009, 02:55 PM)mmammel Wrote: 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?
Yes, you are right! 26 letters to 9 could be a huge loss of information. So i don't think too that it decipher the text directly.
I have to dig a little bit more about the fibonacci addition, and where to use it!
(08-12-2009, 02:55 PM)mmammel Wrote: 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.
Mmm... interesting... XOR...but i have to figure out too. when i have a little more of time i'll try !
(08-12-2009, 02:55 PM)mmammel Wrote: 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.
Yeah, you are right!!!!! I think that's a good path! So we have an objective: try to undestand how the sequence generate! Damn, this puzzle is too difficult!
BTW, i was thinking about "the primeary casuse"... the hint inside the web page...it's very strange.... it's not correct in its grammar....
and then i tought "the prime"...could be refer to the prime numbers? could be "the primeary casuse" an anagram of something like "use the prime as y" (but letters are missing) or something like that?