Three input exclusive-or gate support for Boyar-Peralta's algorithm
From MaRDI portal
Publication:6157579
DOI10.1007/978-3-030-92518-5_7zbMATH Open1514.94035OpenAlexW4206122404MaRDI QIDQ6157579FDOQ6157579
Authors: Anubhab Baksi, Vishnu Asutosh Dasu, Banashri Karmakar, A. Chattopadhyay, Takanori Isobe 
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92518-5_7
Recommendations
- Improved heuristics for low-latency implementations of linear layers
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- Several masked implementations of the Boyar-Peralta AES S-box
- Block ciphers -- focus on the linear layer (feat. PRIDE)
- Logic minimization techniques with applications to cryptology
Cites Work
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- Algebraic aspects of the advanced encryption standard.
- Block ciphers -- focus on the linear layer (feat. PRIDE)
- XOR-counts and lightweight multiplication with fixed elements in binary finite fields
- FOAM: searching for hardware-optimal SPN structures and components with a fair comparison
- A framework to optimize implementations of matrices
- Quantum implementation and resource estimates for rectangle and knot
Cited In (1)
This page was built for publication: Three input exclusive-or gate support for Boyar-Peralta's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157579)
