Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Perseids
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
46 ms
·
391.
▲
by
Perseids
13y ago
It is even more complex as the width of a text in most fonts also varies with the specific order of the characters because of kerning (VAI takes less space than VIA, because the A is placed closer to the V in former) and ligatures (for exam
392.
▲
by
Perseids
13y ago
There are very different learning types. I for one am very bad at memorizing facts and forget them quite fast after not using them any more, no matter at which age I learned them first. Concerning mental arithmetic, I was quite good in 5th
393.
▲
by
Perseids
13y ago
Where can I download a pretty printed source? I was curious about your AES-CTR implementation.
394.
▲
by
Perseids
13y ago
Hi! What version of Keccak do you use? Sha3 isn't standardized yet and it seems like they will be changing some details of the original proposition.
395.
▲
by
Perseids
13y ago
CCM is short for "Counter with CBC-MAC". I does also MAC the encrypted data and is equally slow as using a cipher and HMAC on top of it. A real speed improvement would be the Galois Counter Mode.
396.
▲
by
Perseids
13y ago
I may be a bit pedantic, but please don't use "encode" when you mean "encrypt". These words describe two quite different concepts and guarantees. Exchanging them the other way around produces catastrophic results li
397.
▲
by
Perseids
13y ago
To generate a secure 2048 bit RSA key (or ElGamal or whatever) you do not need 2048 bit truly random data. RSA keys are generated like this: 1) Choose 1024 random bits. 2) Set the first and last bit to "1". 3) Check if the genera
398.
▲
by
Perseids
13y ago
"Inferior" is probably really bad wording. Let's say "more advanced". If you know C++ you will have no problem accommodating with C if it better fits your need. If you know Scala you can still program in Java if you
399.
▲
by
Perseids
13y ago
Do phone numbers really cost anything in the US? Or is there an upper limit to the length of a phone number? Otherwise, they can just allocate a million which would be enough to have a grace period of at least a year until phone numbers wo
400.
▲
by
Perseids
13y ago
> But for many user input data, there is a point at which a longer value is complete nonsense. The reason I still prefer arbitrary length fields is that I otherwise have to determine the limit myself. And finding reasonable limits isn&#x
401.
▲
by
Perseids
13y ago
Where do you see this? In https://github.com/django/django/commit/aae5a96d5754ad34e48b... they specifically mention bytes.
402.
▲
by
Perseids
13y ago
Specifically with UTF-8 it depends on the content how many characters fit in these 4096 bytes.
403.
▲
by
Perseids
13y ago
As far as I have followed the discussion there are no hard facts or claims at all, just the general suspicion against a completely closed system of an US company. I, too, don't believe that Intel adaptively generates its RNG to spoil t
404.
▲
by
Perseids
13y ago
> And I'm not ranting Sorry if I offended you. I'm still surprised that poses a challenge for your applications. I thought fast non-cryptographic RNGs were a solved problem. How much random data do you generate? If you use a si
405.
▲
by
Perseids
13y ago
You think 500MB/s [1] is slow? Or are you concerned with the latency of each call? Also I don't understand why you rant against PRNGs. Do you know that this stretching of actual random data makes RDRAND considerable faster than us
406.
▲
by
Perseids
13y ago
Why should the CPU not have an internal counter that is backed up in flash memory between reboots? 128bit would be enough, with the highest bits set to the processor serial number. Using this counter in AES-CTR mode – i.e. encrypt the count
407.
▲
by
Perseids
13y ago
I would agree with you if the Linux RNG was build according to common cryptographic wisdom. But as far as I can tell by reading the article the random sources are compressed in a common randomness pool using CRC. If RDRAND was added to this
408.
▲
by
Perseids
13y ago
Actually that is quite simple. For simplicity let us assume RDRAND will only attack the Linux RNG. Now RDRAND first generates its own weak random stream w_k. When it predicts that Linux will generate l_k it outputs l_k xor w_k thus the fina