/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/**
* @test
* @bug 4853305 4865198 4888410
* @summary Verify that the RSA KeyPairGenerator works
* @author Andreas Sterbenz
*/
public class TestKeyPairGenerator {
private static byte[] data;
private static void testSignature(String algorithm, PrivateKey privateKey, PublicKey publicKey) throws Exception {
s.initSign(privateKey);
s.initVerify(publicKey);
if (result == false) {
throw new Exception("Verification failed");
}
}
// for SHA384 and SHA512 the data is too long for 512 bit keys
}
}
// regression test for 4865198
byte[] data = new byte[100];
throw new Exception("verification failed");
}
// verify needs to return false and not throw an Exception
try {
throw new Exception("verification unexpectedly succeeded");
}
} catch (SignatureException se) {
// Yet another kind of failure, OK.
}
}
data = new byte[2048];
// keypair generation is very slow, test only a few short keys
int len = keyLengths[i];
} else {
}
throw new Exception("Moduli do not match");
}
throw new Exception("Exponents do not match");
}
}
throw new Exception("Incorrect exponent");
}
}
}
}
}