aboutsummaryrefslogtreecommitdiffstats
path: root/lib/crypto/ebin
diff options
context:
space:
mode:
authorPaul Guyot <[email protected]>2014-05-15 16:29:34 +0200
committerPaul Guyot <[email protected]>2014-05-15 16:38:12 +0200
commiteee8d83ad1766b038b16102eb2006eaa7c21b4e5 (patch)
treec8f7734ed17a3f1dab16be45c8b2215be60e897a /lib/crypto/ebin
parent5ade234d37600ea80dbb309f431c615937ea253d (diff)
downloadotp-eee8d83ad1766b038b16102eb2006eaa7c21b4e5.tar.gz
otp-eee8d83ad1766b038b16102eb2006eaa7c21b4e5.tar.bz2
otp-eee8d83ad1766b038b16102eb2006eaa7c21b4e5.zip
Fix bug in SRP implementation
SRP didn't work with smaller primes as user secret was improperly computed. Formula is: (B - (k * g^x)) ^ (a + (u * x)) % N Previously, the code computed a + (u * x) % N instead of a + (u * x). a typically is a 256 bits random number (RFC 5054 says it should be at least 256 bits), u and x are SHA1 signatures (160 bits). So a + (u * x) can differ from a + (u * x) % N for N primes smaller than 320 bits.
Diffstat (limited to 'lib/crypto/ebin')
0 files changed, 0 insertions, 0 deletions