Dualization of regular Boolean functions
โ Scribed by Y. Crama
- Book ID
- 104183868
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 419 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual f d . While this problem is not solvable in quasi-polynomial total time in general (unless SAT is solvable in quasi-polynomial time), it is so in case the input belongs to special classes, e.g.
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce). Cryptographic Boolean Functions and Applications is a