Cryptography I am writing a introductory course to Cryptography |
- I am writing a introductory course to Cryptography
- Do you think protectedtext.com is secure enough to use?
- I have written a public key python program that can securely communicate a point on an elliptic curve. Can I concatenate the x and y coordinate and then use a simple XOR cipher to send a message?
- ARX and Modular Addition
- Let's get this going guys. Joke contest ~ 1,000 BZC reward
| I am writing a introductory course to Cryptography Posted: 04 Dec 2017 04:01 AM PST Some years ago I took a class on Cryptography and decided (With the professor permission) to write a introductory course based on the exercises we solved on that course. I started publishing it to my blog, here are the first two: I would like some feedback from you. My idea is first cover the basis mathematical background needed to be able to explain all the exercises on my elbaulp/crypto github repo. Thanks [link] [comments]  |
| Do you think protectedtext.com is secure enough to use? Posted: 04 Dec 2017 07:50 PM PST I'm looking for a solution where I can store SUPER sensitive text-based data online so that I can access it anytime I have an internet connection. On it's website it reads: Why is it safe? Your password isn't sent to our server - we can't decrypt your text even if we wanted to. Only encrypted text is sent over the Internet. No cookies, no sessions, no registration, no users tracking. We can't identify you at all. We can't know when the same user visits two different sites. No logging in or out, just close the browser tab and you're safe. No ads - we hate ads because they can track you, and they're distracting. You don't have to trust anyone or agree on anything - check the code yourself. All our code is well written and full of comments so that you can understand it in details - start by looking at main.js, and check communication with our servers. If someone wants your text, he'll need your password, but he'll have to find your site first. [link] [comments]  |
| Posted: 04 Dec 2017 12:06 PM PST I am fairly new to cryptography having only briefly covered what was necessary for a Quantum information module of a Physics masters. I have written a program in python which can generate an elliptic curve. It can add points and multiply points by constants. So now I have an El Gamal system for securely communicating a point on an elliptic curve between Alice and Bob. My problem is that encoding and then decoding a plaintext message in what is essentially a random point on an elliptic curve requires me to solve a discrete logarithm. Instead of the various probabilistic strategies, can I just concatenate this point into a bit string and take an agreed hash? Alice and Bob now both know this hash and can XOR this hash with a message then discard the private key. Does this work or is there a gaping hole in my understanding that exposes an attack? [link] [comments]  |
| Posted: 04 Dec 2017 09:14 AM PST Regarding ARX and it's inherent difficulty in establishing tight bounds wrt LC and DC, I read somewhere NORX does something like a = (a ^ b) ^ ((a & b) << 1) with few drawbacks. I get that this is easier to analyze but for what reasons and why is, a = ((a + b) <<< n) not at least as strong as the former method of 'approximating' ARX? Does the analysis change if we preclude weak keys, that is, those with low hamming weight? [link] [comments]  |
| Let's get this going guys. Joke contest ~ 1,000 BZC reward Posted: 04 Dec 2017 10:30 PM PST |
| 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 | |
No comments:
Post a Comment