Jo rzp fuh bhfutcjsv ozu ich vjwhfdfr. Ji jb szi chuh. Vz bhfutc hebhdchuh, mpi mh tzsbjbihsi szi iz dfsahu zoo. Ops ofti: J dfb iurjsv iz lfxh bpuh icfi icjb ahbtujgijzs cfb fee fegcfmhib, mpi J vzi efyr. Fb pbpfe, J vzi efyr fsa J bfja ehi pb Lfxh icjb cfuahu

Zm ---> Zm
x ----> 7x+5

SOLUTION

The games are:
x2 INK
x2 Divekick
x1 Dead State: Reanmianted
x2 Grim Fandango: Remastred added.

Hall of fame:

  1. gorok
  2. blead
  3. faragona
  4. mrt39
  5. VillaNZ
  6. TheCountTR
  7. Mikalye
  8. NewGame
  9. stlpaul

Random hints/facts

Shoutout to mahv for being smart and solving the hardest part in less than a minute.

** Something for the geeks.

 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
 #include <ctype.h>

 #define MAXSIZE 1024

 char *encryption(char Plaintext[MAXSIZE], int A, int B)
 {
    static char Ciphered[MAXSIZE];
    int i;
    int y;
    int index;
    for(i=0;i<strlen(Plaintext)-1;i++)
    {
        if(Plaintext[i]==' ')
        {
            Ciphered[i]=' ';
        }
        else
        {
            index=(int)Plaintext[i] - 'a';
            y=(A*index+B) % 26;
            Ciphered[i]=(char)y+'a';
        }
    }
    return Ciphered;
 }

 int modularinverse(int number, int modulo)
 {
    int inverse;
    int i;
    for(i=1;i<modulo;i++)
    {
        if((number*i) % modulo == 1)
        {
            inverse=i;
        }
    }
    return inverse;
 }

 char *decryption(char Ciphered[MAXSIZE],int A, int B, int inverse)
 {
    static char NewPlaintext[MAXSIZE];
    int i;
    int x;
    int y;
    int index;
    int c;
    for(i=0;i<strlen(Ciphered);i++)
    {
        if(Ciphered[i]==' ')
        {
            NewPlaintext[i]=' ';
        }
        else
        {
            index=(int)Ciphered[i] - 'a';
            x=((inverse * (index - B) % 26) + 26) % 26;;
            NewPlaintext[i]=(char)x+97;
        }
    }
    return NewPlaintext;
 }

 int main()
 {
    int i;
    int A, B;
    char Plaintext[MAXSIZE], Ciphered[MAXSIZE];
    int inverse;
    printf("Donner votre mot/phrase: ");
    fgets(Plaintext,100,stdin);
    for(i=0;i<strlen(Plaintext);i++)
    {
        if(isupper(Plaintext[i])) /
        {
            Plaintext[i]=tolower(Plaintext[i]);/
        }
    }
    printf("Donner A et B: ");
    scanf("%d%d",&A,&B);
    printf("%s\n",encryption(Plaintext,A,B));
    inverse=modularinverse(A,26);
    printf("%d\n",inverse);
    printf("%s\n",decryption(encryption(Plaintext,A,B),A,B,inverse));
 }
8 years ago*

Comment has been collapsed.

Do you want me to make more puzzles? (Optional and has nothing to do with solving this)

View Results
Yes!
No!
Cipher my ass!
Deleted

This comment was deleted 7 years ago.

8 years ago*
Permalink

Comment has been collapsed.

The quick brown fox jump over the lazy dog.

8 years ago
Permalink

Comment has been collapsed.

Deleted

This comment was deleted 7 years ago.

8 years ago*
Permalink

Comment has been collapsed.

The quick brown fox jumps over the lazy red herring.

Are you the quick brown fox?

8 years ago
Permalink

Comment has been collapsed.

Deleted

This comment was deleted 7 years ago.

8 years ago*
Permalink

Comment has been collapsed.

Well, I guess you did. 8 people solved it so far. Added you the Hall of Fame.

8 years ago
Permalink

Comment has been collapsed.

Free bump, as the GAs are lacking a couple of entries.

8 years ago
Permalink

Comment has been collapsed.

Thanks for the bump.

Nearly 4 days left guys, this is pretty easy if you look into it.

8 years ago
Permalink

Comment has been collapsed.

BUMP

Also for programers, here's a little something to help you decipher Affine Cipher.

 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
 #include <ctype.h>

 #define MAXSIZE 1024

char encryption(char Plaintext[MAXSIZE], int A, int B, int length)
{
    char Ciphered[MAXSIZE];
    int i;
    int y;
    int index;
    for(i=0;i<strlen(Plaintext);i++)
    {
        if(Plaintext[i]==' ')
        {
            Ciphered[i]=' ';
        }
        else
        {
            index=(int)Plaintext[i] - 'a';
            y=(A*index+B) % 26;
            Ciphered[i]=(char)y+97;
        }
    }
    printf("%s",Ciphered);
 }

 int main()
 {
    int length;
    int i;
    int A, B;
    char Plaintext[MAXSIZE];
    printf("write your stuff here: ");
    fgets(Plaintext,100,stdin);
    for(i=0;i<strlen(Plaintext);i++)
    {
        if(isupper(Plaintext[i]))
        {
            Plaintext[i]=tolower(Plaintext[i]);
        }
    }
    printf("give A and B: ");
    scanf("%d%d",&A,&B);
    encryption(Plaintext,A,B,length);
 }
8 years ago*
Permalink

Comment has been collapsed.

Fixed it. Hope it helps(I lied).

8 years ago
Permalink

Comment has been collapsed.

But... but... aren't there a lot of Affine deciphering tool out there?

8 years ago
Permalink

Comment has been collapsed.

I know, this is just for educational purposes. As most of the websites wouldn't provide you with the source code.

8 years ago
Permalink

Comment has been collapsed.

I just managed to write a program in java and i just managed to read the description of your thread, but I still dont know where the giveaway link.
Hmm, sadly.....
I really dont understand what I miss. Hahahaha.

8 years ago*
Permalink

Comment has been collapsed.

There's a hint. Check it out :)

8 years ago
Permalink

Comment has been collapsed.

Still stuck. :v

8 years ago*
Permalink

Comment has been collapsed.

I hid the giveaway somewhere else(NOT in this discussin) but I aslo hid the hint where to find it IN THIS discussion. As well as an important piece. It's hidden plain sight

8 years ago
Permalink

Comment has been collapsed.

Bump for puzzle and nice gifts :) but going to avoid due to the pain you put my brain through.

8 years ago
Permalink

Comment has been collapsed.

Thanks for the bump. I hope you change your mind and come solve this. It's pretty easy :D

8 years ago
Permalink

Comment has been collapsed.

Bump for easy

Hint: The cipher is a hoax.

8 years ago
Permalink

Comment has been collapsed.

lol, this would make my life a lot easier a few days ago. Bump.

8 years ago
Permalink

Comment has been collapsed.

The giveaways are ending after 4 hours and half. If you have any question regarding the puzzle or/and how to solve, you might ask starting from now.

BUMP

8 years ago
Permalink

Comment has been collapsed.

Bump for solved

8 years ago
Permalink

Comment has been collapsed.

Thanks for the bump. Added to Hall of fame!

8 years ago
Permalink

Comment has been collapsed.

Finally solved.

8 years ago
Permalink

Comment has been collapsed.

Solved with two minutes to spare. Whew!

8 years ago
Permalink

Comment has been collapsed.

That was nice.

8 years ago
Permalink

Comment has been collapsed.

Giveaways ended. Congratulations to whomever won(Keys sent)! I will edit the discussion shortly so you know how to solve this.

8 years ago
Permalink

Comment has been collapsed.

The hints made it a lot easier (and kinda spoiled it a little, in my opinion).
Minus the fact that you have to reach mahv's thread, the rest of the puzzle is very easy.

8 years ago
Permalink

Comment has been collapsed.

8 years ago
Permalink

Comment has been collapsed.

Thanks :)

8 years ago
Permalink

Comment has been collapsed.

Solution:

Upon entering the discussion, your very first step is to decode the given cipher using the information I've given(Obvious hein?). However, deciphering the text yield:

Tip: You could use an online decoder to do it.

If you are searching for the giveaway. It is not here. Go search elsewhere, but be consistent not to wander off. Fun fact: I was trying to make sure that this description has all alphabets, but I got lazy. As usual, I got lazy and I said let us Make this harder.

The message implies that the giveaway isn't hidden in the cipher. But rather somewhere else. But where would I hide it rather than my own discussion thread? It was hidden IN the cipher. If you could notice, there are bold letters in the original cipher that will yield: "tlFiL" once gathered. It looks like you could use it as a GA URL, but I wouldn't make it that easy. It was rather a discussion URL: ma.v's discussion thread, once you're in the discussion thread, you'll find that ma.v said that I said it's hidden here and you're in the right path. Of course your reaction, as unprofesionnal puzzle-solvers; is how am I supposed to know I should use as a discussion URL? The answer is very simple. I've also hid two messages in my very first reply to the discussion, a reply which says "This is a hint".

First message: sg.has.more.than.giveaways.discussions.for.example
Second message: (If.you.find.it.hard.to.find.the.correct.place.since.there.are.a.lot.I.attached.a.picture.in.it)

The first message is a direct hint that the code "tlFiL must be used as a discussion URL. The second message is more direct that I hid something in one of my replies in ma.v's discussion thead. But I made too many god damn replies that day. That's why it says I also attached a picture with it. The image is:

Which is taken from the movie "Inception" that means you gotta simply dig deeper, and by deeper I mean check the source of the page and particualry my reply. Once done, you'll find this code as the title of the .gif. "x4a2JWgL".

You simply use the code in ITH. That yiels THIS

There are two questions in the ITH puzzle. Both answers are simply "No answer." , obtained by following the pattern "No title.", "No description." and "No question.".

Once you answer correctly, you'll get a code that leads to the first wagon of the train.

View attached image.
8 years ago
Permalink

Comment has been collapsed.

Closed 7 years ago by Meetrock.