diff options
author | Roberto Tyley <roberto.tyley@gmail.com> | 2014-07-15 01:38:01 +0400 |
---|---|---|
committer | Roberto Tyley <roberto.tyley@gmail.com> | 2014-07-26 11:23:17 +0400 |
commit | 7cb752aaf746dc0b473afeb9e892b7fbc12666c5 (patch) | |
tree | cc4f91ddc18332b5adbe82e3fcb040d976c90105 /core/src/test/java/org/spongycastle/crypto/agreement/test/JPAKEPrimeOrderGroupTest.java | |
parent | 551830f8ea5177042af2c7dd1fc90888bc67387d (diff) |
Execute become-spongy.sh
https://github.com/rtyley/spongycastle/blob/3040af/become-spongy.sh
Diffstat (limited to 'core/src/test/java/org/spongycastle/crypto/agreement/test/JPAKEPrimeOrderGroupTest.java')
-rw-r--r-- | core/src/test/java/org/spongycastle/crypto/agreement/test/JPAKEPrimeOrderGroupTest.java | 85 |
1 files changed, 85 insertions, 0 deletions
diff --git a/core/src/test/java/org/spongycastle/crypto/agreement/test/JPAKEPrimeOrderGroupTest.java b/core/src/test/java/org/spongycastle/crypto/agreement/test/JPAKEPrimeOrderGroupTest.java new file mode 100644 index 00000000..b02a8f6c --- /dev/null +++ b/core/src/test/java/org/spongycastle/crypto/agreement/test/JPAKEPrimeOrderGroupTest.java @@ -0,0 +1,85 @@ +package org.spongycastle.crypto.agreement.test; + +import java.math.BigInteger; + +import junit.framework.TestCase; +import org.spongycastle.crypto.CryptoException; +import org.spongycastle.crypto.agreement.jpake.JPAKEPrimeOrderGroup; + +public class JPAKEPrimeOrderGroupTest + extends TestCase +{ + + public void testConstruction() + throws CryptoException + { + // p-1 not evenly divisible by q + try + { + new JPAKEPrimeOrderGroup(BigInteger.valueOf(7), BigInteger.valueOf(5), BigInteger.valueOf(6)); + fail(); + } + catch (IllegalArgumentException e) + { + // pass + } + + // g < 2 + try + { + new JPAKEPrimeOrderGroup(BigInteger.valueOf(11), BigInteger.valueOf(5), BigInteger.valueOf(1)); + fail(); + } + catch (IllegalArgumentException e) + { + // pass + } + + // g > p-1 + try + { + new JPAKEPrimeOrderGroup(BigInteger.valueOf(11), BigInteger.valueOf(5), BigInteger.valueOf(11)); + fail(); + } + catch (IllegalArgumentException e) + { + // pass + } + + // g^q mod p not equal 1 + try + { + new JPAKEPrimeOrderGroup(BigInteger.valueOf(11), BigInteger.valueOf(5), BigInteger.valueOf(6)); + fail(); + } + catch (IllegalArgumentException e) + { + // pass + } + + // p not prime + try + { + new JPAKEPrimeOrderGroup(BigInteger.valueOf(15), BigInteger.valueOf(2), BigInteger.valueOf(4)); + fail(); + } + catch (IllegalArgumentException e) + { + // pass + } + + // q not prime + try + { + new JPAKEPrimeOrderGroup(BigInteger.valueOf(7), BigInteger.valueOf(6), BigInteger.valueOf(3)); + fail(); + } + catch (IllegalArgumentException e) + { + // pass + } + + // should succeed + new JPAKEPrimeOrderGroup(BigInteger.valueOf(7), BigInteger.valueOf(3), BigInteger.valueOf(4)); + } +} |