Cryptography PUBLIC KEY KRÜPTO – a nonverbal explanation

---

• PUBLIC KEY KRÜPTO – a nonverbal explanation
• I've implemented RSA modular exponentiation in C!
• [Suggestion] A list of homemade crypto debunking tools

PUBLIC KEY KRÜPTO – a nonverbal explanation Posted: 17 Feb 2018 06:23 AM PST submitted by /u/blinry [link] [comments]

I've implemented RSA modular exponentiation in C! Posted: 18 Feb 2018 01:14 AM PST submitted by /u/SopaXorzTaker [link] [comments]

[Suggestion] A list of homemade crypto debunking tools Posted: 17 Feb 2018 10:43 AM PST Designing your very own block/stream/other cipher is a very special feeling - both of extreme excitement and nervousness, yet all too often homemade ciphers posted here suffer from obvious flaws. In order to make cryptoanalysis of homemade ciphers posted on r/crypto more interesting (involving something like differential cryptoanalysis VS word frequency analysis), posters of homemade ciphers should be introduced to a list of things that should be done to a cipher to ensure that it is at least worth looking at by this community, here are some (very basic) things I can think of: Given 1GB of very repetitive data (0x00 filled 1GB file) and a very weak key (0x00 filled or 0x01 filled) does the output have statistical bias / is it easily statistically distinguishable from random? (tool to use: dieharder) Given a very large ciphertext output, can it be compressed to a size less than the output ciphertext length? (tool to use: xz) Encrypt plaintext 1 with key 1 -> ciphertext 1, flip one bit in plaintext 1, is there any correlation between the new ciphertext (made from the bit flipped plaintext) and the old ciphertext? Encrypt plaintext 1 with key 1 -> ciphertext 1, flip one bit in key 1, is there any correlation between the new ciphertext (made from the same plaintext and bit flipped key) and the old ciphertext? (Technically covered by the above probably) are patterns in plaintexts or patterns between plaintexts (like in the multiple-time pad) feasible to determine by looking at the ciphertexts? Can one easily determine the key based off of a large number of complete plaintext and ciphertext pairs If the answer to any of the above is YES, it is probably not ready for proper cryptoanalysis. submitted by /u/naclo3samuel [link] [comments]

You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States