poly1305_test.go 2.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
  1. // Copyright 2012 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 poly1305
  5. import (
  6. "bytes"
  7. "testing"
  8. "unsafe"
  9. )
  10. var testData = []struct {
  11. in, k, correct []byte
  12. }{
  13. {
  14. []byte("Hello world!"),
  15. []byte("this is 32-byte key for Poly1305"),
  16. []byte{0xa6, 0xf7, 0x45, 0x00, 0x8f, 0x81, 0xc9, 0x16, 0xa2, 0x0d, 0xcc, 0x74, 0xee, 0xf2, 0xb2, 0xf0},
  17. },
  18. {
  19. make([]byte, 32),
  20. []byte("this is 32-byte key for Poly1305"),
  21. []byte{0x49, 0xec, 0x78, 0x09, 0x0e, 0x48, 0x1e, 0xc6, 0xc2, 0x6b, 0x33, 0xb9, 0x1c, 0xcc, 0x03, 0x07},
  22. },
  23. {
  24. make([]byte, 2007),
  25. []byte("this is 32-byte key for Poly1305"),
  26. []byte{0xda, 0x84, 0xbc, 0xab, 0x02, 0x67, 0x6c, 0x38, 0xcd, 0xb0, 0x15, 0x60, 0x42, 0x74, 0xc2, 0xaa},
  27. },
  28. {
  29. make([]byte, 2007),
  30. make([]byte, 32),
  31. make([]byte, 16),
  32. },
  33. {
  34. // This test triggers an edge-case. See https://go-review.googlesource.com/#/c/30101/.
  35. []byte{0x81, 0xd8, 0xb2, 0xe4, 0x6a, 0x25, 0x21, 0x3b, 0x58, 0xfe, 0xe4, 0x21, 0x3a, 0x2a, 0x28, 0xe9, 0x21, 0xc1, 0x2a, 0x96, 0x32, 0x51, 0x6d, 0x3b, 0x73, 0x27, 0x27, 0x27, 0xbe, 0xcf, 0x21, 0x29},
  36. []byte{0x3b, 0x3a, 0x29, 0xe9, 0x3b, 0x21, 0x3a, 0x5c, 0x5c, 0x3b, 0x3b, 0x05, 0x3a, 0x3a, 0x8c, 0x0d},
  37. []byte{0x6d, 0xc1, 0x8b, 0x8c, 0x34, 0x4c, 0xd7, 0x99, 0x27, 0x11, 0x8b, 0xbe, 0x84, 0xb7, 0xf3, 0x14},
  38. },
  39. }
  40. func testSum(t *testing.T, unaligned bool) {
  41. var out [16]byte
  42. var key [32]byte
  43. for i, v := range testData {
  44. in := v.in
  45. if unaligned {
  46. in = unalignBytes(in)
  47. }
  48. copy(key[:], v.k)
  49. Sum(&out, in, &key)
  50. if !bytes.Equal(out[:], v.correct) {
  51. t.Errorf("%d: expected %x, got %x", i, v.correct, out[:])
  52. }
  53. }
  54. }
  55. func TestSum(t *testing.T) { testSum(t, false) }
  56. func TestSumUnaligned(t *testing.T) { testSum(t, true) }
  57. func benchmark(b *testing.B, size int, unaligned bool) {
  58. var out [16]byte
  59. var key [32]byte
  60. in := make([]byte, size)
  61. if unaligned {
  62. in = unalignBytes(in)
  63. }
  64. b.SetBytes(int64(len(in)))
  65. b.ResetTimer()
  66. for i := 0; i < b.N; i++ {
  67. Sum(&out, in, &key)
  68. }
  69. }
  70. func Benchmark64(b *testing.B) { benchmark(b, 64, false) }
  71. func Benchmark1K(b *testing.B) { benchmark(b, 1024, false) }
  72. func Benchmark64Unaligned(b *testing.B) { benchmark(b, 64, true) }
  73. func Benchmark1KUnaligned(b *testing.B) { benchmark(b, 1024, true) }
  74. func unalignBytes(in []byte) []byte {
  75. out := make([]byte, len(in)+1)
  76. if uintptr(unsafe.Pointer(&out[0]))&(unsafe.Alignof(uint32(0))-1) == 0 {
  77. out = out[1:]
  78. } else {
  79. out = out[:len(in)]
  80. }
  81. copy(out, in)
  82. return out
  83. }