code: public static byte[] shuffle(byte[] input){
  		for(int i=0; i<input.length; i++){
  			int i2 = input[i];
  			if(i2 < 0)
  				i2 = 127 + Math.abs(i2);
  			input[i] = shuffle[i2];
  			//result of more shuffles could just be mapped to the first
  //			i2 = input[i];
  //			if(i2 < 0)
  //				i2 = 127 + Math.abs(i2);
  //			input[i] = (byte) shuffle2[i2];
  //			i2 = input[i];
  //			if(i2 < 0)
  //				i2 = 127 + Math.abs(i2);
  //			input[i] = (byte) shuffle3[i2];
  		}
  		return input;
  	}
docs: a minimal perfect hash function for a 32 byte input
  @param input
  @return