Merge from mainline (167278:168000).
[official-gcc/graphite-test-results.git] / libgo / go / crypto / block / cmac.go
blobb85cde72e1213d2fd7d599a49fc171b288ed2fc6
1 // Copyright 2009 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.
5 // CMAC message authentication code, defined in
6 // NIST Special Publication SP 800-38B.
8 package block
10 import (
11 "hash"
12 "os"
15 const (
16 // minimal irreducible polynomial of degree b
17 r64 = 0x1b
18 r128 = 0x87
21 type cmac struct {
22 k1, k2, ci, digest []byte
23 p int // position in ci
24 c Cipher
27 // TODO(rsc): Should this return an error instead of panic?
29 // NewCMAC returns a new instance of a CMAC message authentication code
30 // digest using the given Cipher.
31 func NewCMAC(c Cipher) hash.Hash {
32 var r byte
33 n := c.BlockSize()
34 switch n {
35 case 64 / 8:
36 r = r64
37 case 128 / 8:
38 r = r128
39 default:
40 panic("crypto/block: NewCMAC: invalid cipher block size")
43 d := new(cmac)
44 d.c = c
45 d.k1 = make([]byte, n)
46 d.k2 = make([]byte, n)
47 d.ci = make([]byte, n)
48 d.digest = make([]byte, n)
50 // Subkey generation, p. 7
51 c.Encrypt(d.k1, d.k1)
52 if shift1(d.k1, d.k1) != 0 {
53 d.k1[n-1] ^= r
55 if shift1(d.k2, d.k1) != 0 {
56 d.k2[n-1] ^= r
59 return d
62 // Reset clears the digest state, starting a new digest.
63 func (d *cmac) Reset() {
64 for i := range d.ci {
65 d.ci[i] = 0
67 d.p = 0
70 // Write adds the given data to the digest state.
71 func (d *cmac) Write(p []byte) (n int, err os.Error) {
72 // Xor input into ci.
73 for _, c := range p {
74 // If ci is full, encrypt and start over.
75 if d.p >= len(d.ci) {
76 d.c.Encrypt(d.ci, d.ci)
77 d.p = 0
79 d.ci[d.p] ^= c
80 d.p++
82 return len(p), nil
85 // Sum returns the CMAC digest, one cipher block in length,
86 // of the data written with Write.
87 func (d *cmac) Sum() []byte {
88 // Finish last block, mix in key, encrypt.
89 // Don't edit ci, in case caller wants
90 // to keep digesting after call to Sum.
91 k := d.k1
92 if d.p < len(d.digest) {
93 k = d.k2
95 for i := 0; i < len(d.ci); i++ {
96 d.digest[i] = d.ci[i] ^ k[i]
98 if d.p < len(d.digest) {
99 d.digest[d.p] ^= 0x80
101 d.c.Encrypt(d.digest, d.digest)
102 return d.digest
105 func (d *cmac) Size() int { return len(d.digest) }