Advertisement

Randomness Evaluation of PP-1 and PP-2 Block Ciphers Round Keys Generators

  • Michał ApolinarskiEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 889)

Abstract

Round keys in block ciphers are generated from a relatively short (64-, 128-, 256-, and more bits) master key and are used in encryption and decryption process. The statistical quality of round keys impact difficulty of block cipher cryptanalysis. If round keys are independent (not-related) then cryptanalysis need more resources. To evaluate key schedule’s statistical quality we can use NIST 800-22 battery test. PP-1 key schedule with 64 bits block size and 128-bit master key generates 22 64-bits round keys that gives cryptographic material length of 1408 bits. PP-2 with 64-bits block size generates in single run from 128-bits master key only 13 round keys, which give 832-bits sample from single master key. Having such short single samples we can perform only couple of NIST 800-22 tests. To perform all NIST 800-22 tests at least 106 bits length samples are required. In this paper we present results of randomness evaluation including all NIST 800-22 tests for expanded PP-1 and PP-2 round key generators.

Keywords

Key schedule Round keys Block cipher NIST 800-22 Statistical tests PP-1 block cipher PP-2 block cipher Round keys generator 

Notes

Acknowledgements

This research has been supported by Polish Ministry of Science and Higher Education under grant 04/45/DSPB/0163.

References

  1. 1.
    Apolinarski, M.: Statistical properties analysis of key schedule modification in block cipher PP-1. In: Wiliński, A., et al. (ed.) Soft Computing in Computer and Information Science. Advances in Intelligent Systems and Computing, vol. 342, pp. 257–268. Springer, Cham (2015)Google Scholar
  2. 2.
    Apolinarski, M.: Quality evaluation of key schedule algorithms for block ciphers. Studia z Automatyki i Informatyki – tom 37, Poznań (2012)Google Scholar
  3. 3.
    Biham, E., Dunkelman, O., Keller, N.: Related-key boomerang and rectangle attacks. In: Proceedings of the 24th Annual International Conference on Theory and Applications of Cryptographic Techniques, 22–26 May 2005, Aarhus, Denmark (2005)Google Scholar
  4. 4.
    Biham, E., Dunkelman, O., Keller, N.: A unified approach to related-key attacks. In: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, 10–13 February 2008, Revised Selected Papers. Springer, Heidelberg (2008)Google Scholar
  5. 5.
    Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, New York (1993)CrossRefGoogle Scholar
  6. 6.
    Biryukov, A., Nikolić, I.: Automatic search for related-key differential characteristics in byte-oriented block ciphers: application to AES, Camellia, Khazad and Others. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 322–344. Springer, Heidelberg, (2010)Google Scholar
  7. 7.
    Biryukov, A., Khovratovich, D., Nikolic, I.: Distinguisher and related-key attack on the full AES-256. In: Halevi, S. (ed.) Advances in Cryptology – CRYPTO 2009. LNCS, vol. 5677. Springer (2009)Google Scholar
  8. 8.
    Biryukov, A., Khovratovich, D.: Related-key cryptanalysis of the full AES-192 and AES-256. In: Asiacrypt 2009. LNCS, vol. 5912, pp. 1–18. Springer (2009)Google Scholar
  9. 9.
    Bogdanov, A., Tischhauser, E.: On the wrong key randomisation and key equivalence hypotheses in Matsui’s algorithm 2. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 19–38. Springer, Heidelberg (2014)Google Scholar
  10. 10.
    Bucholc, K., Chmiel, K., Grocholewska-Czuryło, A., Idzikowska, E., Janicka-Lipska, I., Stokłosa, J.: Scalable PP-1 block cipher. Int. J. Appl. Math. Comput. Sci. 20(2), 401–411 (2010)CrossRefGoogle Scholar
  11. 11.
    Bucholc, K., Chmiel, K., Grocholewska-Czurylo, A., Stoklosa, J.: PP-2 block cipher. In: 7th International Conference on Emerging Security Information Systems and Technologies (SECURWARE 2013), pp. 162–168. XPS Press, Wilmington (2013)Google Scholar
  12. 12.
    Huang, J., Lai, X.: Revisiting key schedule’s diffusion in relation with round function’s diffusion. Des. Codes Cryptogr. 73, 1–19 (2013)Google Scholar
  13. 13.
    Kim, J., Hong, S., Preneel, B., Biham, E., Dunkelman, O., Keller, N.: Related-Key Boomerang and Rectangle Attacks. IACR eprint server, 2010/019 January (2010)Google Scholar
  14. 14.
    Rukhin, A., et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22, revision 2 (2008)Google Scholar
  15. 15.
    Soto, J.: Randomness Testing of the Advanced Encryption Standard Candidate Algorithms. NIST IR 6390 (1999)Google Scholar
  16. 16.
    Soto, J., Bassham, L.: Randomness Testing of the Advanced Encryption Standard Finalist Candidates. NIST IR 6483 (2000)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of Control, Robotics and Information EngineeringPoznan University of TechnologyPoznańPoland

Personalised recommendations