Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 540253, 12 pages
http://dx.doi.org/10.1155/2014/540253
Research Article

On the Construction of and Binary Matrices with Good Implementation Properties for Lightweight Block Ciphers and Hash Functions

1Department of Computer Engineering, Trakya University, 22030 Edirne, Turkey
2Department of Computer Engineering, Ondokuz Mayis University, 55139 Samsun, Turkey
3Institute of Applied Mathematics, Middle East Technical University, 06531 Ankara, Turkey
4Software Engineering Department, Kirklareli University, 39000 Kırklareli, Turkey
5Department of Computer Engineering, Namık Kemal University, 59860 Çorlu, Turkey

Received 16 June 2014; Revised 9 October 2014; Accepted 13 October 2014; Published 2 November 2014

Academic Editor: Kwok-Wo Wong

Copyright © 2014 Muharrem Tolga Sakallı et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. E. Shannon, “Communication theory of secrecy systems,” The Bell System Technical Journal, vol. 28, pp. 656–715, 1949. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. O. Karaahmetoğlu, M. T. Sakallı, E. Buluş, and I. Tutănescu, “A new method to determine algebraic expression of power mapping based S-boxes,” Information Processing Letters, vol. 113, no. 7, pp. 229–235, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  3. A. M. Youssef and S. E. Tavares, “Affine equivalence in the AES round function,” Discrete Applied Mathematics, vol. 148, no. 2, pp. 161–170, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. D. Kwon, S. H. Sung, J. H. Song, and S. Park, “Design of block ciphers and coding theory,” Trends in Mathematics, vol. 8, no. 1, pp. 13–20, 2005. View at Google Scholar
  5. M. R. Z'aba, Analysis of linear relationships in block ciphers [Ph.D. thesis], Queensland University of Technology, Brisbane, Australia, 2010.
  6. J. Daemen and V. Rijmen, The Design of Rijndael: AES-The Advanced Encryption Standard, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  7. FIPS 197, Advanced Encryption Standard, US National Institute of Standards and Technology, 2001.
  8. P. S. L. M. Barreto and V. Rijmen, “The Khazad legacy-level block cipher,” in Proceedings of the 1st Open NESSIE Workshop, 2000.
  9. K. Aoki, T. Ichikawa, M. Kanda et al., “Camellia: a 128-bit block cipher suitable for multiple platforms—design and analysis,” in Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography (SAC '00), vol. 2012 of Lecture Notes in Computer Science, pp. 39–56, 2000.
  10. D. Kwon, J. Kim, S. Park et al., “New block cipher: ARIA,” in Information Security and Cryptology—ICISC 2003, vol. 2971 of Lecture Notes in Computer Science, pp. 432–445, Springer, Berlin, Germany, 2004. View at Google Scholar
  11. J. Nakahara Jr. and É. Abrahão, “A new involutory MDS matrix for the AES,” International Journal of Network Security, vol. 9, no. 2, pp. 109–116, 2009. View at Google Scholar · View at Scopus
  12. B. Aslan and M. T. Sakallı, “Algebraic construction of cryptographically good binary linear transformations,” Security and Communication Networks, vol. 7, no. 1, pp. 53–63, 2014. View at Google Scholar
  13. M. T. Sakallı and B. Aslan, “On the algebraic construction of cryptographically good 32×32 binary linear transformations,” Journal of Computational and Applied Mathematics, vol. 259, pp. 485–494, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. R. Beaulieu, D. Shors, J. Smith, S. Treatman-Clark, B. Weeks, and L. Wingers, “The simon and speck families of lightweight block ciphers,” Cryptology ePrint Archive, Report 2013/404, 2013. View at Google Scholar
  15. H. Yap, K. Khoo, A. Poschmann, and M. Henricksen, “EPCBC—a block cipher suitable for electronic product code encryption,” in Cryptology and Network Security: Proceedings of the 10th International Conference, CANS 2011, Sanya, China, December 10–12, 2011, vol. 7092 of Lecture Notes in Computer Science, pp. 76–97, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  16. F. Karakoc, H. Demirci, and A. E. Harmanci, “ITUbee: a software oriented lightweight block cipher,” in Lightweight Cryptography for Security and Privacy: 2nd International Workshop, LightSec 2013, Gebze, Turkey, May 6-7, 2013, Revised Selected Papers, vol. 8162, pp. 16–27, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  17. F. X. Standaert, G. Piret, N. Gershenfeld, and J.-J. Quisquater, “SEA: a scalable encryption algorithm for small embedded applications,” in Smart Card Research and Advanced Applications, vol. 3928 of Lecture Notes in Computer Science, pp. 222–236, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  18. R. J. McEliece, Finite Fields for Computer Scientists and Engineers, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  19. R. Lidl and H. Niederreiter, Finite Fields (Encyclopedia of Mathematics and its Applications), Addison-Wesley, Reading, Mass, USA, 1983. View at MathSciNet
  20. N. T. Courtois, G. V. Bard, and D. Wagner, “Algebraic and slide attacks on KeeLoq,” in Fast Software Encryption, vol. 5086 of Lecture Notes in Computer Science, pp. 97–115, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  21. S. Vaudenay, “Related-key attack against triple encryption based on fixed points,” in Proceedings of the International Conference on Security and Cryptography (SECRYPT '11), pp. 59–67, July 2011. View at Scopus
  22. A. Bay, A. Mashatan, and S. Vaudenay, “A related-key attack against multiple encryption based on fixed points,” in E-Business and Telecommunications: International Joint Conference, ICETE 2011, Seville, Spain, July 18–21, 2011, Revised Selected Papers, vol. 314 of Communications in Computer and Information Science, pp. 264–280, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  23. I. Dinur, O. Dunkelmann, and A. Shamir, “Improved attacks on full GOST,” in Fast Software Encryption: 19th International Workshop, FSE 2012, Washington, DC, USA, March 19–21, 2012. Revised Selected Papers, vol. 7549 of Lecture Notes in Computer Science, pp. 9–28, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  24. W. Bosma, J. Cannon, and C. Playoust, “The Magma algebra system I: the user language,” Journal of Symbolic Computation, vol. 24, no. 3-4, pp. 235–265, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. B. W. Koo, H. S. Jang, and J. H. Song, “On constructing of a 32×32 binary matrix as a diffusion layer for a 256-bit block cipher,” in Information Security and Cryptology—ICISC 2006, vol. 4296 of Lecture Notes in Computer Science, pp. 51–64, Springer, Berlin, Germany, 2006. View at Google Scholar
  26. S. Hong, S. Lee, J. Lim, J. Sung, D. Cheon, and I. Cho, “Provable security against differential and linear cryptanalysis for the SPN structure,” in Fast Software Encryption, vol. 1978 of Lecture Notes in Computer Science, pp. 273–283, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  27. M.-J. O. Saarinen, “Cryptographic analysis of all 4×4-bit S-boxes,” in Selected Areas in Cryptography, vol. 7118 of Lecture Notes in Computer Science, pp. 118–133, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar