Improved Heuristics for Short Linear Programs
In this article, we propose new heuristics for minimising the amount of XOR gates required to compute a system of linear equations in GF(2). We first revisit the well known Boyar-Peralta strategy and argue that a proper randomisation process during the selection phases can lead to great improvements...
Main Authors: | Quan Quan Tan, Thomas Peyrin |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2019-11-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/8398 |
Similar Items
-
Designs of Array Multipliers with an Optimized Delay in Quantum-Dot Cellular Automata
by: Aibin Yan, et al.
Published: (2023-07-01) -
NUMERICAL SIMULATION FOR HIGH- SPEED ALL- OPTICAL BOOLEAN GATES
by: Inmar N. Ghazi
Published: (2008-09-01) -
Design and Implementation of New Coplanar FA Circuits without NOT Gate and Based on Quantum-Dot Cellular Automata Technology
by: Mohsen Vahabi, et al.
Published: (2021-12-01) -
Modelling of All-optical 3-inputs XOR logical gates using artificial neural networks
by: samaneh hamedi, et al.
Published: (2022-09-01) -
Noise Driven Coupled Nonlinear Systems: A “Dynamical Multilayer Perceptron” Demonstrating XOR Functionality
by: Paul R. De La Houssaye, et al.
Published: (2023-01-01)