恶意软件检测系统Android端代码.zip

package cn.hobom.mobile.datacollector.util; import java.io.Serializable; import java.math.BigInteger; import java.security.MessageDigest; import java.security.NoSuchAlgorithmException; import java.util.Arrays; import java.util.BitSet; import java.util.Random; import java.util.function.BiFunction; import java.util.zip.Adler32; import java.util.zip.CRC32; import java.util.zip.Checksum; /** * */ public class HashProvider { private static final int seed32 = 89478583; /** * @param a the byte array to be hashed * @return the 32 bit integer hash value */ static int hashBytes(byte a[]) { // 32 bit FNV constants. Using longs as Java does not support unsigned // datatypes. final long FNV_PRIME = 16777619; final long FNV_OFFSET_BASIS = 2166136261l; if (a == null) return 0; long result = FNV_OFFSET_BASIS; for (byte element : a) { result = (result * FNV_PRIME) & 0xFFFFFFFF; result ^= element; } // return Arrays.hashCode(a); return (int) result; } /** * @param value the value to be hashed * @param m integer output range [1,size] * @param k number of hashes to be computed * @return array with <i>hashes</i> integer hash positions in the range <i>[0,size)</i> */ public static int[] hashCarterWegman(byte[] value, int m, int k) { int[] positions = new int[k]; BigInteger prime32 = BigInteger.valueOf(4294967279l); BigInteger prime64 = BigInteger.valueOf(53200200938189l); BigInteger prime128 = new BigInteger("21213943449988109084994671"); Random r = new Random(seed32); //BigInteger.valueOf(hashBytes(value) BigInteger v = new BigInteger(value.length > 0 ? value : new byte[1]); for (int i = 0; i < k; i++) { BigInteger a = BigInteger.valueOf(r.nextLong()); BigInteger b = BigInteger.valueOf(r.nextLong()); positions[i] = a.multiply(v).add(b).mod(prime64) .mod(BigInteger.valueOf(m)).intValue(); } return positions; } /** * @param value the value to be hashed * @param m integer output range [1,size] * @param k number of hashes to be computed * @return array with <i>hashes</i> integer hash positions in the range <i>[0,size)</i> */ public static int[] hashRNG(byte[] value, int m, int k) { int[] positions = new int[k]; Random r = new Random(hashBytes(value)); for (int i = 0; i < k; i++) { positions[i] = r.nextInt(m); } return positions; } /** * @param value the value to be hashed * @param m integer output range [1,size] * @param k number of hashes to be computed * @return array with <i>hashes</i> integer hash positions in the range <i>[0,size)</i> */ public static int[] hashCRC(byte[] value, int m, int k) { return hashChecksum(value, new CRC32(), m, k); } /** * @param value the value to be hashed * @param m integer output range [1,size] * @param k number of hashes to be computed * @return array with <i>hashes</i> integer hash positions in the range <i>[0,size)</i> */ public static int[] hashAdler(byte[] value, int m, int k) { return hashChecksum(value, new Adler32(), m, k); } public static int[] hashChecksum(byte[] value, Checksum cs, int m, int k) { int[] positions = new int[k]; int hashes = 0; int salt = 0; while (hashes < k) { cs.reset(); cs.update(value, 0, value.length); // Modify the data to be checksummed by adding the number of already // calculated hashes, the loop counter and // a static seed cs.update(hashes + salt++ + seed32); int hash = rejectionSample((int) cs.getValue(), m); if (hash != -1) { positions[hashes++] = hash; } } return positions; } /** * @param value the value to be hashed * @param m integer output range [1,size] * @param k number of hashes to be computed * @return array with <i>hashes</i> integer hash positions in the range <i>[0,size)</i> */ public static int[] hashSimpleLCG(byte[] value, int m, int k) { // Java constants final long multiplier = 0x5DEECE66DL; final long addend = 0xBL; final long mask = (1L << 48) - 1; // Generate int from byte Array using the FNV hash int reduced = Math.abs(hashBytes(value)); // Make number positive // Handle the special case: smallest negative number is itself as the // absolute value if (reduced == Integer.MIN_VALUE) reduced = 42; // Calculate hashes numbers iteratively int[] positions = new int[k]; long seed = reduced; for (int i = 0; i < k; i++) { // LCG formula: x_i+1 = (multiplier * x_i + addend) mod mask seed = (seed * multiplier + addend) & mask; positions[i] = (int) (seed >>> (48 - 30)) % m; } return positions; } public static int[] hashMurmur3(byte[] value, int m, int k) { return rejectionSample(HashProvider::murmur3, value, m, k); } public static int[] hashCassandra(byte[] value, int m, int k) { int[] result = new int[k]; int hash1 = murmur3(0, value); int hash2 = murmur3((int) hash1, value); for (int i = 0; i < k; i++) { result[i] = Math.abs((hash1 + i * hash2) % m); } return result; } public static int murmur3(int seed, byte[] bytes) { int h1 = seed; //Standard in Guava int c1 = 0xcc9e2d51; int c2 = 0x1b873593; int len = bytes.length; int i = 0; while (len >= 4) { //process() int k1 = bytes[i + 0] & 0xFF; k1 |= (bytes[i + 1] & 0xFF) << 8; k1 |= (bytes[i + 2] & 0xFF) << 16; k1 |= (bytes[i + 3] & 0xFF) << 24; k1 *= c1; k1 = Integer.rotateLeft(k1, 15); k1 *= c2; h1 ^= k1; h1 = Integer.rotateLeft(h1, 13); h1 = h1 * 5 + 0xe6546b64; len -= 4; i += 4; } if (len > 0) { //processingRemaining() int k1 = 0; switch (len) { case 3: k1 ^= (bytes[i + 2] & 0xFF) << 16; // fall through case 2: k1 ^= (bytes[i + 1] & 0xFF) << 8; // fall through case 1: k1 ^= (bytes[i] & 0xFF); // fall through default: k1 *= c1; k1 = Integer.rotateLeft(k1, 15); k1 *= c2; h1 ^= k1; } i += len; } //makeHash() h1 ^= i; h1 ^= h1 >>> 16; h1 *= 0x85ebca6b; h1 ^= h1 >>> 13; h1 *= 0xc2b2ae35; h1 ^= h1 >>> 16; return h1; } // Code taken from: // http://dmy999.com/article/50/murmurhash-2-java-port by Derekt // Young (Public Domain) // as the Hadoop implementation by Andrzej Bialecki is buggy public static int[] hashMurmur2(byte[] value, int em, int ka) { int[] positions = new int[ka]; int hashes = 0; int lastHash = 0; byte[] data = value.clone(); while (hashes < ka) { for (int i = 0; i < value.lengt