@inproceedings {27709,
	title = {Boolean Polynomials, BDDs and CRHS Equations {\textendash} Connecting the Dots with CryptaPath},
	journal = {Selected Areas in Cryptography},
	volume = {12804},
	year = {2021},
	month = {07/2021},
	pages = {229-251},
	publisher = { Springer},
	address = {Cham},
	abstract = {When new symmetric-key ciphers and hash functions are proposed they are expected to document resilience against a number of known attacks. Good, easy to use tools may help designers in this process and give improved cryptanalysis. In this paper we introduce CryptaPath, a tool for doing algebraic cryptanalysis which utilizes Compressed Right-Hand Side (CRHS) equations to attack SPN ciphers and sponge constructions. It requires no previous knowledge of CRHS equations to be used, only a reference implementation of a primitive.
The connections between CRHS equations, binary decision diagrams and Boolean polynomials have not been described earlier in literature. A comprehensive treatment of these relationships is made before we explain how CryptaPath works. We then describe the process of solving CRHS equation systems while introducing a new operation, dropping variables.},
	keywords = {algebraic cryptanalysis, binary decision diagram, block cipher, equation system, Open Source, tool},
	isbn = {978-3-030-81651-3},
	doi = {https://doi.org/10.1007/978-3-030-81652-0_9},
	url = {https://link.springer.com/chapter/10.1007/978-3-030-81652-0_9},
	author = {John Petter {Indr{\o}y} and Costes, Nicolas and Raddum, H{\r a}vard},
	editor = {O., Dunkelman and Jr. M.J. {Jacobson} and C., O{\textquoteright}Flynn}
}
@inproceedings {23487,
	title = {Algebraic Analysis of the Simon Block Cipher Family},
	journal = {LatinCrypt 2015},
	volume = {9230},
	year = {2015},
	pages = {157 - 169},
	publisher = {Lecture Notes in Computer Science, Springer.Verlag},
	edition = {Lecture Notes in Computer Science},
	abstract = {This paper focuses on algebraic attacks on the Simon family of block ciphers. We construct equation systems using multiple plaintext/ciphertext pairs, and show that many variables in the cipher states coming from different plaintexts are linearly related. A simple solving algorithm exploiting these relations is developed and extensively tested on the different Simon variants, giving efficient algebraic attacks on up to 16 rounds of the largest Simon variants.},
	keywords = {algebraic attack, block cipher, equation system, Simon},
	isbn = {978-3-319-22173-1},
	issn = {0302-9743},
	author = {Raddum, H{\r a}vard}
}
