String+MD5.swift 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297
  1. //
  2. // String+MD5.swift
  3. // Kingfisher
  4. //
  5. // To date, adding CommonCrypto to a Swift framework is problematic. See:
  6. // http://stackoverflow.com/questions/25248598/importing-commoncrypto-in-a-swift-framework
  7. // We're using a subset and modified version of CryptoSwift as an alternative.
  8. // The following is an altered source version that only includes MD5. The original software can be found at:
  9. // https://github.com/krzyzanowskim/CryptoSwift
  10. // This is the original copyright notice:
  11. /*
  12. Copyright (C) 2014 Marcin Krzyżanowski <marcin.krzyzanowski@gmail.com>
  13. This software is provided 'as-is', without any express or implied warranty.
  14. In no event will the authors be held liable for any damages arising from the use of this software.
  15. Permission is granted to anyone to use this software for any purpose,including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
  16. - The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation is required.
  17. - Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
  18. - This notice may not be removed or altered from any source or binary distribution.
  19. */
  20. import Foundation
  21. public struct StringProxy {
  22. fileprivate let base: String
  23. init(proxy: String) {
  24. base = proxy
  25. }
  26. }
  27. extension String: KingfisherCompatible {
  28. public typealias CompatibleType = StringProxy
  29. public var kf: CompatibleType {
  30. return StringProxy(proxy: self)
  31. }
  32. }
  33. extension StringProxy {
  34. var md5: String {
  35. if let data = base.data(using: .utf8, allowLossyConversion: true) {
  36. let message = data.withUnsafeBytes { bytes -> [UInt8] in
  37. return Array(UnsafeBufferPointer(start: bytes, count: data.count))
  38. }
  39. let MD5Calculator = MD5(message)
  40. let MD5Data = MD5Calculator.calculate()
  41. var MD5String = String()
  42. for c in MD5Data {
  43. MD5String += String(format: "%02x", c)
  44. }
  45. return MD5String
  46. } else {
  47. return base
  48. }
  49. }
  50. }
  51. /** array of bytes, little-endian representation */
  52. func arrayOfBytes<T>(_ value: T, length: Int? = nil) -> [UInt8] {
  53. let totalBytes = length ?? (MemoryLayout<T>.size * 8)
  54. let valuePointer = UnsafeMutablePointer<T>.allocate(capacity: 1)
  55. valuePointer.pointee = value
  56. let bytes = valuePointer.withMemoryRebound(to: UInt8.self, capacity: totalBytes) { (bytesPointer) -> [UInt8] in
  57. var bytes = [UInt8](repeating: 0, count: totalBytes)
  58. for j in 0..<min(MemoryLayout<T>.size, totalBytes) {
  59. bytes[totalBytes - 1 - j] = (bytesPointer + j).pointee
  60. }
  61. return bytes
  62. }
  63. #if swift(>=4.1)
  64. valuePointer.deinitialize(count: 1)
  65. valuePointer.deallocate()
  66. #else
  67. valuePointer.deinitialize()
  68. valuePointer.deallocate(capacity: 1)
  69. #endif
  70. return bytes
  71. }
  72. extension Int {
  73. /** Array of bytes with optional padding (little-endian) */
  74. func bytes(_ totalBytes: Int = MemoryLayout<Int>.size) -> [UInt8] {
  75. return arrayOfBytes(self, length: totalBytes)
  76. }
  77. }
  78. extension NSMutableData {
  79. /** Convenient way to append bytes */
  80. func appendBytes(_ arrayOfBytes: [UInt8]) {
  81. append(arrayOfBytes, length: arrayOfBytes.count)
  82. }
  83. }
  84. protocol HashProtocol {
  85. var message: Array<UInt8> { get }
  86. /** Common part for hash calculation. Prepare header data. */
  87. func prepare(_ len: Int) -> Array<UInt8>
  88. }
  89. extension HashProtocol {
  90. func prepare(_ len: Int) -> Array<UInt8> {
  91. var tmpMessage = message
  92. // Step 1. Append Padding Bits
  93. tmpMessage.append(0x80) // append one bit (UInt8 with one bit) to message
  94. // append "0" bit until message length in bits ≡ 448 (mod 512)
  95. var msgLength = tmpMessage.count
  96. var counter = 0
  97. while msgLength % len != (len - 8) {
  98. counter += 1
  99. msgLength += 1
  100. }
  101. tmpMessage += Array<UInt8>(repeating: 0, count: counter)
  102. return tmpMessage
  103. }
  104. }
  105. func toUInt32Array(_ slice: ArraySlice<UInt8>) -> Array<UInt32> {
  106. var result = Array<UInt32>()
  107. result.reserveCapacity(16)
  108. for idx in stride(from: slice.startIndex, to: slice.endIndex, by: MemoryLayout<UInt32>.size) {
  109. let d0 = UInt32(slice[idx.advanced(by: 3)]) << 24
  110. let d1 = UInt32(slice[idx.advanced(by: 2)]) << 16
  111. let d2 = UInt32(slice[idx.advanced(by: 1)]) << 8
  112. let d3 = UInt32(slice[idx])
  113. let val: UInt32 = d0 | d1 | d2 | d3
  114. result.append(val)
  115. }
  116. return result
  117. }
  118. struct BytesIterator: IteratorProtocol {
  119. let chunkSize: Int
  120. let data: [UInt8]
  121. init(chunkSize: Int, data: [UInt8]) {
  122. self.chunkSize = chunkSize
  123. self.data = data
  124. }
  125. var offset = 0
  126. mutating func next() -> ArraySlice<UInt8>? {
  127. let end = min(chunkSize, data.count - offset)
  128. let result = data[offset..<offset + end]
  129. offset += result.count
  130. return result.count > 0 ? result : nil
  131. }
  132. }
  133. struct BytesSequence: Sequence {
  134. let chunkSize: Int
  135. let data: [UInt8]
  136. func makeIterator() -> BytesIterator {
  137. return BytesIterator(chunkSize: chunkSize, data: data)
  138. }
  139. }
  140. func rotateLeft(_ value: UInt32, bits: UInt32) -> UInt32 {
  141. return ((value << bits) & 0xFFFFFFFF) | (value >> (32 - bits))
  142. }
  143. class MD5: HashProtocol {
  144. static let size = 16 // 128 / 8
  145. let message: [UInt8]
  146. init (_ message: [UInt8]) {
  147. self.message = message
  148. }
  149. /** specifies the per-round shift amounts */
  150. private let shifts: [UInt32] = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
  151. 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
  152. 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
  153. 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]
  154. /** binary integer part of the sines of integers (Radians) */
  155. private let sines: [UInt32] = [0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
  156. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  157. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  158. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  159. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
  160. 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  161. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  162. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  163. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
  164. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  165. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
  166. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  167. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
  168. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  169. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  170. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391]
  171. private let hashes: [UInt32] = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]
  172. func calculate() -> [UInt8] {
  173. var tmpMessage = prepare(64)
  174. tmpMessage.reserveCapacity(tmpMessage.count + 4)
  175. // hash values
  176. var hh = hashes
  177. // Step 2. Append Length a 64-bit representation of lengthInBits
  178. let lengthInBits = (message.count * 8)
  179. let lengthBytes = lengthInBits.bytes(64 / 8)
  180. tmpMessage += lengthBytes.reversed()
  181. // Process the message in successive 512-bit chunks:
  182. let chunkSizeBytes = 512 / 8 // 64
  183. for chunk in BytesSequence(chunkSize: chunkSizeBytes, data: tmpMessage) {
  184. // break chunk into sixteen 32-bit words M[j], 0 ≤ j ≤ 15
  185. var M = toUInt32Array(chunk)
  186. assert(M.count == 16, "Invalid array")
  187. // Initialize hash value for this chunk:
  188. var A: UInt32 = hh[0]
  189. var B: UInt32 = hh[1]
  190. var C: UInt32 = hh[2]
  191. var D: UInt32 = hh[3]
  192. var dTemp: UInt32 = 0
  193. // Main loop
  194. for j in 0 ..< sines.count {
  195. var g = 0
  196. var F: UInt32 = 0
  197. switch j {
  198. case 0...15:
  199. F = (B & C) | ((~B) & D)
  200. g = j
  201. break
  202. case 16...31:
  203. F = (D & B) | (~D & C)
  204. g = (5 * j + 1) % 16
  205. break
  206. case 32...47:
  207. F = B ^ C ^ D
  208. g = (3 * j + 5) % 16
  209. break
  210. case 48...63:
  211. F = C ^ (B | (~D))
  212. g = (7 * j) % 16
  213. break
  214. default:
  215. break
  216. }
  217. dTemp = D
  218. D = C
  219. C = B
  220. B = B &+ rotateLeft((A &+ F &+ sines[j] &+ M[g]), bits: shifts[j])
  221. A = dTemp
  222. }
  223. hh[0] = hh[0] &+ A
  224. hh[1] = hh[1] &+ B
  225. hh[2] = hh[2] &+ C
  226. hh[3] = hh[3] &+ D
  227. }
  228. var result = [UInt8]()
  229. result.reserveCapacity(hh.count / 4)
  230. hh.forEach {
  231. let itemLE = $0.littleEndian
  232. let r1 = UInt8(itemLE & 0xff)
  233. let r2 = UInt8((itemLE >> 8) & 0xff)
  234. let r3 = UInt8((itemLE >> 16) & 0xff)
  235. let r4 = UInt8((itemLE >> 24) & 0xff)
  236. result += [r1, r2, r3, r4]
  237. }
  238. return result
  239. }
  240. }