I'm reading about SRP from this page and came accross the line that says a party computes
v = g^x
I am unfamiliar with reading cryptography texts. Does this mean gx, or g ⊕ x?
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this communityI'm reading about SRP from this page and came accross the line that says a party computes
v = g^x
I am unfamiliar with reading cryptography texts. Does this mean gx, or g ⊕ x?
In SRP, v = g^x means $v = g^x \mod p$, i.e. exponentiation modulo a large prime $p$.
It depends on the context, but later in this paper, the author makes it clear that he is using it to mean exponentiation:
The ``one-way'' verifier-generator P() becomes a modular exponentiation in GF(n):
P(x) = g^x
^
meaning XOR is something common in C-like languages, but not in Math AFAIK. $\endgroup$