1. Lecture Notes in Computer Science;F. Armknecht,2006
2. Bardet, M., Faugère, J.-C., Salvy, B.: On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. In: Proc. International Conference on Polynomial System Solving (ICPSS), pp. 71–75 (2004)
3. Lecture Notes in Computer Science;D.J. Bernstein,2013
4. Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The Keccak reference, version 3.0 (2011),
http://keccak.noekeon.org/Keccak-reference-3.0.pdf
5. Lecture Notes in Computer Science;E. Biham,2000