1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
package math
import (
"crypto/rand"
"fmt"
"math/big"
"testing"
"github.com/cloudflare/circl/internal/test"
)
func TestSafePrime(t *testing.T) {
firstSafePrimes := []int64{
5, 7, 11, 23, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467,
479, 503, 563, 587, 719, 839, 863, 887, 983, 1019, 1187, 1283, 1307,
1319, 1367, 1439, 1487, 1523, 1619, 1823, 1907, 2027, 2039, 2063, 2099,
2207, 2447, 2459, 2579, 2819, 2879, 2903, 2963, 2999, 3023, 3119, 3167,
3203, 3467, 3623, 3779, 3803, 3863, 3947, 4007, 4079, 4127, 4139, 4259,
4283, 4547, 4679, 4703, 4787, 4799, 4919, 5087, 5099, 5387, 5399, 5483,
5507, 5639, 5807, 5879, 5927, 5939, 6047, 6599, 6659, 6719, 6779, 6827,
6899, 6983, 7079, 7187, 7247, 7523, 7559, 7607, 7643, 7703, 7727,
}
p := new(big.Int)
for _, pi := range firstSafePrimes {
p.SetInt64(pi)
test.CheckOk(IsSafePrime(p), fmt.Sprintf("it should be a safe prime p=%v", p), t)
}
}
func TestIsSafePrime(t *testing.T) {
for i := 1; i < 5; i++ {
bits := 128 * i
t.Run(fmt.Sprint(bits), func(t *testing.T) {
p, err := SafePrime(rand.Reader, bits)
test.CheckNoErr(t, err, "safeprime failed")
test.CheckOk(IsSafePrime(p), fmt.Sprintf("it should be a safe prime p=%v", p), t)
})
}
}
func BenchmarkSafePrime(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = SafePrime(rand.Reader, 256)
}
}
|
