mirror of
https://github.com/SwingbyProtocol/tss-lib.git
synced 2026-04-23 03:00:36 -04:00
48 lines
1.5 KiB
Go
48 lines
1.5 KiB
Go
// Copyright © 2019 Binance
|
|
//
|
|
// This file is part of Binance. The full Binance copyright notice, including
|
|
// terms governing use, modification, and redistribution, is contained in the
|
|
// file LICENSE at the root of the source code distribution tree.
|
|
|
|
package common_test
|
|
|
|
import (
|
|
"math/big"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
"github.com/binance-chain/tss-lib/common"
|
|
)
|
|
|
|
const (
|
|
randomIntBitLen = 1024
|
|
)
|
|
|
|
func TestGetRandomInt(t *testing.T) {
|
|
rnd := common.MustGetRandomInt(randomIntBitLen)
|
|
assert.NotZero(t, rnd, "rand int should not be zero")
|
|
}
|
|
|
|
func TestGetRandomPositiveInt(t *testing.T) {
|
|
rnd := common.MustGetRandomInt(randomIntBitLen)
|
|
rndPos := common.GetRandomPositiveInt(rnd)
|
|
assert.NotZero(t, rndPos, "rand int should not be zero")
|
|
assert.True(t, rndPos.Cmp(big.NewInt(0)) == 1, "rand int should be positive")
|
|
}
|
|
|
|
func TestGetRandomPositiveRelativelyPrimeInt(t *testing.T) {
|
|
rnd := common.MustGetRandomInt(randomIntBitLen)
|
|
rndPosRP := common.GetRandomPositiveRelativelyPrimeInt(rnd)
|
|
assert.NotZero(t, rndPosRP, "rand int should not be zero")
|
|
assert.True(t, common.IsNumberInMultiplicativeGroup(rnd, rndPosRP))
|
|
assert.True(t, rndPosRP.Cmp(big.NewInt(0)) == 1, "rand int should be positive")
|
|
// TODO test for relative primeness
|
|
}
|
|
|
|
func TestGetRandomPrimeInt(t *testing.T) {
|
|
prime := common.GetRandomPrimeInt(randomIntBitLen)
|
|
assert.NotZero(t, prime, "rand prime should not be zero")
|
|
assert.True(t, prime.ProbablyPrime(50), "rand prime should be prime")
|
|
}
|