collisionAttackComplexity
P94408
predicate
Indicates the level of effort or resources required to successfully perform a collision attack against the target (e.g., a cryptographic function or system).
All labels observed (4)
| Label | Occurrences |
|---|---|
| collisionAttackComplexity canonical | 3 |
| collisionComplexityReported | 2 |
| collisionComplexityBestKnown | 1 |
| collisionComplexityTheoretical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: collisionAttackComplexity
Generated description
Indicates the level of effort or resources required to successfully perform a collision attack against the target (e.g., a cryptographic function or system).
Sample triples (7)
| Subject | Object |
|---|---|
| SHA-256 | approximately 2^128 operations (idealized) ⓘ |
| SHA-0 | 2^61 via predicate surface "collisionComplexityReported" ⓘ |
| SHA-0 | significantly less than brute force 2^80 via predicate surface "collisionComplexityReported" ⓘ |
| SHA-1 | 2^80 operations via predicate surface "collisionComplexityTheoretical" ⓘ |
| SHA-1 | significantly less than 2^80 operations via predicate surface "collisionComplexityBestKnown" ⓘ |
|
Whirlpool hash function
surface form:
Whirlpool
|
about 2^256 operations (idealized target) ⓘ |
| Message-Digest Algorithm 5 | significantly less than 2^64 ⓘ |