Determining the Multiplicative Complexity of Boolean Functions using SAT - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Mathias Soeken. Determining the Multiplicative Complexity of Boolean Functions using SAT. IACR Cryptology ePrint Archive, 2020:530, 2020. [doi]

@article{Soeken20,
  title = {Determining the Multiplicative Complexity of Boolean Functions using SAT},
  author = {Mathias Soeken},
  year = {2020},
  url = {https://eprint.iacr.org/2020/530},
  researchr = {https://researchr.org/publication/Soeken20},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2020},
  pages = {530},
}

runs on WebDSL