-
Notifications
You must be signed in to change notification settings - Fork 26
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
acb49c3
commit cbfab55
Showing
48 changed files
with
1,532 additions
and
73 deletions.
There are no files selected for viewing
This file contains 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
This file contains 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
This file contains 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
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,49 @@ | ||
| // | ||
| // PBE.swift | ||
| // SwiftECCTest | ||
| // | ||
| // Created by Leif Ibsen on 21/03/2022. | ||
| // | ||
|
|
||
| // Password based encryption according to [PKCS#5] | ||
| class PBE { | ||
|
|
||
| let hmac: HMac | ||
| let hLen: Int | ||
| let password: Bytes | ||
|
|
||
| init(_ md: MessageDigest, _ password: Bytes) { | ||
| self.hmac = HMac(md, password) | ||
| self.hLen = md.digestLength | ||
| self.password = password | ||
| } | ||
|
|
||
| func F(_ salt: Bytes, _ c: Int, _ i: Int) -> Bytes { | ||
| var F = Bytes(repeating: 0, count: self.hLen) | ||
| var U = salt | ||
| U.append(Byte((i >> 24) & 0xff)) | ||
| U.append(Byte((i >> 16) & 0xff)) | ||
| U.append(Byte((i >> 8) & 0xff)) | ||
| U.append(Byte((i >> 0) & 0xff)) | ||
| for _ in 0 ..< c { | ||
| self.hmac.reset() | ||
| U = self.hmac.doFinal(U) | ||
| for j in 0 ..< self.hLen { | ||
| F[j] ^= U[j] | ||
| } | ||
| } | ||
| return F | ||
| } | ||
|
|
||
| // [PKCS#5] - section 5.2 | ||
| func kdf2(_ salt: Bytes, _ c: Int, _ length: Int) -> Bytes { | ||
| var T: Bytes = [] | ||
| let l = (length + self.hLen - 1) / self.hLen | ||
| for i in 1 ... l { | ||
| T += F(salt, c, i) | ||
| } | ||
| return Bytes(T[0 ..< length]) | ||
| } | ||
|
|
||
| } | ||
|
|
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,106 @@ | ||
| // | ||
| // SHA1.swift | ||
| // SwiftECCTest | ||
| // | ||
| // Created by Leif Ibsen on 22/03/2022. | ||
| // | ||
|
|
||
| class SHA1: MessageDigestImpl { | ||
|
|
||
| var w: Words | ||
|
|
||
| init() { | ||
| self.w = Words(repeating: 0, count: 80) | ||
| } | ||
|
|
||
| func doReset(_ hw: inout Words, _ hl: inout Longs) { | ||
| hw[0] = 0x67452301 | ||
| hw[1] = 0xefcdab89 | ||
| hw[2] = 0x98badcfe | ||
| hw[3] = 0x10325476 | ||
| hw[4] = 0xc3d2e1f0 | ||
| } | ||
|
|
||
| func doBuffer(_ buffer: inout Bytes, _ hw: inout Words, _ hl: inout Longs) { | ||
| for i in 0 ..< w.count { | ||
| w[i] = 0 | ||
| } | ||
| for i in 0 ..< 16 { | ||
| let index = 4 * i | ||
| let w0 = Word(buffer[index]) << 24 | ||
| let w1 = Word(buffer[index + 1]) << 16 | ||
| let w2 = Word(buffer[index + 2]) << 8 | ||
| let w3 = Word(buffer[index + 3]) | ||
| w[i] = w0 | w1 | w2 | w3 | ||
| } | ||
| for i in 16 ..< 80 { | ||
| w[i] = SHA1.rotateLeft(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16], 1) | ||
| } | ||
| var a = hw[0] | ||
| var b = hw[1] | ||
| var c = hw[2] | ||
| var d = hw[3] | ||
| var e = hw[4] | ||
|
|
||
| var f: Word | ||
| var k: Word | ||
| for i in 0 ..< 80 { | ||
| if i < 20 { | ||
| f = (b & c) | ((~b) & d) | ||
| k = 0x5a827999 | ||
| } else if i < 40 { | ||
| f = b ^ c ^ d | ||
| k = 0x6ed9eba1 | ||
| } else if i < 60 { | ||
| f = (b & c) | (b & d) | (c & d) | ||
| k = 0x8f1bbcdc | ||
| } else { | ||
| f = b ^ c ^ d | ||
| k = 0xca62c1d6 | ||
| } | ||
| let temp = SHA1.rotateLeft(a, 5) &+ f &+ e &+ k &+ w[i] | ||
| e = d | ||
| d = c | ||
| c = SHA1.rotateLeft(b, 30) | ||
| b = a | ||
| a = temp | ||
| } | ||
| hw[0] &+= a | ||
| hw[1] &+= b | ||
| hw[2] &+= c | ||
| hw[3] &+= d | ||
| hw[4] &+= e | ||
| } | ||
|
|
||
| func padding(_ totalBytes: Int, _ blockSize: Int) -> Bytes { | ||
| return SHA1.doPadding(totalBytes, blockSize) | ||
| } | ||
|
|
||
| static func doPadding(_ totalBytes: Int, _ blockSize: Int) -> Bytes { | ||
| var l = totalBytes * 8 | ||
| let x = ((totalBytes + 8 + blockSize) / blockSize) * blockSize - totalBytes | ||
| var b = Bytes(repeating: 0, count: x) | ||
| b[0] = 0x80 | ||
| b[x - 1] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 2] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 3] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 4] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 5] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 6] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 7] = Byte(l & 0xff) | ||
| l >>= 8 | ||
| b[x - 8] = Byte(l & 0xff) | ||
| return b | ||
| } | ||
|
|
||
| static func rotateLeft(_ x: Word, _ n: Int) -> Word { | ||
| return (x << n) | (x >> (32 - n)) | ||
| } | ||
|
|
||
| } |
Oops, something went wrong.