dnssec_keyscan.go 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353
  1. package dns
  2. import (
  3. "bufio"
  4. "crypto"
  5. "crypto/dsa"
  6. "crypto/ecdsa"
  7. "crypto/rsa"
  8. "io"
  9. "math/big"
  10. "strconv"
  11. "strings"
  12. "golang.org/x/crypto/ed25519"
  13. )
  14. // NewPrivateKey returns a PrivateKey by parsing the string s.
  15. // s should be in the same form of the BIND private key files.
  16. func (k *DNSKEY) NewPrivateKey(s string) (crypto.PrivateKey, error) {
  17. if s == "" || s[len(s)-1] != '\n' { // We need a closing newline
  18. return k.ReadPrivateKey(strings.NewReader(s+"\n"), "")
  19. }
  20. return k.ReadPrivateKey(strings.NewReader(s), "")
  21. }
  22. // ReadPrivateKey reads a private key from the io.Reader q. The string file is
  23. // only used in error reporting.
  24. // The public key must be known, because some cryptographic algorithms embed
  25. // the public inside the privatekey.
  26. func (k *DNSKEY) ReadPrivateKey(q io.Reader, file string) (crypto.PrivateKey, error) {
  27. m, err := parseKey(q, file)
  28. if m == nil {
  29. return nil, err
  30. }
  31. if _, ok := m["private-key-format"]; !ok {
  32. return nil, ErrPrivKey
  33. }
  34. if m["private-key-format"] != "v1.2" && m["private-key-format"] != "v1.3" {
  35. return nil, ErrPrivKey
  36. }
  37. // TODO(mg): check if the pubkey matches the private key
  38. algo, err := strconv.ParseUint(strings.SplitN(m["algorithm"], " ", 2)[0], 10, 8)
  39. if err != nil {
  40. return nil, ErrPrivKey
  41. }
  42. switch uint8(algo) {
  43. case DSA:
  44. priv, err := readPrivateKeyDSA(m)
  45. if err != nil {
  46. return nil, err
  47. }
  48. pub := k.publicKeyDSA()
  49. if pub == nil {
  50. return nil, ErrKey
  51. }
  52. priv.PublicKey = *pub
  53. return priv, nil
  54. case RSAMD5:
  55. fallthrough
  56. case RSASHA1:
  57. fallthrough
  58. case RSASHA1NSEC3SHA1:
  59. fallthrough
  60. case RSASHA256:
  61. fallthrough
  62. case RSASHA512:
  63. priv, err := readPrivateKeyRSA(m)
  64. if err != nil {
  65. return nil, err
  66. }
  67. pub := k.publicKeyRSA()
  68. if pub == nil {
  69. return nil, ErrKey
  70. }
  71. priv.PublicKey = *pub
  72. return priv, nil
  73. case ECCGOST:
  74. return nil, ErrPrivKey
  75. case ECDSAP256SHA256:
  76. fallthrough
  77. case ECDSAP384SHA384:
  78. priv, err := readPrivateKeyECDSA(m)
  79. if err != nil {
  80. return nil, err
  81. }
  82. pub := k.publicKeyECDSA()
  83. if pub == nil {
  84. return nil, ErrKey
  85. }
  86. priv.PublicKey = *pub
  87. return priv, nil
  88. case ED25519:
  89. return readPrivateKeyED25519(m)
  90. default:
  91. return nil, ErrPrivKey
  92. }
  93. }
  94. // Read a private key (file) string and create a public key. Return the private key.
  95. func readPrivateKeyRSA(m map[string]string) (*rsa.PrivateKey, error) {
  96. p := new(rsa.PrivateKey)
  97. p.Primes = []*big.Int{nil, nil}
  98. for k, v := range m {
  99. switch k {
  100. case "modulus", "publicexponent", "privateexponent", "prime1", "prime2":
  101. v1, err := fromBase64([]byte(v))
  102. if err != nil {
  103. return nil, err
  104. }
  105. switch k {
  106. case "modulus":
  107. p.PublicKey.N = big.NewInt(0)
  108. p.PublicKey.N.SetBytes(v1)
  109. case "publicexponent":
  110. i := big.NewInt(0)
  111. i.SetBytes(v1)
  112. p.PublicKey.E = int(i.Int64()) // int64 should be large enough
  113. case "privateexponent":
  114. p.D = big.NewInt(0)
  115. p.D.SetBytes(v1)
  116. case "prime1":
  117. p.Primes[0] = big.NewInt(0)
  118. p.Primes[0].SetBytes(v1)
  119. case "prime2":
  120. p.Primes[1] = big.NewInt(0)
  121. p.Primes[1].SetBytes(v1)
  122. }
  123. case "exponent1", "exponent2", "coefficient":
  124. // not used in Go (yet)
  125. case "created", "publish", "activate":
  126. // not used in Go (yet)
  127. }
  128. }
  129. return p, nil
  130. }
  131. func readPrivateKeyDSA(m map[string]string) (*dsa.PrivateKey, error) {
  132. p := new(dsa.PrivateKey)
  133. p.X = big.NewInt(0)
  134. for k, v := range m {
  135. switch k {
  136. case "private_value(x)":
  137. v1, err := fromBase64([]byte(v))
  138. if err != nil {
  139. return nil, err
  140. }
  141. p.X.SetBytes(v1)
  142. case "created", "publish", "activate":
  143. /* not used in Go (yet) */
  144. }
  145. }
  146. return p, nil
  147. }
  148. func readPrivateKeyECDSA(m map[string]string) (*ecdsa.PrivateKey, error) {
  149. p := new(ecdsa.PrivateKey)
  150. p.D = big.NewInt(0)
  151. // TODO: validate that the required flags are present
  152. for k, v := range m {
  153. switch k {
  154. case "privatekey":
  155. v1, err := fromBase64([]byte(v))
  156. if err != nil {
  157. return nil, err
  158. }
  159. p.D.SetBytes(v1)
  160. case "created", "publish", "activate":
  161. /* not used in Go (yet) */
  162. }
  163. }
  164. return p, nil
  165. }
  166. func readPrivateKeyED25519(m map[string]string) (ed25519.PrivateKey, error) {
  167. var p ed25519.PrivateKey
  168. // TODO: validate that the required flags are present
  169. for k, v := range m {
  170. switch k {
  171. case "privatekey":
  172. p1, err := fromBase64([]byte(v))
  173. if err != nil {
  174. return nil, err
  175. }
  176. if len(p1) != ed25519.SeedSize {
  177. return nil, ErrPrivKey
  178. }
  179. p = ed25519.NewKeyFromSeed(p1)
  180. case "created", "publish", "activate":
  181. /* not used in Go (yet) */
  182. }
  183. }
  184. return p, nil
  185. }
  186. // parseKey reads a private key from r. It returns a map[string]string,
  187. // with the key-value pairs, or an error when the file is not correct.
  188. func parseKey(r io.Reader, file string) (map[string]string, error) {
  189. m := make(map[string]string)
  190. var k string
  191. c := newKLexer(r)
  192. for l, ok := c.Next(); ok; l, ok = c.Next() {
  193. // It should alternate
  194. switch l.value {
  195. case zKey:
  196. k = l.token
  197. case zValue:
  198. if k == "" {
  199. return nil, &ParseError{file, "no private key seen", l}
  200. }
  201. m[strings.ToLower(k)] = l.token
  202. k = ""
  203. }
  204. }
  205. // Surface any read errors from r.
  206. if err := c.Err(); err != nil {
  207. return nil, &ParseError{file: file, err: err.Error()}
  208. }
  209. return m, nil
  210. }
  211. type klexer struct {
  212. br io.ByteReader
  213. readErr error
  214. line int
  215. column int
  216. key bool
  217. eol bool // end-of-line
  218. }
  219. func newKLexer(r io.Reader) *klexer {
  220. br, ok := r.(io.ByteReader)
  221. if !ok {
  222. br = bufio.NewReaderSize(r, 1024)
  223. }
  224. return &klexer{
  225. br: br,
  226. line: 1,
  227. key: true,
  228. }
  229. }
  230. func (kl *klexer) Err() error {
  231. if kl.readErr == io.EOF {
  232. return nil
  233. }
  234. return kl.readErr
  235. }
  236. // readByte returns the next byte from the input
  237. func (kl *klexer) readByte() (byte, bool) {
  238. if kl.readErr != nil {
  239. return 0, false
  240. }
  241. c, err := kl.br.ReadByte()
  242. if err != nil {
  243. kl.readErr = err
  244. return 0, false
  245. }
  246. // delay the newline handling until the next token is delivered,
  247. // fixes off-by-one errors when reporting a parse error.
  248. if kl.eol {
  249. kl.line++
  250. kl.column = 0
  251. kl.eol = false
  252. }
  253. if c == '\n' {
  254. kl.eol = true
  255. } else {
  256. kl.column++
  257. }
  258. return c, true
  259. }
  260. func (kl *klexer) Next() (lex, bool) {
  261. var (
  262. l lex
  263. str strings.Builder
  264. commt bool
  265. )
  266. for x, ok := kl.readByte(); ok; x, ok = kl.readByte() {
  267. l.line, l.column = kl.line, kl.column
  268. switch x {
  269. case ':':
  270. if commt || !kl.key {
  271. break
  272. }
  273. kl.key = false
  274. // Next token is a space, eat it
  275. kl.readByte()
  276. l.value = zKey
  277. l.token = str.String()
  278. return l, true
  279. case ';':
  280. commt = true
  281. case '\n':
  282. if commt {
  283. // Reset a comment
  284. commt = false
  285. }
  286. kl.key = true
  287. l.value = zValue
  288. l.token = str.String()
  289. return l, true
  290. default:
  291. if commt {
  292. break
  293. }
  294. str.WriteByte(x)
  295. }
  296. }
  297. if kl.readErr != nil && kl.readErr != io.EOF {
  298. // Don't return any tokens after a read error occurs.
  299. return lex{value: zEOF}, false
  300. }
  301. if str.Len() > 0 {
  302. // Send remainder
  303. l.value = zValue
  304. l.token = str.String()
  305. return l, true
  306. }
  307. return lex{value: zEOF}, false
  308. }