Adam Langley | 124e52d | 2012-03-12 10:59:04 -0400 | [diff] [blame] | 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 | |
| 5 | package curve25519 |
| 6 | |
| 7 | import ( |
Michael McLoughlin | 193df9c | 2019-02-05 11:42:15 -0800 | [diff] [blame] | 8 | "bytes" |
| 9 | "crypto/rand" |
Adam Langley | 124e52d | 2012-03-12 10:59:04 -0400 | [diff] [blame] | 10 | "fmt" |
| 11 | "testing" |
| 12 | ) |
| 13 | |
| 14 | const expectedHex = "89161fde887b2b53de549af483940106ecc114d6982daa98256de23bdf77661a" |
| 15 | |
Filippo Valsorda | f4817d9 | 2019-11-07 16:07:46 -0500 | [diff] [blame] | 16 | func TestX25519Basepoint(t *testing.T) { |
| 17 | x := make([]byte, 32) |
| 18 | x[0] = 1 |
Adam Langley | 124e52d | 2012-03-12 10:59:04 -0400 | [diff] [blame] | 19 | |
| 20 | for i := 0; i < 200; i++ { |
Filippo Valsorda | f4817d9 | 2019-11-07 16:07:46 -0500 | [diff] [blame] | 21 | var err error |
| 22 | x, err = X25519(x, Basepoint) |
| 23 | if err != nil { |
| 24 | t.Fatal(err) |
| 25 | } |
Adam Langley | 124e52d | 2012-03-12 10:59:04 -0400 | [diff] [blame] | 26 | } |
| 27 | |
Filippo Valsorda | f4817d9 | 2019-11-07 16:07:46 -0500 | [diff] [blame] | 28 | result := fmt.Sprintf("%x", x) |
Adam Langley | 124e52d | 2012-03-12 10:59:04 -0400 | [diff] [blame] | 29 | if result != expectedHex { |
| 30 | t.Errorf("incorrect result: got %s, want %s", result, expectedHex) |
| 31 | } |
| 32 | } |
Andreas Auernhammer | cd11541 | 2017-04-06 15:01:18 +0200 | [diff] [blame] | 33 | |
Filippo Valsorda | f4817d9 | 2019-11-07 16:07:46 -0500 | [diff] [blame] | 34 | func TestLowOrderPoints(t *testing.T) { |
| 35 | scalar := make([]byte, ScalarSize) |
| 36 | if _, err := rand.Read(scalar); err != nil { |
| 37 | t.Fatal(err) |
| 38 | } |
| 39 | for i, p := range lowOrderPoints { |
| 40 | out, err := X25519(scalar, p) |
| 41 | if err == nil { |
| 42 | t.Errorf("%d: expected error, got nil", i) |
| 43 | } |
| 44 | if out != nil { |
| 45 | t.Errorf("%d: expected nil output, got %x", i, out) |
| 46 | } |
| 47 | } |
| 48 | } |
| 49 | |
Michael McLoughlin | a1f597e | 2019-02-05 13:23:42 -0800 | [diff] [blame] | 50 | func TestTestVectors(t *testing.T) { |
Filippo Valsorda | 3497b51 | 2021-05-05 17:15:45 -0400 | [diff] [blame] | 51 | t.Run("Legacy", func(t *testing.T) { testTestVectors(t, ScalarMult) }) |
Filippo Valsorda | f4817d9 | 2019-11-07 16:07:46 -0500 | [diff] [blame] | 52 | t.Run("X25519", func(t *testing.T) { |
| 53 | testTestVectors(t, func(dst, scalar, point *[32]byte) { |
| 54 | out, err := X25519(scalar[:], point[:]) |
| 55 | if err != nil { |
| 56 | t.Fatal(err) |
| 57 | } |
| 58 | copy(dst[:], out) |
| 59 | }) |
| 60 | }) |
| 61 | } |
| 62 | |
| 63 | func testTestVectors(t *testing.T, scalarMult func(dst, scalar, point *[32]byte)) { |
Michael McLoughlin | a1f597e | 2019-02-05 13:23:42 -0800 | [diff] [blame] | 64 | for _, tv := range testVectors { |
| 65 | var got [32]byte |
Filippo Valsorda | f4817d9 | 2019-11-07 16:07:46 -0500 | [diff] [blame] | 66 | scalarMult(&got, &tv.In, &tv.Base) |
Michael McLoughlin | a1f597e | 2019-02-05 13:23:42 -0800 | [diff] [blame] | 67 | if !bytes.Equal(got[:], tv.Expect[:]) { |
| 68 | t.Logf(" in = %x", tv.In) |
| 69 | t.Logf(" base = %x", tv.Base) |
| 70 | t.Logf(" got = %x", got) |
| 71 | t.Logf("expect = %x", tv.Expect) |
| 72 | t.Fail() |
| 73 | } |
| 74 | } |
| 75 | } |
| 76 | |
Michael McLoughlin | 193df9c | 2019-02-05 11:42:15 -0800 | [diff] [blame] | 77 | // TestHighBitIgnored tests the following requirement in RFC 7748: |
| 78 | // |
| 79 | // When receiving such an array, implementations of X25519 (but not X448) MUST |
| 80 | // mask the most significant bit in the final byte. |
| 81 | // |
| 82 | // Regression test for issue #30095. |
| 83 | func TestHighBitIgnored(t *testing.T) { |
| 84 | var s, u [32]byte |
| 85 | rand.Read(s[:]) |
| 86 | rand.Read(u[:]) |
| 87 | |
| 88 | var hi0, hi1 [32]byte |
| 89 | |
| 90 | u[31] &= 0x7f |
| 91 | ScalarMult(&hi0, &s, &u) |
| 92 | |
| 93 | u[31] |= 0x80 |
| 94 | ScalarMult(&hi1, &s, &u) |
| 95 | |
| 96 | if !bytes.Equal(hi0[:], hi1[:]) { |
| 97 | t.Errorf("high bit of group point should not affect result") |
| 98 | } |
| 99 | } |
| 100 | |
Filippo Valsorda | 3497b51 | 2021-05-05 17:15:45 -0400 | [diff] [blame] | 101 | var benchmarkSink byte |
Andreas Auernhammer | cd11541 | 2017-04-06 15:01:18 +0200 | [diff] [blame] | 102 | |
Filippo Valsorda | 3497b51 | 2021-05-05 17:15:45 -0400 | [diff] [blame] | 103 | func BenchmarkX25519Basepoint(b *testing.B) { |
| 104 | scalar := make([]byte, ScalarSize) |
| 105 | if _, err := rand.Read(scalar); err != nil { |
| 106 | b.Fatal(err) |
| 107 | } |
| 108 | |
| 109 | b.ResetTimer() |
Andreas Auernhammer | cd11541 | 2017-04-06 15:01:18 +0200 | [diff] [blame] | 110 | for i := 0; i < b.N; i++ { |
Filippo Valsorda | 3497b51 | 2021-05-05 17:15:45 -0400 | [diff] [blame] | 111 | out, err := X25519(scalar, Basepoint) |
| 112 | if err != nil { |
| 113 | b.Fatal(err) |
| 114 | } |
| 115 | benchmarkSink ^= out[0] |
| 116 | } |
| 117 | } |
| 118 | |
| 119 | func BenchmarkX25519(b *testing.B) { |
| 120 | scalar := make([]byte, ScalarSize) |
| 121 | if _, err := rand.Read(scalar); err != nil { |
| 122 | b.Fatal(err) |
| 123 | } |
| 124 | point, err := X25519(scalar, Basepoint) |
| 125 | if err != nil { |
| 126 | b.Fatal(err) |
| 127 | } |
| 128 | if _, err := rand.Read(scalar); err != nil { |
| 129 | b.Fatal(err) |
| 130 | } |
| 131 | |
| 132 | b.ResetTimer() |
| 133 | for i := 0; i < b.N; i++ { |
| 134 | out, err := X25519(scalar, point) |
| 135 | if err != nil { |
| 136 | b.Fatal(err) |
| 137 | } |
| 138 | benchmarkSink ^= out[0] |
Andreas Auernhammer | cd11541 | 2017-04-06 15:01:18 +0200 | [diff] [blame] | 139 | } |
| 140 | } |