Fully Homomorphic Encryption (FHE) allows for secure computation on encrypted data. We
present BASALISC, an architecture family of hardware accelerators that aims to substantially …

For decades, formal methods have offered the promise of verified software that does not
have exploitable bugs. Until recently, however, it has not been possible to verify software of …

Abstract The Software Analysis Workbench (SAW) is a system for translating programs into
logical expressions, transforming these expressions, and using external reasoning tools …

In the present paper, we propose a technology for translating algorithmic descriptions of
discrete functions to SAT. The proposed technology is aimed at applications in algebraic …

A formally verified program is only as correct as its specifications (SPEC). But how to assure
that the SPEC is complete and free of loopholes? This paper presents Fast, short for Fuzzing …

Differential cryptanalysis is a powerful algorithmic-level attack, playing a central role in
evaluating the security of symmetric cryptographic primitives. In general, the resistance …

This paper presents an approach and a tool, CASM-VERIFY, to automatically check the
equivalence of highly optimized assembly implementations of cryptographic algorithms. The …

Software developers who are newly introduced to formal verification often have subtle but
distinct interpretations on the roles of specifications (specs). Unsurprisingly, these different …

In the present chapter we study one method for partitioning hard instances of the Boolean
satisfiability problem (SAT). It uses a subset of a set of variables of an original formula to …

Developers of computer-aided cryptographic tools are optimistic that formal methods will
become a vital part of developing new cryptographic systems. We study the use of such tools …