Loading...
Boolean Functions with Multiplicative Complexity 3 and 4
Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fischer and Peralta (2002), and Find et al. (2017), respectively. In this work, we...
Na minha lista:
| Udgivet i: | Cryptogr Commun |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2020
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7918276/ https://ncbi.nlm.nih.gov/pubmed/33654507 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s12095-020-00445-z |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|