Pregled bibliografske jedinice broj: 1080891
Computing minimal DNF of Boolean functions for digital implementations
Computing minimal DNF of Boolean functions for digital implementations // CECC 2020 Book of Abstracts
Zagreb, Hrvatska, 2020. str. 14-15 (predavanje, međunarodna recenzija, prošireni sažetak, znanstveni)
CROSBI ID: 1080891 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Computing minimal DNF of Boolean functions for
digital
implementations
Autori
Banov, Reni
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, prošireni sažetak, znanstveni
Izvornik
CECC 2020 Book of Abstracts
/ - , 2020, 14-15
Skup
20th Central European Conference on Cryptology
Mjesto i datum
Zagreb, Hrvatska, 24.06.2020. - 26.06.2020
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Boolean functions, DNF, BDD
Sažetak
The key step in the application of BDDs is a variable order for Shannon expansion which allows efficient operations with Boolean functions, e.g., their minimization. As it was shown in the example, the minimization of Boolean functions can be used to produce optimal digital circuits for the implementation of an important class of cryptographic functions. In addition to that, this topic presents open problems for further research in the field of combinatorial optimizations, such as variable ordering in Shannon expansion and set covering problem. It is also important to mention that the properties of Boolean (Bent) functions can be further elaborated by research on graph properties of BDDs and their variants.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
