8
$\begingroup$

I received the following challenge as a homework problem. Not much info is provided with it, except for the word Decrypt! at the end.

This problem is online on a password protected school site. So I cannot post the link. (No-one without an account would be able access it.)

This is for a course based on cryptography/network security

enter image description here

A hint I received said that I should look into the html code. Which is pasted below. I noticed the "nbsp;" tag repeats quite often, and exactly 57 times, which is also the name of this challenge in the URL code ie.. www.website.com/challenge/#57.html

So based on the hint to look into the html and the #57 in the url I believe it is possible this &nbsp tags are what to focus on.

Any help or clues on how to solve this would be appreciated.

enter image description here

$\endgroup$
  • 8
    $\begingroup$ It is only quote from en.wikiquote.org/wiki/A_Tale_of_Two_Cities $\endgroup$ – Jan Ivan Apr 1 at 8:52
  • 1
    $\begingroup$ @MOehm did you realize the answer? I wasn't sure if I should post given that it appears to be a homework assignment. $\endgroup$ – El-Guest Apr 2 at 20:42
  • 3
    $\begingroup$ (I'm not sure why you keep removing the information from the puzzle that is needed for others to solve it. This site is not here only to serve you; please be considerate of those who haven't seen it yet, or who perhaps will find this in the future, and want a chance to solve it themselves. Removing the actual text with nonbreaking spaces from the puzzle renders it unsolvable—it's vandalizing your posts, which isn't actually allowed. Please don't do this.) $\endgroup$ – Rubio Apr 2 at 22:27
  • 2
    $\begingroup$ Hi! Just wanted to ask Are you allowed to ask that problem here? And is it a part of an ongoing competition etc.? $\endgroup$ – Eagle Apr 2 at 22:42
  • 2
    $\begingroup$ @anonymous You've already seen the answer; deleting it won't unring that bell. We generally avoid deleting content once it's been answered. If your concern is that someone might find the text here and believe a person in the class is being academically dishonest by getting the answer without doing the work themselves, I dunno, I feel like since that's actually what happened, it would be more dishonest to cover it up like it didn't happen. At least you can, honestly, say you only asked for "Any help or clues on how to solve this" rather than asking for the solution outright. $\endgroup$ – Rubio Apr 3 at 0:12
8
$\begingroup$

Replacing simple spaces with 0 and non-breaking spaces with 1, we obtain:

010100000110000101110011011100110011101001100101011011100110001101110010011110010111000001110100001000000110100101110100

Splitting it 8 digit by 8 and converting binary to UTF-8, we obtain a 15-character phrase:

  • 01010000 P
  • 01100001 a
  • 01110011 s
  • 01110011 s
  • 00111010 :
  • 01100101 e
  • 01101110 n
  • 01100011 c
  • 01110010 r
  • 01111001 y
  • 01110000 p
  • 01110100 t
  • 00100000 <space>
  • 01101001 I
  • 01110100 t

  • You can also convert using on-line automatic tools like this one.

    $\endgroup$
    • 1
      $\begingroup$ This is a great answer (and gets a +1 from me), although I'm not sure how I feel about this homework assignment being answered for the OP. $\endgroup$ – El-Guest Apr 2 at 20:41
    • 1
      $\begingroup$ Thanks for the help. Appreciate it but May I delete sensitive info from the answer? I forgot to say that I just wished for a hint into the right direction, as this is a school homework problem. $\endgroup$ – user58284 Apr 2 at 22:19

    Your Answer

    By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy