Zur Hauptnavigation wechseln Zur Suche wechseln Zum Hauptinhalt wechseln

Formal Verification of Modular Multipliers using Symbolic Computer Algebra and Boolean Satisfiability

  • Alireza Mahzoon (Vortragende*r)
  • Große, D. (Vortragende*r)
  • Christoph Scholl (Vortragende*r)
  • Alexander Konrad (Vortragende*r)
  • Rolf Drechsler (Vortragende*r)

Aktivität: Vortrag oder PräsentationVortrag nach Bewerbung und AuswahlScience-to-science

Beschreibung

Modular multipliers are the essential components in cryptography and Residue Number System (RNS) designs. Especially, 2n − 1 and 2n + 1 modular multipliers have gained more attention due to their regular structures and a wide variety of applications. However, there is no automated formal verification method to prove the correctness of these multipliers. As a result, bugs might remain undetected after the design phase. In this paper, we present our modular verifier that combines Symbolic Computer Algebra (SCA) and Boolean Satisfiability (SAT) to prove the correctness of 2n − 1 and 2n + 1 modular multipliers. Our verifier takes advantage of three techniques, i.e. coefficient correction, SAT-based local vanishing removal, and SAT-based output condition check to overcome the challenges of SCA-based verification. The efficiency of our verifier is demonstrated using an extensive set of modular multipliers with up to several million gates.
Zeitraum14 Juli 2022
EreignistitelDesign Automation Conference 2022
VeranstaltungstypKonferenz
OrtUSA/Vereinigte StaatenAuf Karte anzeigen

Wissenschaftszweige

  • 202017 Embedded Systems
  • 202005 Computer Architektur
  • 102005 Computer Aided Design (CAD)
  • 102 Informatik
  • 102011 Formale Sprachen

JKU-Schwerpunkte

  • Digital Transformation