Cryptography Why TLS 1.3 isn't in browsers yet |
- Why TLS 1.3 isn't in browsers yet
- PGP encryption for iOS device
- Complexity Theoretical Hardness Assumptions and PQC
- CCC: lecture: Squeezing a key through a carry bit
- Method of Preventing Quantum Computers from Cracking Passcodes
| Why TLS 1.3 isn't in browsers yet Posted: 27 Dec 2017 02:59 PM PST |
| Posted: 27 Dec 2017 07:19 AM PST Greetings, Since I'm using PGPTools on my Mac, I also was looking for options to use PGP encryption on my iOS device. There are 2 apps I found in Apple's App Store, iPG Mail and PGP Everywhere. I was wondering if anybody has any more information and/or experience with this 2 apps. [link] [comments]  |
| Complexity Theoretical Hardness Assumptions and PQC Posted: 27 Dec 2017 03:25 PM PST Hi all, I'm new to post-quantum cryptography (PQC). From a strict complexity standpoint, my intuition of PQC public key crypto is that the hardness assumptions are ultimately reduced to a variety of NP-hard problems: general linear codes for McEliece; shortest vector (SVP) for Ring LWE-type schemes; OWFs for Merkle Hash Tree signatures, and so on. Given that our understanding of BQP in relation to NP is unknown, is it possible that quantum algorithms could exist for such hardness assumptions? That is, the presence of another 'Shor-like' algorithm that breaks, say, SVP. Put another way: we have no 'impossibility' proofs re. the presence of BQP algorithms for such assumptions? Is this a fair assessment? [link] [comments]  |
| CCC: lecture: Squeezing a key through a carry bit Posted: 27 Dec 2017 05:56 AM PST |
| Method of Preventing Quantum Computers from Cracking Passcodes Posted: 27 Dec 2017 10:13 AM PST I'v came up with a method I could use to stop a quantum computer from cracking passcodes. It's fairly simple, yet, complicated when it comes to actually implementing it. Quantum computers on a commercial level have commercialized limitations. An example of this is that right now, a quantum computer some rich guy has somewhere can probably break the entire bitcoin network by instantly mining bitcoin, however, the secret to stopping a quantum computer from cracking a combination is in the number of digits. Sure, a quantum computer can break a password that's over 9000 digits long in a few years from now, but, can a quantum computer break a password that's over a Vigintillion long? [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 | |
No comments:
Post a Comment