Publication

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Related publications (45)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Graph Chatbot

Chat with Graph Search

Extending Boolean Methods for Scalable Logic Synthesis

SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism

SAT-Sweeping Enhanced for Logic Synthesis

SAT-Sweeping Enhanced for Logic Synthesis

Triboelectric‐TFT Flip‐Flop for Bistable Latching of Dielectric Elastomer Actuators

SAT-Based Exact Synthesis for Multi-Level Logic Networks

Integrated ESOP Refactoring for Industrial Designs

Computer Algebraic Approach to Verification and Debugging of Galois Field Multipliers

Extending Boolean Methods for Scalable Logic Synthesis

Triboelectric‐TFT Flip‐Flop for Bistable Latching of Dielectric Elastomer Actuators

Integrated ESOP Refactoring for Industrial Designs

SAT-Sweeping Enhanced for Logic Synthesis

SAT-Sweeping Enhanced for Logic Synthesis

SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism

SAT-Based Exact Synthesis for Multi-Level Logic Networks

Computer Algebraic Approach to Verification and Debugging of Galois Field Multipliers