I covered the following topics:
Digital signatures - finite fields, elliptic curves, Schnorr signatures and ECDSA
- The slide on Cyclic Groups said “The integers modulo p for any number p is a cyclic group”. It should say “The integers modulo p for any prime p is a cyclic group”. (If p is composite, ie p = ab, then the order of a in G is b, so G is not cyclic).
- during the talk, I was asked “how does the verifier know
Kin the non-interactive schnorr identification protocol?” I said that
Kcan be provided by the prover. That’s wrong. In fact, the verifier calculates
Khimself and then checks that
eis the hash of
K. The verification step is checking that
edoes in fact commit to
The slides above are corrected.