PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2010 | 20 | 2 | 401-411
Tytuł artykułu

Scalable PP-1 block cipher

Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
A totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e.g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated with respect to linear cryptanalysis and other attacks. PP-1's concurrent error detection is also discussed. Some processing speed test results are given and compared with those of other ciphers.
Rocznik
Tom
20
Numer
2
Strony
401-411
Opis fizyczny
Daty
wydano
2010
otrzymano
2009-02-18
poprawiono
2009-07-14
Twórcy
  • Institute of Control and Information Engineering, Poznań University of Technology, pl. Marii Skłodowskiej-Curie 5, 60-965 Poznań, Poland
  • Institute of Control and Information Engineering, Poznań University of Technology, pl. Marii Skłodowskiej-Curie 5, 60-965 Poznań, Poland
  • Institute of Control and Information Engineering, Poznań University of Technology, pl. Marii Skłodowskiej-Curie 5, 60-965 Poznań, Poland
  • Institute of Control and Information Engineering, Poznań University of Technology, pl. Marii Skłodowskiej-Curie 5, 60-965 Poznań, Poland
  • Institute of Control and Information Engineering, Poznań University of Technology, pl. Marii Skłodowskiej-Curie 5, 60-965 Poznań, Poland
  • Institute of Control and Information Engineering, Poznań University of Technology, pl. Marii Skłodowskiej-Curie 5, 60-965 Poznań, Poland
Bibliografia
  • Bertoni, G., Breveglieri, L., Koren, I., Maistri, P. and Piuri, V. (2003a). Concurrent fault detection in a hardware implementation of the RC5 encryption algorithm, Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors, The Hague, The Netherlands, pp. 410-419.
  • Bertoni, G., Breveglieri, L., Koren, I., Maistri, P. and Piuri, V. (2003b). Error analysis and detection procedures for a hardware implementation of the advanced encryption standard, IEEE Transactions on Computers 52: 492-505.
  • Biham, E. and Shamir, A. (1992). Differential cryptanalysis of the full 16-round DES, in E. F. Brickell (Ed.), CRYPTO, Lecture Notes in Computer Science, Vol. 740, Springer, Heidelberg, pp. 487-496.
  • Biryukov, A. (2003). Analysis of involutional ciphers: Khazad and Anubis, in T. Johansson (Ed.), Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers, Lecture Notes in Computer Science, Vol. 2887, Springer, New York, NY, pp. 45-53.
  • Bucholc, K. and Idzikowska, E. (2007). Analysis of the influence of errors on the encryption and decryption in PP1 block cipher, Studia z Automatyki i Informatyki 32: 17-22.
  • Chmiel, K. (2006a). Distribution of the best nonzero differential and linear approximations of S-box functions, Journal of Telecommunications and Information Technology 3: 8-13.
  • Chmiel, K. (2006b). Intermediate evaluation of block ciphers, Proceedings of the 13th International Multi-Conference on Advanced Computer Systems ACS 2006, Międzyzdroje, Poland, Vol. 1, pp. 331-342.
  • Chmiel, K. (2006c). On differential and linear approximation of S-box functions, Biometrics, Computer Security Systems and Artificial Intelligence Applications, New York, NY, USA, pp. 111-120.
  • Chmiel, K., Grocholewska, A., Socha, P. and Stoklosa, J. (2008a). Involutional block cipher for limited resources, Global Communications Conference-GLOBECOM, New Orleans, LA, USA, pp. 1852-1856.
  • Chmiel, K., Grocholewska, A., Socha, P. and Stoklosa, J. (2008b). Scalable cipher for limited resources, Polish Journal of Environmental Studies 17(4C): 371-377.
  • Courtois, N. and Pieprzyk, J. (2002). Cryptanalysis of block ciphers with overdefined systems of equations, in Y. Zheng (Ed.), ASIACRYPT, Lecture Notes in Computer Science, Vol. 2501, Springer, Berlin/Heidelberg, pp. 267-287.
  • Daemen, J. and Rijmen, V. (1999). AES proposal: Rijndael, Proceedings of the First Advanced Encryption Standard Candidate Conference, Ventura, CA, USA.
  • Fuller, J. and Millan, W. (2002). On linear redundancy in the AES S-Box, Cryptology ePrint Archive, http://eprint.iacr.org.
  • Fuller, J. and Millan, W. (2003). Linear redundancy in S-boxes, in T. Johansson (Ed.) Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers, Lecture Notes in Computer Science, Vol. 2887, Springer-Verlag, New York, NY, pp. 74-86.
  • Idzikowska, E. and Bucholc, K. (2007). Concurrent error detection in S-boxes, International Journal of Computer Science and Applications 4(1): 27-32.
  • Johansson, T. (Ed.) (2003). Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers, Lecture Notes in Computer Science, Vol. 2887, Springer-Verlag, New York, NY.
  • NIST (2005). Statistical test suite (version 1.8), http://csrc.nist.gov/rng/rng2.html.
  • Socha, P. (2008). Scalable PP-1 block cipher-Implementation, Report No. 558, Poznań University of Technology, Institute of Control and Information Engineering, Poznań.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-amcv20i2p401bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.