Skip to main content

This topic contains 191 replies, has 48 voices, and was last updated by  Anonymous 2 years, 4 months ago.

Viewing 15 posts - 151 through 165 (of 193 total)
  • Author
    Posts
  • #34019

    Anonymous

    Any clues for that secret message?

    #34020

    Anonymous

    But how do you know the beginning and end of words?

    P.S. Thank you very much to anyone who answered my previous question.

    Koala

    #34022

    Anonymous

    Was almost ready to give up but then reread the clue by @Lineage Noir a couple hundreds times and finally worked it out.
    Just keep at it and try as many possibilities as you can.

    #34030

    Anonymous

    OFFICIAL CLUE: First, reverse each word, but keep them in the same order, e.g. “I am Joan.” Would become “I ma naoJ.” Then decode bearing in mind it was encoded using the following method. Leave the first letter as it is. The second letter is the first plus the second added together. The third, is the second plus the third added together. Continue till you have done 12 letters, then repeat (so every 12th letter is already correct).

    This could also be solved as a Hill cipher using a 12 by 12 matrix where the first row is 1 followed by 11 0s), the second is 1 1 followed by 10 0s, the third row is 0 1 1 followed by 9 0s etc.

    Clues for the secret message will be posted in a separate forum.

    #34032

    Anonymous

    what does “os” mean

    #34033

    Anonymous

    What am I doing wrong? First letter is correct, Y. Next letter, currently C, is actually (value of Y) – (value of C) = 25 – 3 = 22 = V. Next letter, currently E, is actually 22 – 5 = Q. YVQ – doesn’t seem like this is going anywhere. What am I doing wrong, this is probably a silly mistake.

    PS Joan, did you mean that the third row is 111 following by 9 0s? i.e.

    100000000000
    110000000000
    111000000000
    111100000000
    111110000000
    111111000000
    111111100000
    111111110000
    111111111000
    111111111100
    111111111110
    111111111111

    As the matrix?

    #34034

    Anonymous

    How do you “add” the letters?

    #34039

    Anonymous

    @Nebuler,

    Joan said “0 1 1 followed by 9 os”

    #34040

    Anonymous

    I think that it is plaintext = ciphertext – keytext, using A=0, B=1, C=2 etc, and mod 26 arithmetic

    Thus the second letter of plaintext will be C – Y, which is 2 -24, which is 4 (mod 26) and thus the second letter of the plaintext is E, which makes more sense 🙂

    #34041

    Anonymous

    Noaj, Noaj, Noaj (it’s Joan backwards)

    No wonder this is set by the University of Southampton, you’ve really pushed the boat out on this one

    Danke für die Herausforderung.

    #34042

    Anonymous

    0s is zero’s not os as it looks like in this font

    #34049

    Anonymous

    Is it

    100000000000
    110000000000
    011000000000
    001100000000
    000110000000
    000011000000
    000001100000
    000000110000
    000000011000
    000000001100
    000000000110
    000000000011

    Am I close.
    Also what comes after the forth of January. Do the best get picked

    #34050

    Anonymous

    Desperately trying to limp to the finish line here (the white flag of surrender has been hoisted for some time now!!). I have followed, with immense gratitude, Joan’s (and others) hints and tips but am still fumbling in the dark.

    I have reversed the letter order but maintained the word order, so the first word was originally TVVERECY, and reversed reads YCEREVVT. I have then used the method explained by @Tommo above, which gives me a decode of YECNNRAY.

    I am happy to keep on plodding on with my decode, but at the moment, it aint making much sense!! If I am going wrong somewhere, please can SKS point me in the right direction?

    Thanks!

    #34051

    Anonymous

    i got 99.99 what more

    #34056

    Anonymous

    Joan, when you say the third letter is encrypted by adding the second to the third, does this mean the second after it’s been encrypted or before?

Viewing 15 posts - 151 through 165 (of 193 total)

You must be logged in to reply to this topic.