News
Entertainment
Science & Technology
Life
Culture & Art
Hobbies
News
Entertainment
Science & Technology
Culture & Art
Hobbies
Post-quantum RSA with gargantuan keys
If and when practical scalable quantum computers become available, RSA encryption would be broken, at least for key sizes currently in use. A quantum computer could use Shor's algorithm factor n-bit numbers in time on the order of n². The phrase "quantum leap" is misused and overused, but this would legitimately be a quantum leap.
Silent Payments for Privacy in Bitcoin | ECDH
Bitcoin transactions appear to be private because names are not attached to accounts. But that is not sufficient to ensure privacy; if it were, much of my work in data privacy would be unnecessary. It's quite possible to identify people in data that does not contain any direct identifiers. I hesitate to use the term
Day of the week centuries from now
Yesterday I wrote a post outlining mental math posts I'd written over the years. I don't write about mental math that often, but I've been writing for a long time, and so the posts add up. In the process of writing the outline post I noticed a small gap. In the post on mentally calculating
Mandelbrot and Fat Tails
The Mandelbrot set is the set of complex numbers c such that iterations of f(z) = z² + c remain bounded. But how do you know an iteration will remain bounded? You know when it becomes unbounded—if |z| > 2 then the point isn't coming back—but how do you know whether an iteration will never become unbounded? You