{"ID":2889163,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.21731","arxiv_id":"2507.21731","title":"Modelling Arbitrary Computations in the Symbolic Model using an Equational Theory for Bounded Binary Circuits","abstract":"In this work, we propose a class of equational theories for bounded binary circuits that have the finite variant property. These theories could serve as a building block to specify cryptographic primitive implementations and automatically discover attacks as binary circuits in the symbolic model. We provide proofs of equivalence between this class of equational theories and Boolean logic up to circuit size 3 and we provide the variant complexities and performance benchmarks using Maude-NPA. This is the first result in this direction and follow-up research is needed to improve the scalability of the approach.","short_abstract":"In this work, we propose a class of equational theories for bounded binary circuits that have the finite variant property. These theories could serve as a building block to specify cryptographic primitive implementations and automatically discover attacks as binary circuits in the symbolic model. We provide proofs of e...","url_abs":"https://arxiv.org/abs/2507.21731","url_pdf":"https://arxiv.org/pdf/2507.21731v1","authors":"[\"Michiel Marcus\",\"Frank Westers\",\"Anne Nijsten\"]","published":"2025-07-29T12:09:50Z","proceeding":"cs.CR","tasks":"[\"cs.CR\"]","methods":"[]","has_code":false}