How to decipher












8












$begingroup$


Ok let me try again..



Hello



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










share|improve this question











$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$
    – Akari
    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$


Ok let me try again..



Hello



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










share|improve this question











$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$
    – Akari
    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












8








8


2



$begingroup$


Ok let me try again..



Hello



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










share|improve this question











$endgroup$




Ok let me try again..



Hello



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







cipher steganography






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 2 days ago









Community

1




1










asked Apr 1 at 6:17







user58284















  • 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$
    – Akari
    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$
    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$
    – Akari
    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




8




$begingroup$
It is only quote from en.wikiquote.org/wiki/A_Tale_of_Two_Cities
$endgroup$
– Jan Ivan
Apr 1 at 8:52




$begingroup$
It is only quote from en.wikiquote.org/wiki/A_Tale_of_Two_Cities
$endgroup$
– Jan Ivan
Apr 1 at 8:52




1




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




$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




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




$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




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$
– Akari
Apr 2 at 22:42




$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$
– Akari
Apr 2 at 22:42




2




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






$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












1 Answer
1






active

oldest

votes


















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.






    share|improve this answer











    $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





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "559"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81256%2fhow-to-decipher%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown
























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    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.






    share|improve this answer











    $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
















    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.






    share|improve this answer











    $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














    8












    8








    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.






    share|improve this answer











    $endgroup$



    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.







    share|improve this answer














    share|improve this answer



    share|improve this answer








    edited Apr 3 at 7:24









    Glorfindel

    14.4k45486




    14.4k45486










    answered Apr 2 at 20:35









    horcruxhorcrux

    2513




    2513








    • 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














    • 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








    1




    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




    $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




    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




    $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


















    draft saved

    draft discarded




















































    Thanks for contributing an answer to Puzzling Stack Exchange!


    • Please be sure to answer the question. Provide details and share your research!

    But avoid



    • Asking for help, clarification, or responding to other answers.

    • Making statements based on opinion; back them up with references or personal experience.


    Use MathJax to format equations. MathJax reference.


    To learn more, see our tips on writing great answers.




    draft saved


    draft discarded














    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81256%2fhow-to-decipher%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown





















































    Required, but never shown














    Required, but never shown












    Required, but never shown







    Required, but never shown

































    Required, but never shown














    Required, but never shown












    Required, but never shown







    Required, but never shown







    Popular posts from this blog

    Masuk log Menu navigasi

    16 Maret Daftar isi Peristiwa | Kelahiran | Meninggal | Hari raya dan peringatan | Menu navigasis

    ジョン・ファウルズ