dns/nsecx.go

180 lines
4.1 KiB
Go
Raw Normal View History

2013-05-13 00:15:52 +10:00
// Copyright 2011 Miek Gieben. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
2011-01-28 01:52:58 +11:00
package dns
2011-03-08 07:56:36 +11:00
import (
2011-12-10 07:45:57 +11:00
"crypto/sha1"
2011-03-08 08:47:20 +11:00
"hash"
"io"
2011-03-08 08:47:20 +11:00
"strings"
2011-03-08 07:56:36 +11:00
)
2011-03-08 08:47:20 +11:00
type saltWireFmt struct {
Salt string `dns:"size-hex"`
2011-03-08 08:47:20 +11:00
}
2011-01-28 01:52:58 +11:00
2012-12-02 20:14:53 +11:00
// HashName hashes a string (label) according to RFC 5155. It returns the hashed string.
2012-01-22 20:52:06 +11:00
func HashName(label string, ha uint8, iter uint16, salt string) string {
2011-03-08 08:47:20 +11:00
saltwire := new(saltWireFmt)
saltwire.Salt = salt
wire := make([]byte, DefaultMsgSize)
n, err := PackStruct(saltwire, wire, 0)
if err != nil {
2011-03-08 08:47:20 +11:00
return ""
}
wire = wire[:n]
2011-03-10 00:27:41 +11:00
name := make([]byte, 255)
off, err := PackDomainName(strings.ToLower(label), name, 0, nil, false)
if err != nil {
2011-03-08 08:47:20 +11:00
return ""
}
2011-03-10 00:27:41 +11:00
name = name[:off]
2011-03-08 08:47:20 +11:00
var s hash.Hash
switch ha {
2011-07-09 01:27:44 +10:00
case SHA1:
2011-03-08 08:47:20 +11:00
s = sha1.New()
2011-03-24 19:24:49 +11:00
default:
return ""
2011-03-08 08:47:20 +11:00
}
// k = 0
2011-03-10 00:27:41 +11:00
name = append(name, wire...)
2011-12-17 05:42:30 +11:00
io.WriteString(s, string(name))
nsec3 := s.Sum(nil)
2011-03-24 19:24:49 +11:00
// k > 0
2012-01-22 20:52:06 +11:00
for k := uint16(0); k < iter; k++ {
2011-03-24 19:24:49 +11:00
s.Reset()
nsec3 = append(nsec3, wire...)
2011-12-17 05:42:30 +11:00
io.WriteString(s, string(nsec3))
2011-12-17 01:12:01 +11:00
nsec3 = s.Sum(nil)
2011-03-24 19:24:49 +11:00
}
2011-03-08 08:47:20 +11:00
return unpackBase32(nsec3)
2011-03-08 07:56:36 +11:00
}
2013-12-26 03:01:39 +11:00
type Denialer interface {
// Cover will check if the (unhashed) name is being covered by this NSEC or NSEC3.
Cover(name string) bool
// Match will check if the ownername matches the (unhashed) name for this NSEC3 or NSEC3.
Match(name string) bool
}
// Cover implements the Denialer interface.
func (rr *NSEC) Cover(name string) bool {
2013-12-25 03:54:20 +11:00
return true
}
2013-12-25 03:54:20 +11:00
// Match implements the Denialer interface.
func (rr *NSEC) Match(name string) bool {
return true
}
2013-12-25 03:54:20 +11:00
// Cover implements the Denialer interface.
func (rr *NSEC3) Cover(name string) bool {
// FIXME(miek): check if the zones match
// FIXME(miek): check if we're not dealing with parent nsec3
hname := HashName(name, rr.Hash, rr.Iterations, rr.Salt)
labels := Split(rr.Hdr.Name)
if len(labels) < 2 {
return false
}
2013-12-26 03:01:39 +11:00
hash := strings.ToUpper(rr.Hdr.Name[labels[0] : labels[1]-1]) // -1 to remove the dot
if hash == rr.NextDomain {
return false // empty interval
}
if hash > rr.NextDomain { // last name, points to apex
// hname > hash
// hname > rr.NextDomain
// TODO(miek)
}
if hname <= hash {
return false
}
if hname >= rr.NextDomain {
return false
}
return true
}
2013-12-25 03:54:20 +11:00
// Match implements the Denialer interface.
func (rr *NSEC3) Match(name string) bool {
// FIXME(miek): Check if we are in the same zone
hname := HashName(name, rr.Hash, rr.Iterations, rr.Salt)
labels := Split(rr.Hdr.Name)
if len(labels) < 2 {
return false
}
hash := strings.ToUpper(rr.Hdr.Name[labels[0] : labels[1]-1]) // -1 to remove the .
if hash == hname {
return true
}
return false
}
2013-12-26 03:01:39 +11:00
// Proof takes a slice of NSEC or NSEC3 RR, the qname and the qtype and tries
// to proof the authenticated denial of existence. If nil is returned the proof
// succeeded otherwise the error will indicated what was wrong.
func Proof(nsecx []RR, qname string, qtype uint16) error {
// TODO(miek): wildcard expanded reply
nsec3 := 0
nsec := 0
for i := 0; i < len(nsecx); i++ {
if _, ok := nsecx[0].(*NSEC3); ok {
nsec3++
}
if _, ok := nsecx[0].(*NSEC); ok {
nsec++
}
}
2013-12-26 06:44:17 +11:00
if nsec3 == len(nsecx) {
2013-12-26 03:01:39 +11:00
return proofNSEC3(nsecx, qname, qtype)
}
2013-12-26 06:44:17 +11:00
if nsec == len(nsecx) {
2013-12-26 03:01:39 +11:00
return proofNSEC(nsecx, qname, qtype)
}
return ErrSig // ErrNotRRset?
}
// NSEC3 Helper
2013-12-26 06:44:17 +11:00
func proofNSEC3(nsec3 []RR, qname string, qtype uint16) error {
indx := Split(qname)
ce := "" // Closest Encloser
nc := "" // Next Closer
wc := "" // Source of Synthesis (wildcard)
ClosestEncloser:
for i := 0; i < len(indx); i++ {
for j := 0; j < len(nsec3); j++ {
if nsec3[j].(*NSEC3).Match(qname[indx[i]:]) {
ce = qname[indx[i]:]
wc = "*." + ce
if i == 0 {
nc = qname
} else {
nc = qname[indx[i-1]:]
}
break ClosestEncloser
}
}
}
if ce == "" {
return ErrSig // ErrNoMatchingNSEC3
}
covered := 0 // Both nc and wc must be covered
for i := 0; i < len(nsec3); i++ {
if nsec3[i].(*NSEC3).Cover(nc) {
covered++
}
if nsec3[i].(*NSEC3).Cover(wc) {
covered++
}
}
if covered != 2 {
return ErrSig
}
return nil
}
2013-12-26 03:01:39 +11:00
// NSEC Helper
func proofNSEC(nsecx []RR, qname string, qtype uint16) error { return nil }