keytab.go 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459
  1. // Package keytab implements Kerberos keytabs: https://web.mit.edu/kerberos/krb5-devel/doc/formats/keytab_file_format.html.
  2. package keytab
  3. import (
  4. "bytes"
  5. "encoding/binary"
  6. "errors"
  7. "fmt"
  8. "io"
  9. "io/ioutil"
  10. "time"
  11. "unsafe"
  12. "gopkg.in/jcmturner/gokrb5.v7/types"
  13. )
  14. const (
  15. keytabFirstByte byte = 05
  16. )
  17. // Keytab struct.
  18. type Keytab struct {
  19. version uint8
  20. Entries []entry
  21. }
  22. // Keytab entry struct.
  23. type entry struct {
  24. Principal principal
  25. Timestamp time.Time
  26. KVNO8 uint8
  27. Key types.EncryptionKey
  28. KVNO uint32
  29. }
  30. // Keytab entry principal struct.
  31. type principal struct {
  32. NumComponents int16
  33. Realm string
  34. Components []string
  35. NameType int32
  36. }
  37. // New creates new, empty Keytab type.
  38. func New() *Keytab {
  39. var e []entry
  40. return &Keytab{
  41. version: 0,
  42. Entries: e,
  43. }
  44. }
  45. // GetEncryptionKey returns the EncryptionKey from the Keytab for the newest entry with the required kvno, etype and matching principal.
  46. func (kt *Keytab) GetEncryptionKey(princName types.PrincipalName, realm string, kvno int, etype int32) (types.EncryptionKey, error) {
  47. //TODO (theme: KVNO from keytab) this function should return the kvno too
  48. var key types.EncryptionKey
  49. var t time.Time
  50. for _, k := range kt.Entries {
  51. if k.Principal.Realm == realm && len(k.Principal.Components) == len(princName.NameString) &&
  52. k.Key.KeyType == etype &&
  53. (k.KVNO == uint32(kvno) || kvno == 0) &&
  54. k.Timestamp.After(t) {
  55. p := true
  56. for i, n := range k.Principal.Components {
  57. if princName.NameString[i] != n {
  58. p = false
  59. break
  60. }
  61. }
  62. if p {
  63. key = k.Key
  64. t = k.Timestamp
  65. }
  66. }
  67. }
  68. if len(key.KeyValue) < 1 {
  69. return key, fmt.Errorf("matching key not found in keytab. Looking for %v realm: %v kvno: %v etype: %v", princName.NameString, realm, kvno, etype)
  70. }
  71. return key, nil
  72. }
  73. // Create a new Keytab entry.
  74. func newKeytabEntry() entry {
  75. var b []byte
  76. return entry{
  77. Principal: newPrincipal(),
  78. Timestamp: time.Time{},
  79. KVNO8: 0,
  80. Key: types.EncryptionKey{
  81. KeyType: 0,
  82. KeyValue: b,
  83. },
  84. KVNO: 0,
  85. }
  86. }
  87. // Create a new principal.
  88. func newPrincipal() principal {
  89. var c []string
  90. return principal{
  91. NumComponents: 0,
  92. Realm: "",
  93. Components: c,
  94. NameType: 0,
  95. }
  96. }
  97. // Load a Keytab file into a Keytab type.
  98. func Load(ktPath string) (*Keytab, error) {
  99. kt := new(Keytab)
  100. b, err := ioutil.ReadFile(ktPath)
  101. if err != nil {
  102. return kt, err
  103. }
  104. err = kt.Unmarshal(b)
  105. return kt, err
  106. }
  107. // Marshal keytab into byte slice
  108. func (kt *Keytab) Marshal() ([]byte, error) {
  109. b := []byte{keytabFirstByte, kt.version}
  110. for _, e := range kt.Entries {
  111. eb, err := e.marshal(int(kt.version))
  112. if err != nil {
  113. return b, err
  114. }
  115. b = append(b, eb...)
  116. }
  117. return b, nil
  118. }
  119. // Write the keytab bytes to io.Writer.
  120. // Returns the number of bytes written
  121. func (kt *Keytab) Write(w io.Writer) (int, error) {
  122. b, err := kt.Marshal()
  123. if err != nil {
  124. return 0, fmt.Errorf("error marshaling keytab: %v", err)
  125. }
  126. return w.Write(b)
  127. }
  128. // Unmarshal byte slice of Keytab data into Keytab type.
  129. func (kt *Keytab) Unmarshal(b []byte) error {
  130. if len(b) < 2 {
  131. return fmt.Errorf("byte array is less than 2 bytes: %d", len(b))
  132. }
  133. //The first byte of the file always has the value 5
  134. if b[0] != keytabFirstByte {
  135. return errors.New("invalid keytab data. First byte does not equal 5")
  136. }
  137. //Get keytab version
  138. //The 2nd byte contains the version number (1 or 2)
  139. kt.version = b[1]
  140. if kt.version != 1 && kt.version != 2 {
  141. return errors.New("invalid keytab data. Keytab version is neither 1 nor 2")
  142. }
  143. //Version 1 of the file format uses native byte order for integer representations. Version 2 always uses big-endian byte order
  144. var endian binary.ByteOrder
  145. endian = binary.BigEndian
  146. if kt.version == 1 && isNativeEndianLittle() {
  147. endian = binary.LittleEndian
  148. }
  149. // n tracks position in the byte array
  150. n := 2
  151. l, err := readInt32(b, &n, &endian)
  152. if err != nil {
  153. return err
  154. }
  155. for l != 0 {
  156. if l < 0 {
  157. //Zero padded so skip over
  158. l = l * -1
  159. n = n + int(l)
  160. } else {
  161. if n < 0 {
  162. return fmt.Errorf("%d can't be less than zero", n)
  163. }
  164. if n+int(l) > len(b) {
  165. return fmt.Errorf("%s's length is less than %d", b, n+int(l))
  166. }
  167. eb := b[n : n+int(l)]
  168. n = n + int(l)
  169. ke := newKeytabEntry()
  170. // p keeps track as to where we are in the byte stream
  171. var p int
  172. var err error
  173. parsePrincipal(eb, &p, kt, &ke, &endian)
  174. ke.Timestamp, err = readTimestamp(eb, &p, &endian)
  175. if err != nil {
  176. return err
  177. }
  178. rei8, err := readInt8(eb, &p, &endian)
  179. if err != nil {
  180. return err
  181. }
  182. ke.KVNO8 = uint8(rei8)
  183. rei16, err := readInt16(eb, &p, &endian)
  184. if err != nil {
  185. return err
  186. }
  187. ke.Key.KeyType = int32(rei16)
  188. rei16, err = readInt16(eb, &p, &endian)
  189. if err != nil {
  190. return err
  191. }
  192. kl := int(rei16)
  193. ke.Key.KeyValue, err = readBytes(eb, &p, kl, &endian)
  194. if err != nil {
  195. return err
  196. }
  197. // The 32-bit key version overrides the 8-bit key version.
  198. // If at least 4 bytes are left after the other fields are read and they are non-zero
  199. // this indicates the 32-bit version is present.
  200. if len(eb)-p >= 4 {
  201. // The 32-bit key may be present
  202. ri32, err := readInt32(eb, &p, &endian)
  203. if err != nil {
  204. return err
  205. }
  206. ke.KVNO = uint32(ri32)
  207. }
  208. if ke.KVNO == 0 {
  209. // Handles if the value from the last 4 bytes was zero and also if there are not the 4 bytes present. Makes sense to put the same value here as KVNO8
  210. ke.KVNO = uint32(ke.KVNO8)
  211. }
  212. // Add the entry to the keytab
  213. kt.Entries = append(kt.Entries, ke)
  214. }
  215. // Check if there are still 4 bytes left to read
  216. // Also check that n is greater than zero
  217. if n < 0 || n > len(b) || len(b[n:]) < 4 {
  218. break
  219. }
  220. // Read the size of the next entry
  221. l, err = readInt32(b, &n, &endian)
  222. if err != nil {
  223. return err
  224. }
  225. }
  226. return nil
  227. }
  228. func (e entry) marshal(v int) ([]byte, error) {
  229. var b []byte
  230. pb, err := e.Principal.marshal(v)
  231. if err != nil {
  232. return b, err
  233. }
  234. b = append(b, pb...)
  235. var endian binary.ByteOrder
  236. endian = binary.BigEndian
  237. if v == 1 && isNativeEndianLittle() {
  238. endian = binary.LittleEndian
  239. }
  240. t := make([]byte, 9)
  241. endian.PutUint32(t[0:4], uint32(e.Timestamp.Unix()))
  242. t[4] = e.KVNO8
  243. endian.PutUint16(t[5:7], uint16(e.Key.KeyType))
  244. endian.PutUint16(t[7:9], uint16(len(e.Key.KeyValue)))
  245. b = append(b, t...)
  246. buf := new(bytes.Buffer)
  247. err = binary.Write(buf, endian, e.Key.KeyValue)
  248. if err != nil {
  249. return b, err
  250. }
  251. b = append(b, buf.Bytes()...)
  252. t = make([]byte, 4)
  253. endian.PutUint32(t, e.KVNO)
  254. b = append(b, t...)
  255. // Add the length header
  256. t = make([]byte, 4)
  257. endian.PutUint32(t, uint32(len(b)))
  258. b = append(t, b...)
  259. return b, nil
  260. }
  261. // Parse the Keytab bytes of a principal into a Keytab entry's principal.
  262. func parsePrincipal(b []byte, p *int, kt *Keytab, ke *entry, e *binary.ByteOrder) error {
  263. var err error
  264. ke.Principal.NumComponents, err = readInt16(b, p, e)
  265. if err != nil {
  266. return err
  267. }
  268. if kt.version == 1 {
  269. //In version 1 the number of components includes the realm. Minus 1 to make consistent with version 2
  270. ke.Principal.NumComponents--
  271. }
  272. lenRealm, err := readInt16(b, p, e)
  273. if err != nil {
  274. return err
  275. }
  276. realmB, err := readBytes(b, p, int(lenRealm), e)
  277. if err != nil {
  278. return err
  279. }
  280. ke.Principal.Realm = string(realmB)
  281. for i := 0; i < int(ke.Principal.NumComponents); i++ {
  282. l, err := readInt16(b, p, e)
  283. if err != nil {
  284. return err
  285. }
  286. compB, err := readBytes(b, p, int(l), e)
  287. if err != nil {
  288. return err
  289. }
  290. ke.Principal.Components = append(ke.Principal.Components, string(compB))
  291. }
  292. if kt.version != 1 {
  293. //Name Type is omitted in version 1
  294. ke.Principal.NameType, err = readInt32(b, p, e)
  295. if err != nil {
  296. return err
  297. }
  298. }
  299. return nil
  300. }
  301. func (p principal) marshal(v int) ([]byte, error) {
  302. //var b []byte
  303. b := make([]byte, 2)
  304. var endian binary.ByteOrder
  305. endian = binary.BigEndian
  306. if v == 1 && isNativeEndianLittle() {
  307. endian = binary.LittleEndian
  308. }
  309. endian.PutUint16(b[0:], uint16(p.NumComponents))
  310. realm, err := marshalString(p.Realm, v)
  311. if err != nil {
  312. return b, err
  313. }
  314. b = append(b, realm...)
  315. for _, c := range p.Components {
  316. cb, err := marshalString(c, v)
  317. if err != nil {
  318. return b, err
  319. }
  320. b = append(b, cb...)
  321. }
  322. if v != 1 {
  323. t := make([]byte, 4)
  324. endian.PutUint32(t, uint32(p.NameType))
  325. b = append(b, t...)
  326. }
  327. return b, nil
  328. }
  329. func marshalString(s string, v int) ([]byte, error) {
  330. sb := []byte(s)
  331. b := make([]byte, 2)
  332. var endian binary.ByteOrder
  333. endian = binary.BigEndian
  334. if v == 1 && isNativeEndianLittle() {
  335. endian = binary.LittleEndian
  336. }
  337. endian.PutUint16(b[0:], uint16(len(sb)))
  338. buf := new(bytes.Buffer)
  339. err := binary.Write(buf, endian, sb)
  340. if err != nil {
  341. return b, err
  342. }
  343. b = append(b, buf.Bytes()...)
  344. return b, err
  345. }
  346. // Read bytes representing a timestamp.
  347. func readTimestamp(b []byte, p *int, e *binary.ByteOrder) (time.Time, error) {
  348. i32, err := readInt32(b, p, e)
  349. if err != nil {
  350. return time.Time{}, err
  351. }
  352. return time.Unix(int64(i32), 0), nil
  353. }
  354. // Read bytes representing an eight bit integer.
  355. func readInt8(b []byte, p *int, e *binary.ByteOrder) (i int8, err error) {
  356. if *p < 0 {
  357. return 0, fmt.Errorf("%d cannot be less than zero", *p)
  358. }
  359. if (*p + 1) > len(b) {
  360. return 0, fmt.Errorf("%s's length is less than %d", b, *p+1)
  361. }
  362. buf := bytes.NewBuffer(b[*p : *p+1])
  363. binary.Read(buf, *e, &i)
  364. *p++
  365. return
  366. }
  367. // Read bytes representing a sixteen bit integer.
  368. func readInt16(b []byte, p *int, e *binary.ByteOrder) (i int16, err error) {
  369. if *p < 0 {
  370. return 0, fmt.Errorf("%d cannot be less than zero", *p)
  371. }
  372. if (*p + 2) > len(b) {
  373. return 0, fmt.Errorf("%s's length is less than %d", b, *p+2)
  374. }
  375. buf := bytes.NewBuffer(b[*p : *p+2])
  376. binary.Read(buf, *e, &i)
  377. *p += 2
  378. return
  379. }
  380. // Read bytes representing a thirty two bit integer.
  381. func readInt32(b []byte, p *int, e *binary.ByteOrder) (i int32, err error) {
  382. if *p < 0 {
  383. return 0, fmt.Errorf("%d cannot be less than zero", *p)
  384. }
  385. if (*p + 4) > len(b) {
  386. return 0, fmt.Errorf("%s's length is less than %d", b, *p+4)
  387. }
  388. buf := bytes.NewBuffer(b[*p : *p+4])
  389. binary.Read(buf, *e, &i)
  390. *p += 4
  391. return
  392. }
  393. func readBytes(b []byte, p *int, s int, e *binary.ByteOrder) ([]byte, error) {
  394. if s < 0 {
  395. return nil, fmt.Errorf("%d cannot be less than zero", s)
  396. }
  397. i := *p + s
  398. if i > len(b) {
  399. return nil, fmt.Errorf("%s's length is greater than %d", b, i)
  400. }
  401. buf := bytes.NewBuffer(b[*p:i])
  402. r := make([]byte, s)
  403. if err := binary.Read(buf, *e, &r); err != nil {
  404. return nil, err
  405. }
  406. *p += s
  407. return r, nil
  408. }
  409. func isNativeEndianLittle() bool {
  410. var x = 0x012345678
  411. var p = unsafe.Pointer(&x)
  412. var bp = (*[4]byte)(p)
  413. var endian bool
  414. if 0x01 == bp[0] {
  415. endian = false
  416. } else if (0x78 & 0xff) == (bp[0] & 0xff) {
  417. endian = true
  418. } else {
  419. // Default to big endian
  420. endian = false
  421. }
  422. return endian
  423. }