|
| 1 | +package ciphers; |
| 2 | + |
| 3 | +/** |
| 4 | + * A Java implementation of Vigenere Cipher. |
| 5 | + * @author straiffix |
| 6 | + */ |
| 7 | + |
| 8 | + |
| 9 | +public class Vigenere { |
| 10 | + |
| 11 | + public static String encrypt(final String message, final String key) |
| 12 | + { |
| 13 | + |
| 14 | + String result = ""; |
| 15 | + |
| 16 | + for (int i = 0, j = 0; i < message.length(); i++) { |
| 17 | + char c = message.charAt(i); |
| 18 | + if (Character.isLetter(c)){ |
| 19 | + if(Character.isUpperCase(c)) { |
| 20 | + result += (char) ((c + key.toUpperCase().charAt(j) - 2 * 'A') % 26 + 'A'); |
| 21 | + |
| 22 | + } else { |
| 23 | + result += (char) ((c + key.toLowerCase().charAt(j) - 2 * 'a') % 26 + 'a'); |
| 24 | + |
| 25 | + } |
| 26 | + } else { |
| 27 | + result+=c; |
| 28 | + } |
| 29 | + j = ++j % key.length(); |
| 30 | + } |
| 31 | + return result; |
| 32 | + } |
| 33 | + |
| 34 | + public static String decrypt( final String message, final String key) |
| 35 | + { |
| 36 | + String result =""; |
| 37 | + |
| 38 | + for(int i = 0, j = 0; i < message.length(); i++){ |
| 39 | + |
| 40 | + char c = message.charAt(i); |
| 41 | + if (Character.isLetter(c)){ |
| 42 | + if(Character.isUpperCase(c)) { |
| 43 | + result += ((char)('Z'-(25-(c-key.toUpperCase().charAt(j)))%26)); |
| 44 | + |
| 45 | + } else { |
| 46 | + result += ((char)('z'-(25-(c-key.toLowerCase().charAt(j)))%26)); |
| 47 | + |
| 48 | + } |
| 49 | + } else { |
| 50 | + result+=c; |
| 51 | + } |
| 52 | + |
| 53 | + j = ++j % key.length(); |
| 54 | + |
| 55 | + } |
| 56 | + return result; |
| 57 | + } |
| 58 | + public static void main (String [] args){ |
| 59 | + String text="Hello World!"; |
| 60 | + String key="itsakey"; |
| 61 | + System.out.println(text); |
| 62 | + String ciphertext=encrypt(text, key); |
| 63 | + System.out.println(ciphertext); |
| 64 | + System.out.println(decrypt(ciphertext, key)); |
| 65 | + |
| 66 | + } |
| 67 | +} |
0 commit comments