func sortIPs(ipList []string) []string {
	if len(ipList) == 1 {
		return ipList
	}

	var ipV4s []net.IP
	var nonIPs []string
	for _, ip := range ipList {
		nip := net.ParseIP(ip)
		if nip != nil {
			ipV4s = append(ipV4s, nip)
		} else {
			nonIPs = append(nonIPs, ip)
		}
	}

	sort.Slice(ipV4s, func(i, j int) bool {
		// This case is needed when all ips in the list

            String nonceStr = Arrays.toString(nonce);
            assertFalse(nonces.contains(nonceStr), "Nonce should be unique");
            nonces.add(nonceStr);
        }

        // Then all nonces should be unique
        assertEquals(numNonces, nonces.size(), "All nonces should be unique");
    }

    @Test
    @DisplayName("Should generate secure nonces with proper randomness")
    void testSecureNonceGenerationRandomness() {

counter is filled with // zeros on entry. func deriveCounterGeneric(H, counter *[gcmBlockSize]byte, nonce []byte) { // GCM has two modes of operation with respect to the initial counter // state: a "fast path" for 96-bit (12-byte) nonces, and a "slow path" // for nonces of other lengths. For a 96-bit nonce, the nonce, along // with a four-byte big-endian counter starting at one, is used // directly as the starting counter. For other nonce sizes, the counter // is computed by passing it through the...

counter is filled with // zeros on entry. func deriveCounterGeneric(H, counter *[gcmBlockSize]byte, nonce []byte) { // GCM has two modes of operation with respect to the initial counter // state: a "fast path" for 96-bit (12-byte) nonces, and a "slow path" // for nonces of other lengths. For a 96-bit nonce, the nonce, along // with a four-byte big-endian counter starting at one, is used // directly as the starting counter. For other nonce sizes, the counter // is computed by passing it through the...