• Breaking News

    Thursday, April 5, 2018

    Home Unlabelled Cryptography Cryptographic Right Answers

    Cryptography Cryptographic Right Answers

    April 05, 2018

    Cryptography Cryptographic Right Answers

    Cryptographic Right Answers

    Posted: 04 Apr 2018 09:21 AM PDT

    Here comes the next round of encryption legislation

    Posted: 04 Apr 2018 10:50 AM PDT

    Manually type a Byte Order Mark? (BOM)

    Posted: 04 Apr 2018 03:48 PM PDT

    I am doing some hashing for a project. Let's use SHA-1 for this example (Algo doesn't matter)

    When I want to hash the string 'test', it comes out like this:

    test A94A8FE5CCB19BA61C4C0873D391E987982FBBD3

    When I do the same thing in notepad, in Windows, saving as UTF-8, it comes out like this:

    test 827795F4B53FECA5D552C13806D5D08ED31866A2

    Now, I know -why- it does this, is because UTF-8 in Notepad requires Byte Order Mark to be interpreted as UTF, I get it, and yes, an easy workaround is to use something like Notepad++ to simply encode UTF -without- BOM.

    What I would like to know is, is there a way to manually type in a BOM in a string, that would give the same output as the text file?

    I tried the Zero-width character, comes out different hash. I tried 0xFE 0xFF and it gave me different hashes.

    From Wiki: The UTF-8 representation of the BOM is the (hexadecimal) byte sequence 0xEF,0xBB,0xBF. A text editor or web browser misinterpreting the text as ISO-8859-1 or CP1252 will display the characters  for this.

    I even tried to paste  into the string, to give me a completely different hash.

    What do I type in front of the string to give me the same hash as a text file with the same string?

    submitted by /u/IrregularCape
    [link] [comments]

    Question about XOR as it relates to hash functions

    Posted: 04 Apr 2018 03:26 PM PDT

    Hello, I'm working on reversing a hash function (one that is intentionally weak for educational purposes), and I'm sort of stumped on something I feel should be simple. Here's my question: If you have the XOR combination of each character in a message, is there any way other than brute forcing to get the set of possible messages? So like, if the message was 'abcd', the hash would be ('a' XOR 'b' XOR 'c' XOR 'd'). Having that hash, is there an efficient way to compute a set of possible messages that could have produced the hash? Thank you

    submitted by /u/TrubsZ
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment