Skip to main content

Generation of AES-like 8-bit Random S-Box and Comparative Study on Randomness of Corresponding Ciphertexts with Other 8-bit AES S-Boxes

  • Conference paper
Intelligent Computing, Networking, and Informatics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 243))

Abstract

In Advanced Encryption Standard (AES), the standard S-Box is usually generated using a particular irreducible polynomial in GF(28), though it can be generated by 29 others. The focus of the present paper is to show that it is possible to generate secured, AES-like S-Boxes randomly, using a PRNG like BBS and to compare its security with 7 other S-Boxes generated by 7 arbitrarily selected irreducible polynomials from the set. A comparative study has been made by testing the randomness of the ciphertexts generated by the S-Boxes using National Institute of Standards and Technology (NIST) Test Suite, which estimates a P-value to accept or reject the randomness of a bit sequence. It has been found that besides using modular arithmetic, a secured S-Box can be generated by using PRNGs. Moreover, the initial seed of BBS acts as a secondary key of AES.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Foruzan, B.A.: Cryptography and Network Security. Tata McGraw-Hill, New Delhi (2007)

    Google Scholar 

  2. Stallings, W.: Cryptography and Network Security. Pearson Prentice Hall, New Delhi (2008)

    Google Scholar 

  3. Stinson, D.R.: Cryptography—Theory and Practice: Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, (2002)

    Google Scholar 

  4. Church, R.: Tables of Irreducible Polynomials for the First Four Prime Moduli: The Annals of Mathematics, 2nd Series, vol. 36, pp. 198–209 (1935). http://www.jstor

  5. Daemen, J., Rijmen, V.: AES Proposal: Rijndael, Version 2, Submitted to NIST (1999). http://csrc.nist.gov/encryption/aes

  6. Federal Information Processing Standards Publication (FIPS): Announcing the Advanced Encryption Standard (AES) (2001). http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf

  7. FIPS: FIPS PUB 197: Official AES Standard: (2001). http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf

  8. NIST, Tech. Admin.: U.S. Department of Commerce: A Statistical Test Suite for RNGs and PRNGs for Cryptographic Applications (2008), (2010). http://csrc.nist.gov/publications/nistpubs800/-2rec1/SP800-22red1.pdf

  9. Kim, S.J., Umeno, K., Hasegawa, A.: Corrections of the NIST Statistical Test Suite for Randomness, Communications Research Lab. Inc., Tokyo, Japan

    Google Scholar 

  10. Zaman, J.K.M., Ghosh, R.: A Review Study of NIST Statistical Test Suite: Development of an Indigenous Computer Package. In: Cryp. Wkshop., Cal. Univ., Kolkata, India (2011)

    Google Scholar 

  11. Paul, R., Saha, S., Zaman, J.K.M., Das, S., Chakrabarti, A., Ghosh, R.: A Simple 1-Byte 1-Clock RC4 H/w Design and its Implementation in FPGA Coprocessor for Secured Ethernet Communication. In: Proceedings of the Natural Workshop on Cryptography, VIT University & CRSI, Vellore, India (2012)

    Google Scholar 

  12. Kazilauskas, K., Kazilauskas, J.: Key-Dependent S-Box Generation in AES Block Cipher System: Informatica, Institute of Maths and Informatics, Vilnius, Lithuania (2009)

    Google Scholar 

Download references

Acknowledgments

I would like to convey my sincere gratitude to Prof. Dr. R. Ghosh, Institute of Radiophysics and Electronics, University of Calcutta, for his continuous inspiration in performing this work. A special word of appreciation goes to Mr. J. K. M. Sadique, SRF, Department of Radiophysics and Electronics, University of Calcutta, for letting me to use the NIST Test Suite package, developed by him, to perform analysis of data.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Das .

Editor information

Editors and Affiliations

Appendices

Appendix 1: Some of the Generated AES S-Boxes

Table 2

Table 2 a The Standard AES Encryption S-Box, generated by using the polynomial 11B. b AES Encryption S-Box, generated using the irreducible polynomial 139. c AES Encryption S-Box, generated using the BBS PRNG

Appendix 2: Distribution and Status of POPs

Tables 3, 4, and 5

Table 3 a, b Distribution and status of POPs of binary matrix rank test for 11B
Table 4 a, b Distribution and status of POPs of binary rank test for 139
Table 5 a, b Distribution and status of POPs of binary rank test for BBS

Appendix 3: Charts for Distribution and Status of POPs

Figures 1, 2, 3.

Fig. 1
figure 1figure 1

Distribution of POPs for tests 5 and 11 and status of POPs for polynomial 11B

Fig. 2
figure 2figure 2

Distribution of POPs for tests 5 and 11 and status of POPs for polynomial 139

Fig. 3
figure 3figure 3

Distribution of POPs for tests 5 and 11 and status of POPs for BBS PRNG

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Das, S. (2014). Generation of AES-like 8-bit Random S-Box and Comparative Study on Randomness of Corresponding Ciphertexts with Other 8-bit AES S-Boxes. In: Mohapatra, D.P., Patnaik, S. (eds) Intelligent Computing, Networking, and Informatics. Advances in Intelligent Systems and Computing, vol 243. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1665-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1665-0_29

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1664-3

  • Online ISBN: 978-81-322-1665-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics