Sparse Boolean equations and circuit lattices
Author:
Open Access
- 1 January 2011
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 59 (1-3) , 349-364
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Improved Agreeing-Gluing AlgorithmMathematics in Computer Science, 2013
- PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware2010
- Sparse Algebraic Equations over Finite FieldsSIAM Journal on Computing, 2009
- Algebraic and Slide Attacks on KeeLoq2008
- Algebraic Cryptanalysis of the Data Encryption Standard2007
- A new efficient algorithm for computing Gröbner bases without reduction to zero ( F 5 )2002
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations2000
- Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption StandardComputer, 1977