Java非对称加密的源代码(RSA)
来源:优易学  2010-1-15 14:38:26   【优易学:中国教育考试门户网】   资料下载   IT书店

 

  public static RSAPrivateKey generateRSAPrivateKey(byte[] modulus, byte[] privateExponent) throws EncryptException {

  KeyFactory keyFac = null;

  try {

  keyFac = KeyFactory.getInstance("RSA", new org.bouncycastle.jce.provider.BouncyCastleProvider());

  } catch (NoSuchAlgorithmException ex) {

  throw new EncryptException(ex.getMessage());

  }

  RSAPrivateKeySpec priKeySpec = new RSAPrivateKeySpec(new BigInteger(modulus), new BigInteger(privateExponent));

  try {

  return (RSAPrivateKey) keyFac.generatePrivate(priKeySpec);

  } catch (InvalidKeySpecException ex) {

  throw new EncryptException(ex.getMessage());

  }

  }

  /**

  * 加密

  * @param key 加密的密钥

  * @param data 待加密的明文数据

  * @return 加密后的数据

  * @throws EncryptException

  */

  public static byte[] encrypt(Key key, byte[] data) throws EncryptException {

  try {

  Cipher cipher = Cipher.getInstance("RSA", new org.bouncycastle.jce.provider.BouncyCastleProvider());

  cipher.init(Cipher.ENCRYPT_MODE, key);

  int blockSize = cipher.getBlockSize();//获得加密块大小,如:加密前数据为128个byte,而key_size=1024 加密块大小为127 byte,加密后为128个byte;因此共有2个加密块,第一个127 byte第二个为1个byte

  int outputSize = cipher.getOutputSize(data.length);//获得加密块加密后块大小

  int leavedSize = data.length % blockSize;

  int blocksSize = leavedSize != 0 ? data.length / blockSize + 1 : data.length / blockSize;

  byte[] raw = new byte[outputSize * blocksSize];

  int i = 0;

上一页  [1] [2] [3] [4] [5] 下一页

责任编辑:cyth

文章搜索:
 相关文章
热点资讯
资讯快报
热门课程培训