arno/trezor-firmware
1
0
Fork 0
mirror of https://github.com/trezor/trezor-firmware.git synced 2025-06-26 09:52:34 +00:00
Code Issues Releases Wiki Activity

Fixed unit test for addmod added test for add.

Browse Source 
- bn_addmod: now only guarantees result < 2*prime.
- bn_add: new test
- bn_mult_half: fixed normalization of prime -> 0.
This commit is contained in:
Jochen Hoenicke 2015-08-07 11:15:10 +02:00
parent f93b003cbc
commit 11d14a3946
1 changed files with 14 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
test_curves.py
View File

@ -129,7 +129,7 @@ def test_mult_half(curve, r):
y = int2bn(x) y = int2bn(x)
lib.bn_mult_half(y, int2bn(curve.p)) lib.bn_mult_half(y, int2bn(curve.p))
y = bn2int(y) y = bn2int(y)
if y > curve.p: if y >= curve.p:
y -= curve.p y -= curve.p
half = ecdsa.numbertheory.inverse_mod(2, curve.p) half = ecdsa.numbertheory.inverse_mod(2, curve.p)
assert y == (x * half) % curve.p assert y == (x * half) % curve.p
@ -156,6 +156,17 @@ def test_subtract2(r):
assert z == z_ assert z == z_
def test_add(curve, r):
x = r.randrange(0, 2 ** 256)
y = r.randrange(0, 2 ** 256)
z_ = x + y
z = int2bn(x)
lib.bn_add(z, int2bn(y))
z = bn2int(z)
assert z == z_
def test_addmod(curve, r): def test_addmod(curve, r):
x = r.randrange(0, 2 ** 256) x = r.randrange(0, 2 ** 256)
y = r.randrange(0, 2 ** 256) y = r.randrange(0, 2 ** 256)
@ -163,7 +174,8 @@ def test_addmod(curve, r):
z = int2bn(x) z = int2bn(x)
lib.bn_addmod(z, int2bn(y), int2bn(curve.p)) lib.bn_addmod(z, int2bn(y), int2bn(curve.p))
z = bn2int(z) z = bn2int(z)
if z >= curve.p:
z = z - curve.p
assert z == z_ assert z == z_