@cccpresser cryptography, basically, is doing math with input data, and a secret number. You want secret number to be big and random, so no one could guess it and undo your math
number 4 is, obviously, neither big nor very random...
@cccpresser cryptography, basically, is doing math with input data, and a secret number. You want secret number to be big and random, so no one could guess it and undo your math
number 4 is, obviously, neither big nor very random...
I'm no expert so tell me where I'm wrong:
1. If you have a large range from which to choose a number randomly then 4 is entirely possible.
2. The criterion is a number hard to factor.
Is that right?
@rzeta0
I don't think factoring is relevant here -- it's not RSA, it's a different annoying function to invert -- but I do think that ending up with such a distinctive number 4 seems unlikely to have been random.
@rzeta0 @mo @cccpresser 2 is only true for RSA keys, this is ECDSA
@mo @cccpresser @q strictly speaking, 4 is exactly as random as any n such that n is a member of the set of natural numbers.
But it's not exactly as likely to be tested by an adversary as any other..
@simon_brooke it's random but it's easy to guess.
Realistically you want a certain size requirement here, just like you don't pick small primes with RSA, no matter how random they are.
@mxk @simon_brooke
OMG is this literally a realisation of this old joke in real life?
int random() {
// guaranteed random: obtained by dice roll
return 4;
}