diff --git a/core/src/main/java/de/fitko/fitconnect/core/crypto/HashUtil.java b/core/src/main/java/de/fitko/fitconnect/core/crypto/HashUtil.java index 5365c28200544e9c45b0e8351475a26096d15fc3..749f043afa960244fef6480d6eaa448516e61967 100644 --- a/core/src/main/java/de/fitko/fitconnect/core/crypto/HashUtil.java +++ b/core/src/main/java/de/fitko/fitconnect/core/crypto/HashUtil.java @@ -1,6 +1,6 @@ package de.fitko.fitconnect.core.crypto; -import de.fitko.fitconnect.api.exceptions.internal.InitializationException; +import de.fitko.fitconnect.api.exceptions.InitializationException; import java.io.File; import java.io.IOException; @@ -18,8 +18,8 @@ public class HashUtil { public HashUtil() { try { this.messageDigest = MessageDigest.getInstance(DEFAULT_ALGORITHM); - } catch (NoSuchAlgorithmException e) { - throw new InitializationException(e.getMessage(),e); + } catch (final NoSuchAlgorithmException e) { + throw new InitializationException(e.getMessage(), e); } } @@ -27,26 +27,26 @@ public class HashUtil { this.messageDigest = messageDigest; } - public byte[] createHash(byte[] data) { + public byte[] createHash(final byte[] data) { this.messageDigest.reset(); return this.messageDigest.digest(data); } - public boolean verify(byte[] originalHash, byte[] data) { - byte[] newHash = createHash(data); + public boolean verify(final byte[] originalHash, final byte[] data) { + final byte[] newHash = createHash(data); return compareHashes(originalHash, newHash); } - public String createHashFromFile(File file) throws IOException { + public String createHashFromFile(final File file) throws IOException { try { - byte[] rawData = Files.readAllBytes(Paths.get(file.getPath())); + final byte[] rawData = Files.readAllBytes(Paths.get(file.getPath())); return new String(rawData); - } catch (IOException e) { + } catch (final IOException e) { throw e; } } - private boolean compareHashes(byte[] originalHash, byte[] comparisonHash) { + private boolean compareHashes(final byte[] originalHash, final byte[] comparisonHash) { int diff = originalHash.length ^ comparisonHash.length; for (int i = 0; i < originalHash.length && i < comparisonHash.length; i++) { diff |= originalHash[i] ^ comparisonHash[i];