Examples of RSAPrivateCrtKeyParameters

Examples of org.bouncycastle.crypto.params.RSAPrivateCrtKeyParameters

179
180
181
182
183
184
185
186
187
188
189
    BigInteger intPrimeQ = new BigInteger(primeQ);
    BigInteger intPrimeExponentP = new BigInteger(primeExponentP);
    BigInteger intPrimeExponentQ = new BigInteger(primeExponentQ);
    BigInteger intCrtCoefficient = new BigInteger(crtCoefficient);

    RSAPrivateCrtKeyParameters RSAprivKey =  new RSAPrivateCrtKeyParameters
            (intModulus, intPubExponent, intPrivExponent, intPrimeP,
            intPrimeQ, intPrimeExponentP, intPrimeExponentQ, intCrtCoefficient);
    byte[] toDecrypt = Hex.decode(input);
    cipher = new PKCS1Encoding(new RSAEngine());
    cipher.init(false, RSAprivKey);
View Full Code Here

Examples of org.bouncycastle.crypto.params.RSAPrivateCrtKeyParameters

128
129
130
131
132
133
134
135
136
137
        public KeyPair generateKeyPair()
        {
            AsymmetricCipherKeyPair     pair = engine.generateKeyPair();
            RSAKeyParameters            pub = (RSAKeyParameters)pair.getPublic();
            RSAPrivateCrtKeyParameters  priv = (RSAPrivateCrtKeyParameters)pair.getPrivate();

            return new KeyPair(new JCERSAPublicKey(pub),
                               new JCERSAPrivateCrtKey(priv));
        }
View Full Code Here

Examples of org.bouncycastle.crypto.params.RSAPrivateCrtKeyParameters

135
136
137
138
139
140
141
        dQ = d.remainder(qSub1);
        qInv = q.modInverse(p);

        return new AsymmetricCipherKeyPair(
                new RSAKeyParameters(false, n, e),
                new RSAPrivateCrtKeyParameters(n, e, d, p, q, dP, dQ, qInv));
    }
View Full Code Here

Examples of org.bouncycastle2.crypto.params.RSAPrivateCrtKeyParameters

37
38
39
40
41
42
43
44
45
46
47
    {
        if (key instanceof RSAPrivateCrtKey)
        {
            RSAPrivateCrtKey    k = (RSAPrivateCrtKey)key;

            return new RSAPrivateCrtKeyParameters(k.getModulus(),
                k.getPublicExponent(), k.getPrivateExponent(),
                k.getPrimeP(), k.getPrimeQ(), k.getPrimeExponentP(),                            k.getPrimeExponentQ(), k.getCrtCoefficient());
        }
        else
        {
View Full Code Here

Examples of org.bouncycastle2.crypto.params.RSAPrivateCrtKeyParameters

108
109
110
111
112
113
114
115
116
117
        public KeyPair generateKeyPair()
        {
            AsymmetricCipherKeyPair     pair = engine.generateKeyPair();
            RSAKeyParameters            pub = (RSAKeyParameters)pair.getPublic();
            RSAPrivateCrtKeyParameters  priv = (RSAPrivateCrtKeyParameters)pair.getPrivate();

            return new KeyPair(new JCERSAPublicKey(pub),
                               new JCERSAPrivateCrtKey(priv));
        }
View Full Code Here

Examples of org.bouncycastle2.crypto.params.RSAPrivateCrtKeyParameters

140
141
142
143
144
145
146
        dQ = d.remainder(qSub1);
        qInv = q.modInverse(p);

        return new AsymmetricCipherKeyPair(
                new RSAKeyParameters(false, n, e),
                new RSAPrivateCrtKeyParameters(n, e, d, p, q, dP, dQ, qInv));
    }
View Full Code Here

Examples of org.bouncycastle2.crypto.params.RSAPrivateCrtKeyParameters

95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
        BigInteger input = core.convertInput(in, inOff, inLen);

        BigInteger result;
        if (key instanceof RSAPrivateCrtKeyParameters)
        {
            RSAPrivateCrtKeyParameters k = (RSAPrivateCrtKeyParameters)key;

            BigInteger e = k.getPublicExponent();
            if (e != null)   // can't do blinding without a public exponent
            {
                BigInteger m = k.getModulus();
                BigInteger r = BigIntegers.createRandomInRange(ONE, m.subtract(ONE), random);

                BigInteger blindedInput = r.modPow(e, m).multiply(input).mod(m);
                BigInteger blindedResult = core.processBlock(blindedInput);
View Full Code Here

Examples of org.bouncycastle2.crypto.params.RSAPrivateCrtKeyParameters

165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
            //
            // we have the extra factors, use the Chinese Remainder Theorem - the author
            // wishes to express his thanks to Dirk Bonekaemper at rtsffm.com for
            // advice regarding the expression of this.
            //
            RSAPrivateCrtKeyParameters crtKey = (RSAPrivateCrtKeyParameters)key;

            BigInteger p = crtKey.getP();
            BigInteger q = crtKey.getQ();
            BigInteger dP = crtKey.getDP();
            BigInteger dQ = crtKey.getDQ();
            BigInteger qInv = crtKey.getQInv();

            BigInteger mP, mQ, h, m;

            // mP = ((input mod p) ^ dP)) mod p
            mP = (input.remainder(p)).modPow(dP, p);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.