Package com.securityinnovation.testvectors

Examples of com.securityinnovation.testvectors.NtruEncryptTestVector

524
525
526
527
528
529
530
531
532
533
534
    // Implements test case NDC-5.
    @Test(expected=DecryptionFailureException.class)
    public void test_decrypt_bad_ciphertext()
        throws NtruException
    {
        NtruEncryptTestVector test = tests[0];
        NtruEncryptKey k = new NtruEncryptKey(getPrivKeyBlob(test));
        byte ct[] = new byte[test.packedE.length];
        System.arraycopy(test.packedE, 0, ct, 0, ct.length);
        ct[2]++;
        k.decrypt(ct);
View Full Code Here
537
538
539
540
541
542
543
544
545
546
547
    // Implements test case NDC-6.
    @Test(expected=DecryptionFailureException.class)
    public void test_decrypt_bad_key()
        throws NtruException
    {
        NtruEncryptTestVector test = tests[0];
        // Generate a new key. The test vector key was generated with
        // test.keygenSeed, so for this new key we will seed the PRNG
        // with test.encryptSeed, which should != keygenSeed.
        Random r = new Random(test.encryptSeed);
        NtruEncryptKey k = NtruEncryptKey.genKey(test.oid, r);
View Full Code Here
551
552
553
554
555
556
557
558
559
    // Implements test case NDC-4.
    @Test(expected=NoPrivateKeyException.class)
    public void test_decrypt_noPrivateKey()
        throws NtruException
    {
        NtruEncryptTestVector test = tests[0];
        NtruEncryptKey k = new NtruEncryptKey(getPubKeyBlob(test));
        k.decrypt(test.packedE);
    }
View Full Code Here
562
563
564
565
566
567
568
569
570
571
    @Test public void test_decrypt_known_value()
        throws NtruException
    {
        for (OID oid : OID.values())
        {
            NtruEncryptTestVector test  = findTest(oid);
            NtruEncryptKey k = new NtruEncryptKey(getPrivKeyBlob(test));
            assertArrayEquals(test.m, k.decrypt(test.packedE));
        }
    }
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
    // Verify the byte->trit and trit->byte operations really
    // are inverses for a variety of trinomials.
    @Test public void test_invertibility()
    {
        NtruEncryptTestVector tests[] = NtruEncryptTestVector.getTestVectors();
        for (int t=0; t<tests.length; t++)
        {
            FullPolynomial p = new FullPolynomial(tests[t].F);
            ByteArrayOutputStream out = new ByteArrayOutputStream();
            MGF_TP_1.encodeTrinomial(p, out);
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
    // test vector
    // r = BGPM3(MGF1(dr, seed=sData));
    @Test public void test_genr()
        throws ParamSetNotSupportedException
    {
        NtruEncryptTestVector tests[] = NtruEncryptTestVector.getTestVectors();
        for (int t=0; t<tests.length; t++)
        {
            KeyParams keyParams = KeyParams.getKeyParams(tests[t].oid);
            FullPolynomial expected = new FullPolynomial(tests[t].r);
            IGF2 igf = new IGF2(
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
    // Use samples from the NtruEncrypt test vector paper:
    //  R = r * h (mod q)
    @Test public void test_convolution()
        throws ParamSetNotSupportedException
    {
        NtruEncryptTestVector tests[] = NtruEncryptTestVector.getTestVectors();
        for (int t=0; t<tests.length; t++)
        {
            KeyParams keyParams = KeyParams.getKeyParams(tests[t].oid);
            FullPolynomial r = new FullPolynomial(tests[t].r);
            FullPolynomial h = new FullPolynomial(tests[t].h);
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
    // Use samples from the NtruEncrypt test vector paper:
    //  e = R + m' (mod q)
    @Test public void test_add()
        throws ParamSetNotSupportedException
    {
        NtruEncryptTestVector tests[] = NtruEncryptTestVector.getTestVectors();
        for (int t=0; t<tests.length; t++)
        {
            KeyParams keyParams = KeyParams.getKeyParams(tests[t].oid);
            FullPolynomial R  = new FullPolynomial(tests[t].R);
            FullPolynomial mP = new FullPolynomial(tests[t].mPrime);
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
    // Use samples from the NtruEncrypt test vector paper:
    //   m' = M + mask (mod p) centered on 0.
    @Test public void test_addAndRecenter()
        throws ParamSetNotSupportedException
    {
        NtruEncryptTestVector tests[] = NtruEncryptTestVector.getTestVectors();
        for (int t=0; t<tests.length; t++)
        {
            KeyParams keyParams = KeyParams.getKeyParams(tests[t].oid);

            // m' = mask + Mtrin (mod p)
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
    // Use samples from the NtruEncrypt test vector paper:
    //  R = e - m' (mod q)
    @Test public void test_subtract()
        throws ParamSetNotSupportedException
    {
        NtruEncryptTestVector tests[] = NtruEncryptTestVector.getTestVectors();
        for (int t=0; t<tests.length; t++)
        {
            KeyParams keyParams = KeyParams.getKeyParams(tests[t].oid);
            FullPolynomial R  = new FullPolynomial(tests[t].R);
            FullPolynomial mP = new FullPolynomial(tests[t].mPrime);
View Full Code Here
TOP

Related Classes of com.securityinnovation.testvectors.NtruEncryptTestVector

  • com.securityinnovation.jNeo.math.BPGM3TestCase
  • com.securityinnovation.jNeo.math.FullPolynomialTestCase
  • com.securityinnovation.jNeo.math.MGF_TP_1TestCase
  • com.securityinnovation.jNeo.ntruencrypt.NtruEncryptKeyBBTestCase
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.