Package org.bouncycastle.crypto.params

Examples of org.bouncycastle.crypto.params.RSAPrivateCrtKeyParameters

91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
            throw new IllegalStateException("RSA engine not initialised");
        }

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

            if (k.getPublicExponent() != null)   // can't do blinding without a public exponent
            {
                BigInteger input = core.convertInput(in, inOff, inLen);
                BigInteger m = k.getModulus();
                BigInteger r = calculateR(m);
                BigInteger result = core.processBlock(r.modPow(k.getPublicExponent(), m).multiply(input).mod(m));

                return core.convertOutput(result.multiply(r.modInverse(m)).mod(m));
            }

            return core.convertOutput(core.processBlock(core.convertInput(in, inOff, inLen)));
View Full Code Here
124
125
126
127
128
129
130
131
132
133
        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
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
            //
            // 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
50
51
52
53
54
55
56
57
58
59
60
       
        if (algId.getObjectId().equals(PKCSObjectIdentifiers.rsaEncryption))
        {
            RSAPrivateKeyStructure  keyStructure = new RSAPrivateKeyStructure((ASN1Sequence)keyInfo.getPrivateKey());

            return new RSAPrivateCrtKeyParameters(
                                        keyStructure.getModulus(),
                                        keyStructure.getPublicExponent(),
                                        keyStructure.getPrivateExponent(),
                                        keyStructure.getPrime1(),
                                        keyStructure.getPrime2(),
View Full Code Here
356
357
358
359
360
361
362
363
364
365
366
            RSAKeyParameters    pubParameters = new RSAKeyParameters(
                                                        false,
                                                        pubStruct.getModulus(),
                                                        pubStruct.getPublicExponent());
   
            RSAKeyParameters    privParameters = new RSAPrivateCrtKeyParameters(
                                                        privStruct.getModulus(),
                                                        privStruct.getPublicExponent(),
                                                        privStruct.getPrivateExponent(),
                                                        privStruct.getPrime1(),
                                                        privStruct.getPrime2(),
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
            //
            // 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
42
43
44
45
46
47
48
49
50
51
52
    }

    public TestResult perform()
    {
        RSAKeyParameters    pubParameters = new RSAKeyParameters(false, mod, pubExp);
        RSAKeyParameters    privParameters = new RSAPrivateCrtKeyParameters(mod, pubExp, privExp, p, q, pExp, qExp, crtCoef);
        byte[]              data = Hex.decode(edgeInput);

        //
        // RAW
        //
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
      new RSAKeyGenerationParameters(pubExp, sr, key_size, 80);
    RSAKeyPairGenerator kpgen=new RSAKeyPairGenerator();
    kpgen.init(RSAKeyGenPara);
    AsymmetricCipherKeyPair keyPair=kpgen.generateKeyPair();

    RSAPrivateCrtKeyParameters prvKey=
      (RSAPrivateCrtKeyParameters) keyPair.getPrivate();
    RSAKeyParameters pubKey=
      (RSAKeyParameters) keyPair.getPublic();

    e=pubKey.getExponent().toByteArray();
    n=prvKey.getModulus().toByteArray();

    d=prvKey.getExponent().toByteArray();
    c=prvKey.getQInv().toByteArray();
    ep=prvKey.getDP().toByteArray();
    eq=prvKey.getDQ().toByteArray();
    p=prvKey.getP().toByteArray();
    q=prvKey.getQ().toByteArray();
  }
View Full Code Here
25
26
27
28
29
30
31
32
33
34
35
    {
        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
TOP

Related Classes of org.bouncycastle.crypto.params.RSAPrivateCrtKeyParameters

  • com.jcraft.jsch.bc.KeyPairGenRSA
  • Cryptography
  • org.bouncycastle.crypto.engines.RSABlindedEngine
  • org.bouncycastle.crypto.engines.RSACoreEngine
  • org.bouncycastle.crypto.engines.RSAEngine
  • org.bouncycastle.crypto.generators.RSAKeyPairGenerator
  • org.bouncycastle.crypto.test.OAEPTest$OAEPTester
  • org.bouncycastle.crypto.test.RSATest
  • org.bouncycastle.crypto.util.PrivateKeyFactory
  • org.bouncycastle.crypto.util.PrivateKeyInfoFactory
    • 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.