Scalable PP-1 block cipher

  • Authors:
  • Krzysztof Bucholc;Krzysztof Chmiel;Anna Grocholewska-CzuryłO;Ewa Idzikowska;Izabela Janicka-Lipska;Janusz StokłOsa

  • Affiliations:
  • 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

  • Venue:
  • International Journal of Applied Mathematics and Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.