| Modifier and Type | Field and Description |
|---|---|
| private static final Map | |
| private static final Pattern |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public Set | |
| pack-priv static String | Returns: the decomposed name, or the passed in algorithm name if it is not a digest algorithm or does not need to be decomposedthe name to be decomposed algorithm)Decomposes a standard message digest algorithm name into a consistent name for matching purposes. |
| private static Set | |
| pack-priv static Set | decomposeName(String algorithm)
Decomposes a standard algorithm name into sub-elements and uses a consistent message digest algorithm name to avoid overly complicated checking. |
| public static Collection |
| DECOMPOSED_DIGEST_NAMES | back to summary |
|---|---|
| private static final Map<String, String> DECOMPOSED_DIGEST_NAMES | |
| PATTERN | back to summary |
|---|---|
| private static final Pattern PATTERN | |
| AlgorithmDecomposer | back to summary |
|---|---|
| public AlgorithmDecomposer() | |
| decompose | back to summary |
|---|---|
| public Set Decompose the standard algorithm name into sub-elements. For example, we need to decompose "SHA1WithRSA" into "SHA1" and "RSA" so that we can check the "SHA1" and "RSA" algorithm constraints separately. Please override the method if you need to support more name pattern. | |
| decomposeDigestName | back to summary |
|---|---|
| pack-priv static String decomposeDigestName(String algorithm) Decomposes a standard message digest algorithm name into a consistent name for matching purposes. | |
| decomposeImpl | back to summary |
|---|---|
| private static Set | |
| decomposeName | back to summary |
|---|---|
| pack-priv static Set Decomposes a standard algorithm name into sub-elements and uses a consistent message digest algorithm name to avoid overly complicated checking. | |
| getAliases | back to summary |
|---|---|
| public static Collection Get aliases of the specified algorithm. May support more algorithms in the future. | |