Cryptography Efficiency

[joshdgreen]

It worked haha! That was an awesome idea JosAH. Now all I need to do is clean up the code and apply it to the encryption method. Here's the updated decrypt method:

package Application;

public class Decrypt extends Crypto
{	
	public Decrypt(Information word){super(word);}
	
	public char[] getFinalArray(String message, char[] encryptedMessage, char[] encryptArray)
	{
		String orig = "ABCDEFGHIJKLMNOPQRSTUVWXYZ", enc = "";
		for(int j = 0; j < encryptArray.length; j++)
			enc = enc + encryptArray[j];
		
		for(int i = 0; i < encryptedMessage.length; i++)
		{
		     char c = decrypt(message.charAt(i), orig, enc);
		     if (c >= 'A' && c <= 'Z')
		    	 encryptedMessage[i] = c;
		     else if (c == ' ')
		    	 encryptedMessage[i] = c;
		}
					
		return encryptedMessage;
	}	
	
	public char decrypt(char c, String orig, String enc)
	{
		if(c == ' ') return c;
		return orig.charAt(enc.indexOf(c));
	}
}

[joshdgreen]

I think I'll go ahead and call this one: Solved.

REP + 1 to all that helped. Thanks.

[JosAH]

I think I'll go ahead and call this one: Solved.

REP + 1 to all that helped. Thanks.

Cool; now may I suggest the following variant of the key encryption alphabet to strengthen the encryption somewhat:

	private static void encrypt(char[] enc, String password) {
		for (int i= 0; i < enc.length; i++) {
			int t= enc[i]-'a'+password.charAt(i)-'a';
			enc[i]= (char)('a'+t%26);
		}
	}
	private static String encryptKey(String password, String dec) {
		
		char[] enc= dec.toCharArray();
		int n= password.length();

		char[] pw= password.toCharArray();
		for (int j= 0; j < enc.length; j+= n) {
			for (int i= 0; i < pw.length; i++) {
 				char t= enc[i+j];
 				enc[i+j]= enc[pw[i]-'a'];
 				enc[pw[i]-'a']= t;
			}
			pw= Arrays.copyOfRange(enc, j+n, Math.min(enc.length, j+2*n));
			encrypt(pw, password);
			n= pw.length;
			if (n == 0) break;
		}
		return new String(enc);
	}

kind regards,

Jos