On Tue, Apr 1, 2014 at 10:07 AM, Harald M. <notifications@github.com> wrote:

> In Crypto101.org:
>
> > @@ -3301,6 +3304,7 @@ of the message $m$:
> >  r = g^k \pmod q
> >  \]
> >  #+END_LATEX
> > +# **HMM** I can only compare this with Wikipedia - there, it says that r = (g^k \pmod p) \pmod q
>
> Counter example, if I didn't botch up somewhere:
>
> p = 23
> q = 11 (so p-1=22 = 2*11)
>
> g = 4
> Actually, g has multiplicative order 11 modulo 23, as 4^11 == 1 (mod 23),
> but no smaller power of 4 is 1 (mod 23).
>
Isn't that what you want to happen?


> Select k=3.
>
> Now,
> 4^3 mod 11 = 64 mod 11 = 9
> (4^3 mod 23) mod 11 = (64 mod 23) mod 11 = 18 mod 11 = 7
>
> QED, as they say ...
>

Okay, fair enough, looks like it was wrong :) Thanks!


>  --
> Reply to this email directly or view it on GitHub<https://github.com/crypto101/book/pull/155/files#r11150881>
> .
>