Reputation
Next tag badge:
119/100 score
19/20 answers
Badges
6 79 150
Impact
~791k people reached

Oct
23
comment Interpretation of the results of NIST (p)NRG suite
Here it is the other way round. Usually, in statistics, you want to detect a non-random effect (e.g. a correlation between a specific gene mutation and a given illness), so you want a small p-value, that would mean "no way this is pure luck, there must be some correlation". Here we really don't want correlations or biases, so we want big p-values.
Oct
23
answered Interpretation of the results of NIST (p)NRG suite
Oct
21
awarded  Nice Answer
Oct
17
answered MD5 update functions
Oct
8
awarded  Enlightened
Oct
8
awarded  Nice Answer
Oct
7
awarded  Nice Answer
Sep
30
awarded  Explainer
Sep
18
comment What is the length of an RSA signature?
That trick can be extended; e.g. you can skip a complete byte (8 bits) if the verifier is ready to compute 256 RSA verifications, while it is trying to guess the missing bits. Maybe more importantly, in ISO/IEC 9796-2, part of the signed data can be embedded "for free" in the signature, so while the signature value has size $n$ bits (or $n-1$ with the trick you describe), the overhead implied by the presence of the signature can be substantially smaller, depending on the situation.
Sep
7
awarded  Good Answer
Sep
5
awarded  Nice Answer
Aug
26
awarded  Enlightened
Aug
26
awarded  Nice Answer
Aug
25
comment Efficiently map $2^n$ unique 64-bit vectors to $2^n$ $n$-bit vectors where $n < 64$?
If all possible inputs are known a priori then you can put 64 million entries into exactly 64 million buckets with no collision -- but the mapping will have to know the 64 million entries. And the gist of my answer is that this cannot, in general, be done without using enough ROM or RAM to actually encode the 64 million possible values one way or another.
Aug
23
answered Efficiently map $2^n$ unique 64-bit vectors to $2^n$ $n$-bit vectors where $n < 64$?
Aug
18
awarded  Enlightened
Aug
18
awarded  Nice Answer
Aug
14
answered Why can't you decrypt an encrypted message with just the public key?
Aug
13
awarded  Nice Answer
Aug
13
answered How is SHA1 different from MD5?