/*
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements.  See the NOTICE file
distributed with this work for additional information
regarding copyright ownership.  The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License.  You may obtain a copy of the License at

  http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied.  See the License for the
specific language governing permissions and limitations
under the License.
*/

/* test driver and function exerciser for ECDH/ECIES/ECDSA API Functions */

package org.apache.milagro.amcl.XXX;

import java.util.Scanner;
import junit.framework.TestCase;
import org.apache.milagro.amcl.RAND;

public class TesttimeRSA extends TestCase
{   
	public static final int MIN_TIME=10; /* seconds */
	public static final int MIN_ITERS=10; 

	public static void testtimeRSA()
	{
		byte[] RAW=new byte[100];
		RAND rng=new RAND();
		int i,iterations;
		long start,elapsed;
		double dur;
		public_key pub=new public_key(FF.FFLEN);
		private_key priv=new private_key(FF.HFLEN);

		rng.clean();
		for (i=0;i<100;i++) RAW[i]=(byte)(i);
		rng.seed(100,RAW);

		byte[] P=new byte[RSA.RFS];
		byte[] M=new byte[RSA.RFS];
		byte[] C=new byte[RSA.RFS];

		System.out.println("Testing/Timing  RSA");
		System.out.println("Generating RSA public/private key pair");

		iterations=0;
		start=System.currentTimeMillis();
		do {
			RSA.KEY_PAIR(rng,65537,priv,pub);
			iterations++;
			elapsed=(System.currentTimeMillis()-start);
		} while (elapsed<MIN_TIME*1000 || iterations<MIN_ITERS);
		dur=(double)elapsed/iterations;
		System.out.format("RSA gen - %8d iterations  ",iterations);
		System.out.format(" %8.2f ms per iteration\n",dur);

		for (i=0;i<RSA.RFS;i++) M[i]=(byte)(i%128);

		iterations=0;
		start=System.currentTimeMillis();
		do {
			RSA.ENCRYPT(pub,M,C);
			iterations++;
			elapsed=(System.currentTimeMillis()-start);
		} while (elapsed<MIN_TIME*1000 || iterations<MIN_ITERS);
		dur=(double)elapsed/iterations;
    	System.out.format("RSA enc - %8d iterations  ",iterations);
    	System.out.format(" %8.2f ms per iteration\n",dur);

		iterations=0;
		start=System.currentTimeMillis();
		do {
			RSA.DECRYPT(priv,C,P);
			iterations++;
			elapsed=(System.currentTimeMillis()-start);
		} while (elapsed<MIN_TIME*1000 || iterations<MIN_ITERS);
		dur=(double)elapsed/iterations;
    	System.out.format("RSA dec - %8d iterations  ",iterations);
    	System.out.format(" %8.2f ms per iteration\n",dur);

		for (i=0;i<RSA.RFS;i++)
		{
			if (P[i]!=M[i])
			{
				fail("FAILURE - RSA decryption");
			}
		}

		System.out.print("All tests pass\n");
	}
}