Computer Science Professor at University of Chicago. Researcher in cryptography and computer security. I use multiplicative notation for cryptographic groups.
Hi Crypto-Twitter,
Can anyone explain the rationale of the padding string (PS) in PKCS#1 v1.5 RSA signatures? Is there an attack if we simply pad with all zeros (i.e. just sign the bare digest)? Do the FF bytes just give us a warm fuzzy feeling?
Sincerely,
stumped instructor
@ChrisPeikert Is it because you need to require that exactly two edges intersect at each vertex? Or exclude donut-like shapes and disconnected regions or something?
@stochastician Growing up (80s/90s), talking on the phone was actually better than talking in person sometimes. It felt like latency on the phone was less than latency across a room.
Here are some problems with private contact tracing. We should not give policymakers the false hope that they can avoid hard choices: https://t.co/HYq9DzuIK6
@stochastician Indeed... the IT is generally great here, but occasionally there's a wart or two.
And Hi! I think you can see at least two CS people and one physics person that you know from your place.
@LindellYehuda@koeppelmann I think this is a thing, called group testing (https://t.co/fVBx9xVdHF). I recall that the hardness of some version of the problem implies PKE.
@GarbledCircus If I have time, I also hope to make an assignment to forge a cert that verifies under an (old) vulnerable version of openssl (https://t.co/sXzxUgUOei).
In general, exposing students to the reality ASN.1 and C implementation issues has a lot of education value.
@GarbledCircus For the next fall I plan to develop a problem based on https://t.co/t1WcKHykMX and another on the old bad deterministic implementation Miller-Rabin. Both require a good understanding of the basic number theory.