In this paper we reviewed Wu’s algorithm and introduced it as a cryptanalysis technique. This study reveals that when Wu’s algorithm is used for cryptanalysis it simplifies. This is true because Wu’s algorithm has to be applied to binary polynomials only, when used for cryptanalysis. To summarize, we gave a full description of Wu’s algorithm in the binary case and also a basic example of using binary Wu to break an s-box.
Reference:
Grobler, TL, Van Zyl, AJ, Olivier, JC, Kleynhans, W, Salmon, BP and Penzhorn, WT. 2012. Wu’s algorithm and its possible application in cryptanalysis. African Journal of Mathematics and Computer Science Research, vol. 5(1), pp 1-8
Grobler, T., Van Zyl, A., Olivier, J., Kleynhans, W., Salmon, B., & Penzhorn, W. (2012). Wu’s algorithm and its possible application in cryptanalysis. http://hdl.handle.net/10204/5919
Grobler, TL, AJ Van Zyl, JC Olivier, W Kleynhans, BP Salmon, and WT Penzhorn "Wu’s algorithm and its possible application in cryptanalysis." (2012) http://hdl.handle.net/10204/5919
Grobler T, Van Zyl A, Olivier J, Kleynhans W, Salmon B, Penzhorn W. Wu’s algorithm and its possible application in cryptanalysis. 2012; http://hdl.handle.net/10204/5919.
Copyright: 2012 Academic Journals. All works published by Academic Journals are under the terms of the Creative Commons Attribution License. This permits anyone to copy, distribute, transmit and adapt the work provided the original work and source is appropriately cited.
