Cnf characterization of sets over \(\mathbb{Z}_2^n\) and its applications in cryptography (Q6950559)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8072042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cnf characterization of sets over \(\mathbb{Z}_2^n\) and its applications in cryptography |
scientific article; zbMATH DE number 8072042 |
Statements
Cnf characterization of sets over \(\mathbb{Z}_2^n\) and its applications in cryptography (English)
0 references
30 July 2025
0 references
automatic cryptanalysis
0 references
Boolean satisfiability problem
0 references
full CNF characterization
0 references
0 references
0 references
