george/PrivateBin
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

bn_mod and bn_mulmod tests

Browse Source
This commit is contained in:
Quinn Slack
2011-04-19 15:09:25 -07:00
parent e6cc1dd6a1
commit de23a4016c
2 changed files with 74 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
test/bn_test.js
View File

@@ -1,3 +1,48 @@
new sjcl.test.TestCase("Bignum modular reduction test", function (cb) {
if (!sjcl.bn) {
this.unimplemented();
cb && cb();
return;
}
var a, N, r;
for (i=0; i < sjcl.test.vector.bn_mod.length; i++) {
tv = sjcl.test.vector.bn_mod[i];
try {
a = new sjcl.bn(tv.a);
N = new sjcl.bn(tv.N);
r = a.mod(N);
this.require(r.equals(new sjcl.bn(tv.r)));
} catch(e) {
this.fail(e);
}
}
cb && cb();
});
new sjcl.test.TestCase("Bignum modular multiplication test", function (cb) {
if (!sjcl.bn) {
this.unimplemented();
cb && cb();
return;
}
var a, b, N, r;
for(var j=0;j<10;j++)for (i=0; i < sjcl.test.vector.bn_mulmod.length; i++) {
tv = sjcl.test.vector.bn_mulmod[i];
try {
a = new sjcl.bn(tv.a);
b = new sjcl.bn(tv.b);
N = new sjcl.bn(tv.N);
r = a.mulmod(b, N);
this.require(r.equals(new sjcl.bn(tv.r)));
} catch(e) {
this.fail(e);
}
}
cb && cb();
});
new sjcl.test.TestCase("Bignum modular exponentiation test", function (cb) {
if (!sjcl.bn) {
this.unimplemented();