Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kwantam
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
1.
▲
by
kwantam
2y ago
The whole point of this article is that performant Wireguard-over-TCP support in Wireguard simply does not work. You're not fighting the prevalence of an idea, you're fighting an inherent behavior of the system as currently consti
2.
▲
by
kwantam
2y ago
One of the fun things about the median-of-medians algorithm is its completely star-studded author list. Manuel Blum - Turing award winner in 1995 Robert Floyd - Turing award winner in 1978 Ron Rivest - Turing award winner in 2002 Bob Tarjan
3.
▲
by
kwantam
2y ago
Great stuff dga :) Turns out, Niall was also involved in one of the winning ZPrize submissions for fast multi-scalar multiplication (closely related to batch modexp, although over an elliptic curve rather than mod a prime); I assume it inhe
4.
▲
by
kwantam
2y ago
Maybe we're looking at different things, but the link appears to discuss ElGamal encryption, which is discrete log based (which means modern implementations use elliptic curves; historically it would have been discrete log in a subgrou
5.
▲
by
kwantam
2y ago
Excellent points all around, and thank you for the pointer to the ECC slides :) (And indeed, nature could have been kinder to us and given us a Mersenne between 127 and 521...)
6.
▲
by
kwantam
2y ago
EdDSA signatures are specified to use deterministic nonce generation, so you're correct that they do not require randomness. But they certainly do require modular arithmetic in order to implement the elliptic curve operations!
7.
▲
by
kwantam
2y ago
RFC6979 attempts to guarantee that the nonce is unbiased (under the assumption that HMAC's output is indistinguishable from random). It's definitely attempting to give a stronger property than simply preventing a repeated nonce. S
8.
▲
by
kwantam
2y ago
The nonce is taken modulo the order of the prime-order subgroup. For DSA that's generally a 256ish-bit prime (e.g.: choose a 1024-bit prime p such that a 256-bit prime q divides p-1; then there exists an order-q subgroup of Zp). For P-
9.
▲
by
kwantam
2y ago
This vulnerability has very little to do with P-521 per se. The issue is with ECDSA: any use of ECDSA with biased nonce generation, regardless of the elliptic curve it's implemented over, immediately causes secret key leakage. (Rant:
10.
▲
by
kwantam
2y ago
I'm sorry to say that your analysis is wildly incorrect. - 10 billion people =~ 2^33 - 1000 CPUs =~ 2^10 - 1024 cores =~ 2^10 - 10 GHz =~ 2^33 So: one second's computation by all of these people is 2^86 UUIDs generated. UUIDs are
11.
▲
by
kwantam
3y ago
The example you give is similar to but not quite the same as "lzAES". The distinction is that in your example, the application is deciding whether to compress or not---the input/output behavior of the cipher doesn't in
12.
▲
by
kwantam
3y ago
Yes, a correct encryption algorithm can encrypt (essentially) any bit string. But it's quite easy to turn a correct encryption algorithm into an incorrect one by bolting on something seemingly innocuous. Here's a concrete example.
13.
▲
by
kwantam
3y ago
Came here to reminisce about the same trick :) After a while we decided that adding one second per login was too subtle... echo "echo sleep 1 >> ~/.login" >> ~/.login
14.
▲
by
kwantam
3y ago
The paper, which is linked from the article, demonstrates a browser "fingerprinting" attack, which is to say, stealing pixels from one iframe using another iframe (which is quite clearly a violation of the safety properties the br
15.
▲
by
kwantam
3y ago
I completely understand your position, and I'm certainly sympathetic that it's often hard to find good instructional materials. I'll readily admit, however, that I do not know Chegg as anything but a way to cheat. It is well
16.
▲
by
kwantam
3y ago
Yes, dc/dc conversion is definitely applicable in high-power applications. As one example, high-voltage DC power transmission [1] is in widespread use globally, and always requires a dc/dc conversion step for connection to local g
17.
▲
by
kwantam
4y ago
Well, for one, UDP brings the U. It's called the User Datagram Protocol because (at least on UNIX-like systems) unprivileged programs can almost always send and receive UDP datagrams, but in general cannot send and receive raw IP datag
18.
▲
by
kwantam
4y ago
Is this a good time to bring up T/TCP? https://www.rfc-editor.org/rfc/rfc1644 This memo specifies T/TCP, an experimental TCP extension for efficient transaction-oriented (request/response) serv
19.
▲
Twitter Headquarters Landlord Sues Elon Musk’s Company, Alleging Unpaid Rent
(wsj.com)
13 points
by
kwantam
4y ago
|
1 comments
20.
▲
by
kwantam
4y ago
Do you have a source for this? I'd really love to read more about it. My impression from Ray's congressional testimony was "FTX.us might be solvent, but we don't know yet because the forensic accountants are still chippi
21.
▲
by
kwantam
4y ago
This is definitely very cool! But the circuit topology here can't meaningfully be called a discrete implementation of an LM386, unless by LM386 we just mean "a two-stage op-amp capable of driving a small speaker." The two cir
22.
▲
by
kwantam
4y ago
Very nice! It turns out that latexmk has this functionality: latexmk -pvc -pdf foo.tex (It can be configured to HUP your pdf reader if needed, too.) I usually add something like this command as the `auto` target in my latex Makefil
23.
▲
by
kwantam
4y ago
Sounds like a great improvement! Would it be possible to contribute your code to the existing crate rather than release your own? Then we could all enjoy the benefits on the next recompile :)
24.
▲
by
kwantam
4y ago
"Pick a random odd number and keep adding 2 until you find a prime" is, perhaps unintuitively, essentially fine for RSA key generation---under mild conditions, the security loss is single-digit bits at best. See Abboud and Prest,
25.
▲
by
kwantam
4y ago
Can you expand on the applicability of Prime and Prejudice [1] to RSA key generation? As far as I can tell, the two have nothing to do with one another. The point of the Prime and Prejudice paper is, in effect, that the Miller-Rabin primali
26.
▲
by
kwantam
4y ago
The general message here is true, but I suspect that your specific example is not. Do you have a citation for the claim that PRIMEINC (generate random odd value, increment by 2 until you find a prime) caused overlapping prime factors? The w
27.
▲
by
kwantam
5y ago
In what sense were they Ukraine's nuclear weapons? They were physically inside Ukraine but controlled by Russia, as the article you linked makes clear.
28.
▲
by
kwantam
5y ago
They are! Inhaled flu vaccines are generally live attenuated virus, which isn't recommended for everyone but is perfectly effective for a large segment of the population: https://www.cdc.gov/flu/prevent/nasals
29.
▲
by
kwantam
5y ago
It's a tempting sound bite, but it's wrong. First, a real vaccine is designed to be much safer than the disease it protects against (compare extremely rare incidence of vaccine side effects with extremely common incidence of hospi
30.
▲
by
kwantam
5y ago
Sorry I left out ZeroCoin, and thanks for pointing it out! Total braino as I was writing the post.
More ›