Sparse Boolean equations and circuit lattices

DOI10.1007/s10623-010-9465-xzbMath1213.94132OpenAlexW2049373824MaRDI QIDQ2430703

I. A. Semaev

Publication date: 8 April 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-010-9465-x

zbMATH Keywords

switcheselectrical circuits\texttt{AES}\texttt{COPACOBANA}\texttt{DES}agreeing algorithmequation graphsparse Boolean equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Improved agreeing-gluing algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving multiple right hand sides linear equations
• On solving sparse algebraic equations over finite fields
• Improved agreeing-gluing algorithm
• PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware
• Algebraic and Slide Attacks on KeeLoq
• Sparse Algebraic Equations over Finite Fields
• Information and Communications Security

This page was built for publication: Sparse Boolean equations and circuit lattices