Advertisement

Construction of new S-boxes based on triangle groups and its applications in copyright protection

  • Ayesha Rafiq
  • Majid Khan
Article
  • 32 Downloads

Abstract

Substitution boxes with resilient cryptographic possessions are normally utilized in block ciphers to give the substantial property of nonlinearity. They are important to resist standard attacks such as linear and differential cryptanalysis. A cryptographically robust S-box must be sound with respect to cryptographic properties like nonlinearity, bit independent criteria, strict avalanche criteria, linear and differential approximation probability. In this paper, we have developed an innovative construction scheme of nonlinear component of block cipher based on the action of projective linear groups on the projective line, and the permutation triangle groups. This nonlinear component, namely S-box, is responsible for making the relation between plaintext and ciphertext intractable which is one of the most important requirements of any modern block ciphers. By widening the scope of the proposed S-boxes, we have applied these lightweight nonlinear components in watermarking scheme.

Keywords

S-boxes Projective linear groups Finite fields Modular group Triangle groups Algebraic analyses 

Notes

Acknowledgements

The authors would like to thank the anonymous referees for their helpful comments and suggestions, which improved significantly the presentation of the paper. The authors are thankful to the Higher Education Commission (HEC) of Pakistan for the financial support under-vide No. 21-1743/SRGP/R&D/HEC/2017.

References

  1. 1.
    Bahrami S, Naderi M (2012) Image encryption using a lightweight stream encryption algorithm. Advances in Multimedia 2012:1–8CrossRefGoogle Scholar
  2. 2.
    Batool SI, Shah T, Khan M (2014) A color image watermarking scheme based on affine transformation and S4 permutation. Neural comput applic, Springer 25:2037–2045CrossRefGoogle Scholar
  3. 3.
    Baumslag G, Fine B, Xu X (2006) Cryptosystems using linear groups. AAECC 17(3–4):205–217MathSciNetCrossRefGoogle Scholar
  4. 4.
    Belazi A, Khan M, Abd El-Latif AA, Belghith S (2017) Efficient cryptosystem approaches: S-boxes and permutation substitution-based encryption. Nonlinear Dyn 87:337–361CrossRefGoogle Scholar
  5. 5.
    Bogdanov A, Knudsen LR, Leander G, Paar C, Poschmann A, Robshaw MJB, Seurin Y, Vikkelsoe C (2007) PRESENT: an ultra-lightweight block cipher. In: Paillier P, Verbauwhede I (eds) The 9th international workshop on cryptographic hardware and embedded systems - CHES 2007, LNCS 4727. Springer, Berlin, pp 450–466Google Scholar
  6. 6.
    Chawla G, Kamaldeep RS, Yadav R (2012) Classification of watermarking based upon various parameters. Int J Comput Appl Inf Technol 1:16–19Google Scholar
  7. 7.
    Cid C, Murphy S, Robshaw MJB (2005) Small scale variants of the AES, Proceedings of FSE 2005, LNCS, 145–162. SpringerGoogle Scholar
  8. 8.
    Conder M, Havas G, Newman MF. On one-relator quotients of the modular group, (preprint)Google Scholar
  9. 9.
    Conder M (1987) Three-relator quotients of the modular group. Q J Math 38 (4):427–447MathSciNetCrossRefGoogle Scholar
  10. 10.
    El-Sheikh HM, El-Mohsen OA, Elgarf T, Zekry A (2012) A new approach for designing key-dependent S-Box defined over G F(24) in AES. Int J Comput Theory Eng 4(2):158–164CrossRefGoogle Scholar
  11. 11.
    Everitt B (2000) Alternating quotients of Fuchsian groups. J Algebra 223:457–476MathSciNetCrossRefGoogle Scholar
  12. 12.
    Gangadaril BR, Ahamed SR (2015) Analysis and algebraic construction of S-Box for AES algorithm using Irreducible Polynomials. In: 2015 8th international conference on contemporary computing (IC3). Noida0, pp 526–530Google Scholar
  13. 13.
    Higman G, Mushtaq Q (1983) Coset diagrams and relations for P S L(2,z). Arab Gulf J Scient Res 1:159–164MathSciNetzbMATHGoogle Scholar
  14. 14.
    Isa H, Jamil N, Z’aba MR (2016) Construction of cryptographically strong S-Boxes inspired by bee waggle dance. New Generation Computing 34:221–238CrossRefGoogle Scholar
  15. 15.
    Khan M (2015) A novel image encryption scheme based on multi-parameters chaotic S-boxes. Nonlinear Dyn 82:527–533CrossRefGoogle Scholar
  16. 16.
    Khan M, Shah T (2015) An efficient construction of substitution box with fractional chaotic system. SIViP 9:1335–1338CrossRefGoogle Scholar
  17. 17.
    Khan M, Shah T (2015) A copyright protection using watermarking scheme based on nonlinear permutation and its quality metrics. Neural Comput Applic 26:845–855CrossRefGoogle Scholar
  18. 18.
    Khan M, Shah T, Batool SI (2016) A new implementations of chaotic S-boxes in CAPTCHA. SIViP 10:293–300CrossRefGoogle Scholar
  19. 19.
    Khan M, Shah T (2016) Construction and applications of chaotic S-boxes in image encryption. Neural Comput Applic 27:677–685CrossRefGoogle Scholar
  20. 20.
    Khan M., Asghar Z. (2018) A novel construction of substitution box for image encryption applications with Gingerbreadman chaotic map and S8 permutation. Neural Comput Applic 29:993–99CrossRefGoogle Scholar
  21. 21.
    Matsui M (1994) Linear cryptanalysis method for DES cipher, LNCS 765, Eurocrypt’93, pp 386–397Google Scholar
  22. 22.
    Meier W, Staffelbach O (1990) Nonlinear criteria for cryptographic functions. In: Quisquater JJ, Vandewalle J (eds) Lecture Notes in Computer Science and Advances in Cryptology, EUROCRYPT 89, vol 434. Springer, Berlin, pp 549–562Google Scholar
  23. 23.
    Mihajloska H, Gligoroski D (2012) Construction of optimal 4-bit S-boxes by Quasigroups of order 4. In: The 6th international conference on emerging security information, systems and technologies, SECURWARE 2012, Rome, ItalyGoogle Scholar
  24. 24.
    Mushtaq Q, Shaheen F (1987) Coset diagrams for a homomorphic image of △(2, 3, 6). Ars Combinatoria A 23:187–193MathSciNetzbMATHGoogle Scholar
  25. 25.
    Mushtaq Q (1988) Modular group acting on real quadratic fields. Bull Austral Math Soc 37:303–309MathSciNetCrossRefGoogle Scholar
  26. 26.
    Mushtaq Q (1990) Coset diagrams for Hurwitz groups. Comm Algebra 18 (11):3857–3888MathSciNetCrossRefGoogle Scholar
  27. 27.
    Mushtaq Q (1992) Parametrisation of all homomorphisms from \(PGL(2,\mathbb {Z})\) into P G L(2,q). Comm Algebra 20(4):1023–1040MathSciNetCrossRefGoogle Scholar
  28. 28.
    Nakahara J Jr, de Freitas DS (2009) Mini-ciphers: a reliable testbed for cryptanalysis?, “symmetric cryptography”, seminar 09031. In: Dagstuhl S (ed) Dagstuhl Seminar Proceedings. Leibniz-Zentrum fuer Informatik, Germany, pp 1862–4405Google Scholar
  29. 29.
    Phan RC-W (2002) Mini advanced encryption standard (Mini-AES): A testbed for cryptanalysis students. Cryptologia XXVI(4):283–306CrossRefGoogle Scholar
  30. 30.
    Pieprzyk J, Finkelstein G (1988) Towards effective nonlinear cryptosystem design. IEE proceedings 135, part E(6):325–335Google Scholar
  31. 31.
    Shannon C (1949) Communication theory of security systems. Bell Systems Technical Journal 28(4):656–715CrossRefGoogle Scholar
  32. 32.
    Siegenthaler T (1985) Decrypting a class of stream ciphers using Ciphertexts only. IEEE Trans Computer C34:81–85CrossRefGoogle Scholar
  33. 33.
    Singh AK, Kumar B, Singh G, Mohan A (2017) Medical image watermarking: Techniques and applications, SpringerGoogle Scholar
  34. 34.
    Steinwandt R (2001) Loopholes in two public key cryptosystems using the modular group, International workshop on public key cryptography, pp 180–189CrossRefGoogle Scholar
  35. 35.
    Tom MA (1976) Modular functions and Dirichlet series in number theory, 2nd edn. Springer, New YorkzbMATHGoogle Scholar
  36. 36.
    Wang Z, Bovik AC (2002) A universal image quality index. IEEE Signal Process Lett 9(3):81–84CrossRefGoogle Scholar
  37. 37.
    Wilson JS (1999) Simple images of triangle groups. Quart Jour Math Ser 50:523–531MathSciNetCrossRefGoogle Scholar
  38. 38.
    Yamamura A (1998) Public-key cryptosystems using the modular group, public key cryptography. In: 1st international workshop on practice and theory in public key cryptography, lecture notes in computer science, vol 1431. Springer, Berlin, pp 203–216CrossRefGoogle Scholar
  39. 39.
    Yamamura A (1999) A functional cryptosystem using a group action, information security and privacy. In: 4th australasian conference, lecture notes in computer science, vol 1587. Springer, Berlin, pp 314–325CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Applied Mathematics and StatisticsInstitute of Space TechnologyIslamabadPakistan
  2. 2.Cyber and Information Security Lab (CISL)Institute of Space TechnologyIslamabadPakistan

Personalised recommendations