Skip to content

Passwords And Secrets

Password and Secrets

Being the only query written in Golang, it involves several rules to cover the maximum possible cases. These rules are based on regexes. The default rules can be found here. Each one is mainly composed of id, name and regex.

Since there are cases where it is necessary to filter the results of these rules (i.e. cases to exclude), you can use allowRules. Basically, there are two types: specific allowRules, which is just applied to a specific rule and generic allowRules, which is applied to all rules.

NOTE: Terraform variables will not be resolved. Password and Secrets query will scan and point directly to tfvars file.

{
  "rules": [
      {
        "id": "rule identifier",
        "name": "intuitive rule name",
        "regex": "golang flavor regex",
        "allowRules": [
          {
            "description": "brief description about the cases to exclude",
            "regex": "golang flavor regex"
          }
        ]
      }
  ],
    "allowRules": [
          {
            "description": "brief description about the cases to exclude",
            "regex": "golang flavor regex"
          }
    ]
}

Example

The present rule defines a pattern that finds generic tokens. Since, in Terraform, we can come across cases like token_key = data.terraform_remote_state.rancher.outputs.token_key, we can use a specific allowRules (Avoiding TF resource access) to exclude these cases.

Moreover, to exclude scenarios like automountServiceAccountToken: false, we can use a generic allowRules (Avoiding Boolean's) to be applied not only in this rule but also in the remaining ones.

{
  "rules": [
     {
          "id": "baee238e-1921-4801-9c3f-79ae1d7b2cbc",
          "name": "Generic Token",
          "regex": "(?i)['\"]?token(_)?(key)?['\"]?\\s*[:=]\\s*['\"]?([[A-Za-z0-9/~^_!@&%()=?*+-]+)['\"]?",
          "allowRules": [
            {
              "description": "Avoiding TF resource access",
              "regex": "(?i)['\"]?password['\"]?\\s*=\\s*([a-zA-z_]+(.))?[a-zA-z_]+(.)[a-zA-z_]+(.)[a-zA-z_]+"
            }
          ]
     }
  ],
  "allowRules": [
          {
            "description": "Avoiding Boolean's",
            "regex": "(?i)['\"]?[a-zA-Z_]+['\"]?\\s*[=:]\\s*['\"]?(true|false)['\"]?"
          }
   ]
}

Flags

Passwords And Secrets Exclusion

It is important to mention that you can disable this query through flag --disable-secrets. Furthermore, you also can disable it through flag --exclude-queries, which should point to its query ID.

Passwords And Secrets Inclusion

When the flag --include-queries is not used, the Password and Secrets query is included for default. However, when this flag is used, the Password and Secrets query is not included for default. So, to include this query, you can use the flag --include-queries, which should point to the Password and Secrets query ID.

New Rules Addition

If you want to use your own rules, you can point the path through the flag --secrets-regexes-path. KICS is prepared for two cases: - only the use of the user's rule (through the flag --secrets-regexes-path) - the use of the user's rules plus all KICS rules (through the flag --secrets-regexes-path and --include-queries, which should point to the Passwords and Secrets query ID)

Entropies

The password and secret regex queries utilize an object array called entropies to reduce the false positive rate. This array contains information about the entropy of the strings that are being searched.

{
    "id": "3e2d3b2f-c22a-4df1-9cc6-a7a0aebb0c99",
    "name": "Generic Secret",
    "regex": "(?i)['\"]?secret[_]?(key)?['\"]?\\s*(:|=)\\s*['\"]?([A-Za-z0-9/~^_!@&%()=?*+-]{10,})['\"]?",
    "entropies": [
        {
            "group": 3,
            "min": 2.8,
            "max": 8
        }
    ]
}

The entropies array contains information about the minimum and maximum entropy values that are expected for a particular group of characters in the regex pattern. Entropy is a measure of the randomness or unpredictability of a string or set of strings, and is calculated using the Shannon formula. It takes into account the frequency of occurrence of each character in the string, and the total length of the string. For every given entropy, the result of the regex group should be between the maximum and minimum values specified in the entropies array.