Last active
March 31, 2020 11:47
-
-
Save bradparker/ee966655ede018faec9b7d292d588c91 to your computer and use it in GitHub Desktop.
WebCrypto based SRP
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<title>SRP</title> | |
<meta charset="utf8" /> | |
</head> | |
<body> | |
<script type="module"> | |
import { modPow } from "https://unpkg.com/[email protected]/src/main.js"; | |
const main = async () => { | |
const N = BigInt( | |
`0x | |
FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1 29024E08 | |
8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD EF9519B3 CD3A431B | |
302B0A6D F25F1437 4FE1356D 6D51C245 E485B576 625E7EC6 F44C42E9 | |
A637ED6B 0BFF5CB6 F406B7ED EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 | |
49286651 ECE45B3D C2007CB8 A163BF05 98DA4836 1C55D39A 69163FA8 | |
FD24CF5F 83655D23 DCA3AD96 1C62F356 208552BB 9ED52907 7096966D | |
670C354E 4ABC9804 F1746C08 CA18217C 32905E46 2E36CE3B E39E772C | |
180E8603 9B2783A2 EC07A28F B5C55DF0 6F4C52C9 DE2BCBF6 95581718 | |
3995497C EA956AE5 15D22618 98FA0510 15728E5A 8AAAC42D AD33170D | |
04507A33 A85521AB DF1CBA64 ECFB8504 58DBEF0A 8AEA7157 5D060C7D | |
B3970F85 A6E1E4C7 ABF5AE8C DB0933D7 1E8C94E0 4A25619D CEE3D226 | |
1AD2EE6B F12FFA06 D98A0864 D8760273 3EC86A64 521F2B18 177B200C | |
BBE11757 7A615D6C 770988C0 BAD946E2 08E24FA0 74E5AB31 43DB5BFC | |
E0FD108E 4B82D120 A9210801 1A723C12 A787E6D7 88719A10 BDBA5B26 | |
99C32718 6AF4E23C 1A946834 B6150BDA 2583E9CA 2AD44CE8 DBBBC2DB | |
04DE8EF9 2E8EFC14 1FBECAA6 287C5947 4E6BC05D 99B2964F A090C3A2 | |
233BA186 515BE7ED 1F612970 CEE2D7AF B81BDD76 2170481C D0069127 | |
D5B05AA9 93B4EA98 8D8FDDC1 86FFB7DC 90A6C08F 4DF435C9 34063199 | |
FFFFFFFF FFFFFFFF | |
`.replace(/\s/g, "") | |
); | |
const g = 5n; | |
const H_id = "SHA-256"; | |
const stringToBigInt = (str) => | |
byteArrayToBigInt(new TextEncoder("utf8").encode(str)); | |
const byteArrayToBigInt = (arr) => | |
arr.reduce((acc, n) => acc * 256n + BigInt(n), 0n); | |
const bigIntToByteArray = (int) => { | |
let n = int; | |
let result = []; | |
while (n !== 0n) { | |
result.push(n % 256n); | |
n = n / 256n; | |
} | |
return Uint8Array.from(result.reverse(), Number); | |
}; | |
const concat = (a, b) => { | |
const c = new Uint8Array(a.length + b.length); | |
c.set(a); | |
c.set(b, a.length); | |
return c; | |
}; | |
const H = async (...ns) => | |
byteArrayToBigInt( | |
new Uint8Array( | |
await crypto.subtle.digest( | |
H_id, | |
ns.map(bigIntToByteArray).reduce(concat) | |
) | |
) | |
); | |
const random = (size) => | |
byteArrayToBigInt(crypto.getRandomValues(new Uint8Array(size))); | |
// Register user | |
const username = "brad"; | |
const password = "Foobar123"; | |
const I = stringToBigInt(username); | |
const p = stringToBigInt(password); | |
const s = random(16); | |
const x = await H(s, p); | |
const v = modPow(g, x, N); | |
// Create and verify session | |
const k = await H(N, g); | |
// User | |
const a = random(32); | |
const A = modPow(g, a, N); | |
// Server | |
if (A % N === 0n) { | |
throw new Error("A (mod N) cannot be 0n"); | |
} | |
const b = random(32); | |
const B = k * v + modPow(g, b, N); | |
// Both | |
const u = await H(A, B); | |
// User | |
if (B % N == 0n) { | |
throw new Error("B (mod N) cannot be 0n"); | |
} | |
const user_S = modPow(B - k * modPow(g, x, N), a + u * x, N); | |
const user_K = await H(user_S); | |
// Server | |
const server_S = modPow(A * modPow(v, u, N), b, N); | |
const server_K = await H(server_S); | |
// Client | |
const M = await H( | |
(await H(N)) ^ (await H(g)), | |
await H(I), | |
s, | |
A, | |
B, | |
user_K | |
); | |
const serverProof = await H(A, M, server_K); | |
const userProof = await H(A, M, user_K); | |
console.log(serverProof, userProof); | |
console.log(serverProof === userProof); | |
}; | |
main(); | |
</script> | |
</body> | |
</html> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment