Anonymous ID: b8af2c July 2, 2018, 4:38 p.m. No.2003885   🗄️.is 🔗kun

>>1983636 (old)

Gowdy isn't ready, for one thing. He has no judicial history. We don't know if he's conservative. He's worked as a prosecutor, which gives no assurance as to that. He's never had to write judicial opinions. And he's just a Congressman. Senator to SCOTUS isn't too much of a leap, but House isn't at the same level.

 

There may be some funny business involving Scott and maybe Gowdy, because it's not a reasonable recommendation, hardly worth being pushed by Scott in normal circumstances.

Anonymous ID: b8af2c July 2, 2018, 4:59 p.m. No.2004074   🗄️.is 🔗kun

>>2003704

I may have less understanding of Crypto here but a slightly better understanding of QC. I believe QC can solve all those prime number factorization problems. If you can multiply 'em, QC can find the factors.

 

This is because QC sets up constraints and lets the qubits (electron spins in the D-Wave Systems machines I know of) "relax" into a solution that satisfies those constraints. I haven't done it personally, but I recall thinking that this is doable via QC. Due to the Unique Factorization Theorem, any solution it finds will be the only one, the one that cracks the code.

 

I've wondered how things would be during this interesting period when most people thought RSA256 was secure and I didn't think that. Maybe we are finding out. Various unpredictable "oopses".

 

Encryption will need to find new ways that aren't just like prime factorization problems. I am sure there is lots of interesting Computer Science work on which sorts of problems can be restated in the form a QC can solve. This certainly exists and is evolving (unless it's well understood already by insiders) because it's that important. But I would not know without reading the literature how much of that work is unclassified.