fuchsiaaaaaaaaaaaaaaaaa
@videogame_hacker@tech.lgbt smh Bernstein you had one job
@f0x @videogame_hacker it's cause
because
it's 2^130 - 5
because
that's a prime which lets u do this one hack for modular multiplication that cryptographers don't want you to know
where
basically instead of dividing by the modulus you actually multiply (by 5, since it's equivalent) which goes more brr in the cpu
and it allows a message block size of 128 bit since every block has a prepended 1 bit which brings it to 129 bits
and it lets you actually do the math in terms of 5 equal sized 26-bit terms, without the last one being weirdly sized as would be the case if the power of two used weren't an easy multiple, and where adding or multiplying 26 bit numbers fits in 64 bits
so its a bit of a magic prime basically
@haskal @videogame_hacker@tech.lgbt 1312, bonking, hmm i think you're on to something
@f0x @videogame_hacker hmmmmb ctf problem that has you bonk poly1312 where its 2^131-2 which is not prime so i think that means you could bonk it