algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-23 04:20:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enable MultipleVariableDeclarations in checkstyle (#5175)

Browse Source 
Co-authored-by: vaibhav <vaibhav.waghmare@techprescient.com>
This commit is contained in:
vaibhav9t1
2024-05-25 23:48:27 +05:30
committed by GitHub
parent 44ce6e7b0d
commit 9eaa2bb756
82 changed files with 299 additions and 121 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/main/java/com/thealgorithms/ciphers/Blowfish.java
View File

@ -1175,7 +1175,8 @@ public class Blowfish {
// round function
private String round(int time, String plainText) {
String left, right;
String left;
String right;
left = plainText.substring(0, 8);
right = plainText.substring(8, 16);
left = xor(left, P[time]);

23
src/main/java/com/thealgorithms/ciphers/DES.java
View File

@ -74,13 +74,15 @@ public class DES {
private String[] getSubkeys(String originalKey) {
StringBuilder permutedKey = new StringBuilder(); // Initial permutation of keys via pc1
int i, j;
int i;
int j;
for (i = 0; i < 56; i++) {
permutedKey.append(originalKey.charAt(PC1[i] - 1));
}
String[] subKeys = new String[16];
String initialPermutedKey = permutedKey.toString();
String C0 = initialPermutedKey.substring(0, 28), D0 = initialPermutedKey.substring(28);
String C0 = initialPermutedKey.substring(0, 28);
String D0 = initialPermutedKey.substring(28);
// We will now operate on the left and right halves of the permutedKey
for (i = 0; i < 16; i++) {
@ -105,7 +107,8 @@ public class DES {
}
private String XOR(String a, String b) {
int i, l = a.length();
int i;
int l = a.length();
StringBuilder xor = new StringBuilder();
for (i = 0; i < l; i++) {
int firstBit = a.charAt(i) - 48; // 48 is '0' in ascii
@ -116,7 +119,8 @@ public class DES {
}
private String createPaddedString(String s, int desiredLength, char pad) {
int i, l = s.length();
int i;
int l = s.length();
StringBuilder paddedString = new StringBuilder();
int diff = desiredLength - l;
for (i = 0; i < diff; i++) {
@ -165,7 +169,8 @@ public class DES {
for (i = 0; i < 64; i++) {
permutedMessage.append(message.charAt(IP[i] - 1));
}
String L0 = permutedMessage.substring(0, 32), R0 = permutedMessage.substring(32);
String L0 = permutedMessage.substring(0, 32);
String R0 = permutedMessage.substring(32);
// Iterate 16 times
for (i = 0; i < 16; i++) {
@ -198,7 +203,9 @@ public class DES {
*/
public String encrypt(String message) {
StringBuilder encryptedMessage = new StringBuilder();
int l = message.length(), i, j;
int l = message.length();
int i;
int j;
if (l % 8 != 0) {
int desiredLength = (l / 8 + 1) * 8;
l = desiredLength;
@ -223,7 +230,9 @@ public class DES {
*/
public String decrypt(String message) {
StringBuilder decryptedMessage = new StringBuilder();
int l = message.length(), i, j;
int l = message.length();
int i;
int j;
if (l % 64 != 0) {
throw new IllegalArgumentException("Encrypted message should be a multiple of 64 characters in length");
}

11
src/main/java/com/thealgorithms/ciphers/HillCipher.java
View File

@ -48,7 +48,8 @@ public final class HillCipher {
System.out.println(messageVector[i][0]);
j++;
}
int x, i;
int x;
int i;
for (i = 0; i < matrixSize; i++) {
cipherMatrix[i][0] = 0;
@ -96,7 +97,8 @@ public final class HillCipher {
System.out.println(messageVector[i][0]);
j++;
}
int x, i;
int x;
int i;
for (i = 0; i < n; i++) {
plainMatrix[i][0] = 0;
@ -115,7 +117,10 @@ public final class HillCipher {
// Determinant calculator
public static int determinant(int[][] a, int n) {
int det = 0, sign = 1, p = 0, q = 0;
int det = 0;
int sign = 1;
int p = 0;
int q = 0;
if (n == 1) {
det = a[0][0];