SHA-1 Graph Visualization
<|begin_of_text|><|start_header_id|>system<|end_header_id|> You are a research archivist expert in dataset metadata. Answer the question truthfully.  <|eot_id|><|start_header_id|>user<|end_header_id|> Here is the Description of a dataset. Description:'We present SHA-1 (Secure Hash Algorithm, NIST FIPS PUB 180-4) graph visualization. The dataset includes Conjunctive Normal Form (CNF) formulas in DIMACS format, which are SAT (satisfiability) instances representing full 80 rounds SHA-1 as well as reduced versions with 20 and 25 rounds. Furthermore, we include variable incidence graphs (VIG) for the same instances in GraphML format, mapping CNF variables and clauses to graph vertices and edges.  CNF variables corresponding to SHA-1 parameters are identified within GraphML using node attributes. The original purpose of the data is to produce SHA-1 visualization.Our contributions: 1) compactness of the CNF formula makes the visualization viable as presented and 2) mapping of algorithm variables to graph vertices makes colour-coding possible' . Please return only a json list of at most 3 Keywords corresponding to the Description:.<|eot_id|><|start_header_id|>assistant<|end_header_id|> {"Answer" : ["CNF","cryptanalysis","satisfiability","SHA-1","variable incidence graph"]} <|eot_id|>
 Here is the Description of a dataset. Description:'We present SHA-1 (Secure Hash Algorithm, NIST FIPS PUB 180-4) graph visualization. The dataset includes Conjunctive Normal Form (CNF) formulas in DIMACS format, which are SAT (satisfiability) instances representing full 80 rounds SHA-1 as well as reduced versions with 20 and 25 rounds. Furthermore, we include variable incidence graphs (VIG) for the same instances in GraphML format, mapping CNF variables and clauses to graph vertices and edges.  CNF variables corresponding to SHA-1 parameters are identified within GraphML using node attributes. The original purpose of the data is to produce SHA-1 visualization.Our contributions: 1) compactness of the CNF formula makes the visualization viable as presented and 2) mapping of algorithm variables to graph vertices makes colour-coding possible' . Please return only a json list of at most 3 Keywords corresponding to the Description:.
We present SHA-1 (Secure Hash Algorithm, NIST FIPS PUB 180-4) graph visualization. The dataset includes Conjunctive Normal Form (CNF) formulas in DIMACS format, which are SAT (satisfiability) instances representing full 80 rounds SHA-1 as well as reduced versions with 20 and 25 rounds. Furthermore, we include variable incidence graphs (VIG) for the same instances in GraphML format, mapping CNF variables and clauses to graph vertices and edges.  CNF variables corresponding to SHA-1 parameters are identified within GraphML using node attributes. The original purpose of the data is to produce SHA-1 visualization.Our contributions: 1) compactness of the CNF formula makes the visualization viable as presented and 2) mapping of algorithm variables to graph vertices makes colour-coding possible
CNF; cryptanalysis; satisfiability; SHA-1; variable incidence graph