Saved in:
Bibliographic Details
Main Authors: Ionita, Alexandru, Banu, Denis-Andrei, Oleniuc, Iulian
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2305.13008
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912603095171072
author Ionita, Alexandru
Banu, Denis-Andrei
Oleniuc, Iulian
author_facet Ionita, Alexandru
Banu, Denis-Andrei
Oleniuc, Iulian
contents We propose a method of optimizing monotone Boolean circuits by re-writing them in a simpler, equivalent form. We use in total six heuristics: Hill Climbing, Simulated Annealing, and variations of them, which operate on the representation of the circuit as a logical formula. Our main motivation is to improve performance in Attribute-Based Encryption (ABE) schemes for Boolean circuits. Therefore, we show how our heuristics improve ABE systems for Boolean circuits. Also, we run tests to evaluate the performance of our heuristics, both as a standalone optimization for Boolean circuits and also inside ABE systems.
format Preprint
id arxiv_https___arxiv_org_abs_2305_13008
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Heuristics Optimization of Boolean Circuits with application in Attribute Based Encryption
Ionita, Alexandru
Banu, Denis-Andrei
Oleniuc, Iulian
Computational Complexity
We propose a method of optimizing monotone Boolean circuits by re-writing them in a simpler, equivalent form. We use in total six heuristics: Hill Climbing, Simulated Annealing, and variations of them, which operate on the representation of the circuit as a logical formula. Our main motivation is to improve performance in Attribute-Based Encryption (ABE) schemes for Boolean circuits. Therefore, we show how our heuristics improve ABE systems for Boolean circuits. Also, we run tests to evaluate the performance of our heuristics, both as a standalone optimization for Boolean circuits and also inside ABE systems.
title Heuristics Optimization of Boolean Circuits with application in Attribute Based Encryption
topic Computational Complexity
url https://arxiv.org/abs/2305.13008