Browse Source

remove loops

tags/1.0.0
zhanglin33 5 years ago
parent
commit
f9633391c1
2 changed files with 22 additions and 32 deletions
  1. +13
    -19
      source/crypto/crypto-adv/src/test/java/test/com/jd/blockchain/crypto/mpc/EqualVerifyTest.java
  2. +9
    -13
      source/crypto/crypto-adv/src/test/java/test/com/jd/blockchain/crypto/mpc/IntCompareTest.java

+ 13
- 19
source/crypto/crypto-adv/src/test/java/test/com/jd/blockchain/crypto/mpc/EqualVerifyTest.java View File

@@ -39,35 +39,29 @@ public class EqualVerifyTest {
byte[] responderOutput;
boolean isEqual;

int i;
sponsorInput = 666;
responderInput = 666;

for (i = 0; i < 1000; i++) {

sponsorInput = 666;
responderInput = 666;

sponsorOutput = EqualVerify.sponsor(sponsorInput,sponsorEPubKeyBytes);
responderOutput = EqualVerify.responder(responderInput,sponsorOutput,
sponsorOutput = EqualVerify.sponsor(sponsorInput,sponsorEPubKeyBytes);
responderOutput = EqualVerify.responder(responderInput,sponsorOutput,
responderEPubKeyBytes,responderEPrivKeyBytes);

isEqual = EqualVerify.sponsorCheck(sponsorInput,responderOutput,sponsorEPrivKeyBytes);
isEqual = EqualVerify.sponsorCheck(sponsorInput,responderOutput,sponsorEPrivKeyBytes);

assertTrue(isEqual);
}
assertTrue(isEqual);

for (i = 0; i < 1000; i++){

sponsorInput = 666;
responderInput = 667;
sponsorInput = 666;
responderInput = 667;

sponsorOutput = EqualVerify.sponsor(sponsorInput,sponsorEPubKeyBytes);
responderOutput = EqualVerify.responder(responderInput,sponsorOutput,
sponsorOutput = EqualVerify.sponsor(sponsorInput,sponsorEPubKeyBytes);
responderOutput = EqualVerify.responder(responderInput,sponsorOutput,
responderEPubKeyBytes,responderEPrivKeyBytes);

isEqual = EqualVerify.sponsorCheck(sponsorInput,responderOutput,sponsorEPrivKeyBytes);
isEqual = EqualVerify.sponsorCheck(sponsorInput,responderOutput,sponsorEPrivKeyBytes);

assertTrue(!isEqual);
assertTrue(!isEqual);
}
}

}

+ 9
- 13
source/crypto/crypto-adv/src/test/java/test/com/jd/blockchain/crypto/mpc/IntCompareTest.java View File

@@ -25,26 +25,22 @@ public class IntCompareTest {
byte[][] cipherArray;
byte[][] aggregatedCipherArray;
int output;
int i;

for (i = 0; i < 1000; i++) {
int sponsorInput = 10000;
int responderInput = 9999;
int sponsorInput = 10000;
int responderInput = 9999;

cipherArray = IntCompare.sponsor(sponsorInput, pubKeyBytes);
aggregatedCipherArray = IntCompare.responder(responderInput, cipherArray, pubKeyBytes);
output = IntCompare.sponsorOutput(aggregatedCipherArray, privKeyBytes);
assertEquals(1, output);
}

for (i = 0; i < 1000; i++) {
int sponsorInput = 10000;
int responderInput = 19999;

cipherArray = IntCompare.sponsor(sponsorInput, pubKeyBytes);
aggregatedCipherArray = IntCompare.responder(responderInput, cipherArray, pubKeyBytes);
output = IntCompare.sponsorOutput(aggregatedCipherArray, privKeyBytes);
assertEquals(0, output);
}
sponsorInput = 10000;
responderInput = 19999;

cipherArray = IntCompare.sponsor(sponsorInput, pubKeyBytes);
aggregatedCipherArray = IntCompare.responder(responderInput, cipherArray, pubKeyBytes);
output = IntCompare.sponsorOutput(aggregatedCipherArray, privKeyBytes);
assertEquals(0, output);
}
}

Loading…
Cancel
Save