How realistic is a dictionary attack on a secure remote password protocol (SRP) verifier? @GrantBlahaErath: Well, because g is a generator of the entire group (that's one of the requirements of SRP), then it turns out the set of v is precisely the set of x; that is, g^x != g^x' (mod n) for any x != x' (mod n-1). In any case, attackers normally don't have direct access to either x, v, or the common value; hence they can't use these formulas directly in a dictionary attack (like they can with straight-forward shared secret models).
Block ordering and security in a MAC? Hint: suppose an attacker saw the value message $r||m_1||m_2||m_3||t$, and modified it into the message $r||m_2||m_1||m_3||t$; would the modified message still have a valid tag?
meta user
network profile
