com.jcraft.jsch.KeyPairRSA Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jsch Show documentation
Show all versions of jsch Show documentation
JSch is a pure Java implementation of SSH2 - this is a spork by Roberto Tyley for experimental purposes
The newest version!
/* -*-mode:java; c-basic-offset:2; indent-tabs-mode:nil -*- */
/*
Copyright (c) 2002-2010 ymnk, JCraft,Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
3. The names of the authors may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.jcraft.jsch;
public class KeyPairRSA extends KeyPair{
private byte[] prv_array;
private byte[] pub_array;
private byte[] n_array;
private byte[] p_array; // prime p
private byte[] q_array; // prime q
private byte[] ep_array; // prime exponent p
private byte[] eq_array; // prime exponent q
private byte[] c_array; // coefficient
//private int key_size=0;
private int key_size=1024;
public KeyPairRSA(JSch jsch){
super(jsch);
}
void generate(int key_size) throws JSchException{
this.key_size=key_size;
try{
Class c=Class.forName(jsch.getConfig("keypairgen.rsa"));
KeyPairGenRSA keypairgen=(KeyPairGenRSA)(c.newInstance());
keypairgen.init(key_size);
pub_array=keypairgen.getE();
prv_array=keypairgen.getD();
n_array=keypairgen.getN();
p_array=keypairgen.getP();
q_array=keypairgen.getQ();
ep_array=keypairgen.getEP();
eq_array=keypairgen.getEQ();
c_array=keypairgen.getC();
keypairgen=null;
}
catch(Exception e){
//System.err.println("KeyPairRSA: "+e);
if(e instanceof Throwable)
throw new JSchException(e.toString(), (Throwable)e);
throw new JSchException(e.toString());
}
}
private static final byte[] begin=Util.str2byte("-----BEGIN RSA PRIVATE KEY-----");
private static final byte[] end=Util.str2byte("-----END RSA PRIVATE KEY-----");
byte[] getBegin(){ return begin; }
byte[] getEnd(){ return end; }
byte[] getPrivateKey(){
int content=
1+countLength(1) + 1 + // INTEGER
1+countLength(n_array.length) + n_array.length + // INTEGER N
1+countLength(pub_array.length) + pub_array.length + // INTEGER pub
1+countLength(prv_array.length) + prv_array.length+ // INTEGER prv
1+countLength(p_array.length) + p_array.length+ // INTEGER p
1+countLength(q_array.length) + q_array.length+ // INTEGER q
1+countLength(ep_array.length) + ep_array.length+ // INTEGER ep
1+countLength(eq_array.length) + eq_array.length+ // INTEGER eq
1+countLength(c_array.length) + c_array.length; // INTEGER c
int total=
1+countLength(content)+content; // SEQUENCE
byte[] plain=new byte[total];
int index=0;
index=writeSEQUENCE(plain, index, content);
index=writeINTEGER(plain, index, new byte[1]); // 0
index=writeINTEGER(plain, index, n_array);
index=writeINTEGER(plain, index, pub_array);
index=writeINTEGER(plain, index, prv_array);
index=writeINTEGER(plain, index, p_array);
index=writeINTEGER(plain, index, q_array);
index=writeINTEGER(plain, index, ep_array);
index=writeINTEGER(plain, index, eq_array);
index=writeINTEGER(plain, index, c_array);
return plain;
}
boolean parse(byte [] plain){
/*
byte[] p_array;
byte[] q_array;
byte[] dmp1_array;
byte[] dmq1_array;
byte[] iqmp_array;
*/
try{
int index=0;
int length=0;
if(vendor==VENDOR_FSECURE){
if(plain[index]!=0x30){ // FSecure
Buffer buf=new Buffer(plain);
pub_array=buf.getMPIntBits();
prv_array=buf.getMPIntBits();
n_array=buf.getMPIntBits();
byte[] u_array=buf.getMPIntBits();
p_array=buf.getMPIntBits();
q_array=buf.getMPIntBits();
return true;
}
return false;
}
index++; // SEQUENCE
length=plain[index++]&0xff;
if((length&0x80)!=0){
int foo=length&0x7f; length=0;
while(foo-->0){ length=(length<<8)+(plain[index++]&0xff); }
}
if(plain[index]!=0x02)return false;
index++; // INTEGER
length=plain[index++]&0xff;
if((length&0x80)!=0){
int foo=length&0x7f; length=0;
while(foo-->0){ length=(length<<8)+(plain[index++]&0xff); }
}
index+=length;
//System.err.println("int: len="+length);
//System.err.print(Integer.toHexString(plain[index-1]&0xff)+":");
//System.err.println("");
index++;
length=plain[index++]&0xff;
if((length&0x80)!=0){
int foo=length&0x7f; length=0;
while(foo-->0){ length=(length<<8)+(plain[index++]&0xff); }
}
n_array=new byte[length];
System.arraycopy(plain, index, n_array, 0, length);
index+=length;
/*
System.err.println("int: N len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
pub_array=new byte[length];
System.arraycopy(plain, index, pub_array, 0, length);
index+=length;
/*
System.err.println("int: E len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
prv_array=new byte[length];
System.arraycopy(plain, index, prv_array, 0, length);
index+=length;
/*
System.err.println("int: prv len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
p_array=new byte[length];
System.arraycopy(plain, index, p_array, 0, length);
index+=length;
/*
System.err.println("int: P len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
q_array=new byte[length];
System.arraycopy(plain, index, q_array, 0, length);
index+=length;
/*
System.err.println("int: q len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
ep_array=new byte[length];
System.arraycopy(plain, index, ep_array, 0, length);
index+=length;
/*
System.err.println("int: ep len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
eq_array=new byte[length];
System.arraycopy(plain, index, eq_array, 0, length);
index+=length;
/*
System.err.println("int: eq len="+length);
for(int i=0; i0){ length=(length<<8)+(plain[index++]&0xff); }
}
c_array=new byte[length];
System.arraycopy(plain, index, c_array, 0, length);
index+=length;
/*
System.err.println("int: c len="+length);
for(int i=0; i