block.go 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  1. // Copyright 2010 The Go Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style
  3. // license that can be found in the LICENSE file.
  4. package blowfish
  5. // ExpandKey performs a key expansion on the given *Cipher. Specifically, it
  6. // performs the Blowfish algorithm's key schedule which sets up the *Cipher's
  7. // pi and substitution tables for calls to Encrypt. This is used, primarily,
  8. // by the bcrypt package to reuse the Blowfish key schedule during its
  9. // set up. It's unlikely that you need to use this directly.
  10. func ExpandKey(key []byte, c *Cipher) {
  11. j := 0
  12. for i := 0; i < 18; i++ {
  13. var d uint32
  14. for k := 0; k < 4; k++ {
  15. d = d<<8 | uint32(key[j])&0x000000FF
  16. j++
  17. if j >= len(key) {
  18. j = 0
  19. }
  20. }
  21. c.p[i] ^= d
  22. }
  23. var l, r uint32
  24. for i := 0; i < 18; i += 2 {
  25. l, r = encryptBlock(l, r, c)
  26. c.p[i], c.p[i+1] = l, r
  27. }
  28. for i := 0; i < 256; i += 2 {
  29. l, r = encryptBlock(l, r, c)
  30. c.s0[i], c.s0[i+1] = l, r
  31. }
  32. for i := 0; i < 256; i += 2 {
  33. l, r = encryptBlock(l, r, c)
  34. c.s1[i], c.s1[i+1] = l, r
  35. }
  36. for i := 0; i < 256; i += 2 {
  37. l, r = encryptBlock(l, r, c)
  38. c.s2[i], c.s2[i+1] = l, r
  39. }
  40. for i := 0; i < 256; i += 2 {
  41. l, r = encryptBlock(l, r, c)
  42. c.s3[i], c.s3[i+1] = l, r
  43. }
  44. }
  45. // This is similar to ExpandKey, but folds the salt during the key
  46. // schedule. While ExpandKey is essentially expandKeyWithSalt with an all-zero
  47. // salt passed in, reusing ExpandKey turns out to be a place of inefficiency
  48. // and specializing it here is useful.
  49. func expandKeyWithSalt(key []byte, salt []byte, c *Cipher) {
  50. j := 0
  51. expandedKey := make([]uint32, 18)
  52. for i := 0; i < 18; i++ {
  53. var d uint32
  54. for k := 0; k < 4; k++ {
  55. d = d<<8 | uint32(key[j])&0x000000FF
  56. j++
  57. if j >= len(key) {
  58. j = 0
  59. }
  60. }
  61. expandedKey[i] = d
  62. c.p[i] ^= d
  63. }
  64. j = 0
  65. expandedSalt := make([]uint32, 18)
  66. for i := 0; i < 18; i++ {
  67. var d uint32
  68. for k := 0; k < 4; k++ {
  69. d = d<<8 | uint32(salt[j])&0x000000FF
  70. j++
  71. if j >= len(salt) {
  72. j = 0
  73. }
  74. }
  75. expandedSalt[i] = d
  76. }
  77. var l, r uint32
  78. for i := 0; i < 18; i += 2 {
  79. l ^= expandedSalt[i&2]
  80. r ^= expandedSalt[(i&2)+1]
  81. l, r = encryptBlock(l, r, c)
  82. c.p[i], c.p[i+1] = l, r
  83. }
  84. for i := 0; i < 256; i += 4 {
  85. l ^= expandedSalt[2]
  86. r ^= expandedSalt[3]
  87. l, r = encryptBlock(l, r, c)
  88. c.s0[i], c.s0[i+1] = l, r
  89. l ^= expandedSalt[0]
  90. r ^= expandedSalt[1]
  91. l, r = encryptBlock(l, r, c)
  92. c.s0[i+2], c.s0[i+3] = l, r
  93. }
  94. for i := 0; i < 256; i += 4 {
  95. l ^= expandedSalt[2]
  96. r ^= expandedSalt[3]
  97. l, r = encryptBlock(l, r, c)
  98. c.s1[i], c.s1[i+1] = l, r
  99. l ^= expandedSalt[0]
  100. r ^= expandedSalt[1]
  101. l, r = encryptBlock(l, r, c)
  102. c.s1[i+2], c.s1[i+3] = l, r
  103. }
  104. for i := 0; i < 256; i += 4 {
  105. l ^= expandedSalt[2]
  106. r ^= expandedSalt[3]
  107. l, r = encryptBlock(l, r, c)
  108. c.s2[i], c.s2[i+1] = l, r
  109. l ^= expandedSalt[0]
  110. r ^= expandedSalt[1]
  111. l, r = encryptBlock(l, r, c)
  112. c.s2[i+2], c.s2[i+3] = l, r
  113. }
  114. for i := 0; i < 256; i += 4 {
  115. l ^= expandedSalt[2]
  116. r ^= expandedSalt[3]
  117. l, r = encryptBlock(l, r, c)
  118. c.s3[i], c.s3[i+1] = l, r
  119. l ^= expandedSalt[0]
  120. r ^= expandedSalt[1]
  121. l, r = encryptBlock(l, r, c)
  122. c.s3[i+2], c.s3[i+3] = l, r
  123. }
  124. }
  125. func encryptBlock(l, r uint32, c *Cipher) (uint32, uint32) {
  126. xl, xr := l, r
  127. xl ^= c.p[0]
  128. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[1]
  129. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[2]
  130. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[3]
  131. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[4]
  132. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[5]
  133. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[6]
  134. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[7]
  135. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[8]
  136. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[9]
  137. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[10]
  138. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[11]
  139. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[12]
  140. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[13]
  141. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[14]
  142. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[15]
  143. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[16]
  144. xr ^= c.p[17]
  145. return xr, xl
  146. }
  147. func decryptBlock(l, r uint32, c *Cipher) (uint32, uint32) {
  148. xl, xr := l, r
  149. xl ^= c.p[17]
  150. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[16]
  151. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[15]
  152. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[14]
  153. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[13]
  154. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[12]
  155. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[11]
  156. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[10]
  157. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[9]
  158. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[8]
  159. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[7]
  160. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[6]
  161. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[5]
  162. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[4]
  163. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[3]
  164. xr ^= ((c.s0[byte(xl>>24)] + c.s1[byte(xl>>16)]) ^ c.s2[byte(xl>>8)]) + c.s3[byte(xl)] ^ c.p[2]
  165. xl ^= ((c.s0[byte(xr>>24)] + c.s1[byte(xr>>16)]) ^ c.s2[byte(xr>>8)]) + c.s3[byte(xr)] ^ c.p[1]
  166. xr ^= c.p[0]
  167. return xr, xl
  168. }
  169. func zero(x []uint32) {
  170. for i := range x {
  171. x[i] = 0
  172. }
  173. }