@inproceedings {24094,
	title = {Solving Compressed Right Hand Side Equation Systems with Linear Absorption},
	journal = {7th International Conference on Sequences and Their Applications, SETA 2012},
	volume = {7280},
	year = {2012},
	month = {06/2012},
	pages = {291-302},
	publisher = {Lecture Notes in Computer Science, Springer Verlag},
	abstract = {In this paper we describe an approach for solving complex multivariate equation systems related to algebraic cryptanalysis. The work uses the newly introduced Compressed Right Hand Sides (CRHS) representation, where equations are represented using Binary Decision Diagrams (BDD). The paper introduces a new technique for manipulating a BDD, similar to swapping variables in the well-known sifting-method. Using this technique we develop a new solving method for CRHS equation systems. The new algorithm is successfully tested on systems representing reduced variants of Trivium.
},
	keywords = {algebraic cryptanalysis, BDD, multivariate equation system, Trivium},
	isbn = {978-3-642-30614-3},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-30615-0_27},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-30615-0_27},
	author = {Thorsten Ernst {Schilling} and Raddum, H{\r a}vard}
}
@inproceedings {24093,
	title = {Analysis of Trivium Using Compressed Right Hand Side Equations},
	journal = {14th International Conference on Information Security and Cryptology - ICISC 2011},
	volume = {7259},
	year = {2011},
	month = {12/2011},
	pages = {18-32},
	publisher = {Lecture Notes in Computer Science, Springer Verlag},
	abstract = {We study a new representation of non-linear multivariate equations for algebraic cryptanalysis. Using a combination of multiple right hand side equations and binary decision diagrams, our new representation allows a very efficient conjunction of a large number of separate equations. We apply our new technique to the stream cipher Trivium and variants of Trivium reduced in size. By merging all equations into one single constraint, manageable in size and processing time, we get a representation of the Trivium cipher as one single equation.},
	keywords = {algebraic cryptanalysis, BDD, multivariate equation system, Trivium},
	isbn = {978-3-642-31911-2},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-31912-9_2},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-31912-9_2},
	author = {Thorsten Ernst {Schilling} and Raddum, H{\r a}vard}
}
@inproceedings {24089,
	title = {Solving Equation Systems by Agreeing and Learning},
	journal = {Third International Workshop on the Arithmetic of Finite Fields, WAIFI 2010},
	volume = {6087},
	year = {2010},
	month = {06/2010},
	pages = {151-165},
	publisher = {Lecture Notes in Computer Science, Springer Verlag},
	abstract = {We study sparse non-linear equation systems defined over a finite field. Representing the equations as symbols and using the Agreeing algorithm we show how to learn and store new knowledge about the system when a guess-and-verify technique is used for solving. Experiments are then presented, showing that our solving algorithm compares favorably to MiniSAT in many instances.},
	keywords = {agreeing, dynamic learning, multivariate equation system, SAT-solving},
	isbn = {978-3-642-13796-9},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-13797-6_11},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-13797-6_11},
	author = {Thorsten Ernst {Schilling} and Raddum, H{\r a}vard}
}
