Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

New answers tagged

0 votes

Why $1\leq r\leq p-1$ verification is needed for (hashed) Elgamal signature?

This attack requires that r'=ru mod p-1 and r'=r mod p. If r' were less than p-1, it would have to be that r'=r=ru over the integers (no modulus), which is unlikely as u is computed from two hashed ...
Grifball's user avatar
  • 171

Top 50 recent answers are included