aboutsummaryrefslogtreecommitdiffstats
path: root/security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java
diff options
context:
space:
mode:
authorTor Brede Vekterli <vekterli@yahooinc.com>2022-10-17 13:57:00 +0200
committerTor Brede Vekterli <vekterli@yahooinc.com>2022-10-17 13:57:00 +0200
commit3565d47fc019a274a349725b4f7e2b0230937930 (patch)
tree7cf3b7c3b5d5cff14578b4d485f295d6cce9b2e0 /security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java
parentdf20f01fc37186681c017d377e381963dfdbcae2 (diff)
Add some utilities for comparing arrays without data-dependent branches
Lets arrays be compared without leaking information about their contents caused by early exits etc.
Diffstat (limited to 'security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java')
-rw-r--r--security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java54
1 files changed, 54 insertions, 0 deletions
diff --git a/security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java b/security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java
new file mode 100644
index 00000000000..1f160d94c6a
--- /dev/null
+++ b/security-utils/src/main/java/com/yahoo/security/SideChannelSafe.java
@@ -0,0 +1,54 @@
+// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
+package com.yahoo.security;
+
+/**
+ * Utility functions for comparing the contents of arrays without leaking information about the
+ * data contained within them via timing side-channels. This is done by avoiding any branches
+ * that depend on the array elements themselves. This inherently means that all operations have
+ * both an upper and a lower bound in processing time that is O(n) for an array of size n, as there
+ * can be no early exits.
+ *
+ * @author vekterli
+ */
+public class SideChannelSafe {
+
+ /**
+ * @return true iff all bytes in the array are zero. An empty array always returns false
+ * since it technically can't contain any zeros at all.
+ */
+ public static boolean allZeros(byte[] buf) {
+ if (buf.length == 0) {
+ return false;
+ }
+ byte accu = 0;
+ for (byte b : buf) {
+ accu |= b;
+ }
+ return (accu == 0);
+ }
+
+ /**
+ * Compare two byte arrays without the use of data-dependent branching that may leak information
+ * about the contents of either of the arrays.
+ *
+ * <strong>Important:</strong> the <em>length</em> of the arrays is not considered secret, and
+ * will be leaked if arrays of differing sizes are given.
+ *
+ * @param lhs first array of bytes to compare
+ * @param rhs second array of bytes to compare
+ * @return true iff both arrays have the same size and are element-wise identical
+ */
+ public static boolean arraysEqual(byte[] lhs, byte[] rhs) {
+ if (lhs.length != rhs.length) {
+ return false;
+ }
+ // Only use constant time bitwise ops. `accu` will be non-zero if at least one bit
+ // differed in any byte compared between the two arrays.
+ byte accu = 0;
+ for (int i = 0; i < lhs.length; ++i) {
+ accu |= (lhs[i] ^ rhs[i]);
+ }
+ return (accu == 0);
+ }
+
+}