Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference

DOI10.4213/MVK226MaRDI QIDQ3381881zbMATH OpenOpenAlexFDO

Authors

Publication date 20 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk226

zbMATH Keywords

asymptotic methodsBoolean circuitsobscuration of functionality

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Asymptotically best method for synthesis of Boolean recursive circuits
• On a method of synthesis of correlation-immune Boolean functions
• scientific article; zbMATH DE number 5906481
• What's hard about Boolean functional synthesis?
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

Cites work

• High accuracy asymptotic bounds on the BDD size and weight of the hardest functions
• scientific article; zbMATH DE number 5529977 (Why is no real title available?)
• scientific article; zbMATH DE number 3405843 (Why is no real title available?)

Cited in

(2)

• HOLL: program synthesis for higher order logic locking
• Asymptotically best method for synthesis of Boolean recursive circuits

This page was built for publication: Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3381881)