{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:14:19Z","timestamp":1740287659774,"version":"3.37.3"},"reference-count":18,"publisher":"University of Zielona G\u00f3ra, Poland","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6,1]]},"abstract":"<jats:title>Scalable PP-1 block cipher<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.2478\/v10006-010-0030-6","type":"journal-article","created":{"date-parts":[[2010,7,3]],"date-time":"2010-07-03T06:34:38Z","timestamp":1278138878000},"page":"401-411","source":"Crossref","is-referenced-by-count":7,"title":["Scalable PP-1 block cipher"],"prefix":"10.61822","volume":"20","author":[{"given":"Krzysztof","family":"Bucholc","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Chmiel","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Grocholewska-Czury\u0142o","sequence":"additional","affiliation":[]},{"given":"Ewa","family":"Idzikowska","sequence":"additional","affiliation":[]},{"given":"Izabela","family":"Janicka-Lipska","sequence":"additional","affiliation":[]},{"given":"Janusz","family":"Stok\u0142osa","sequence":"additional","affiliation":[]}],"member":"37438","reference":[{"key":"1","first-page":"410","article-title":"Concurrent fault detection in a hardware implementation of the RC5 encryption algorithm","author":"G. Bertoni","year":"2003a"},{"key":"2","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/TC.2003.1190590","article-title":"Error analysis and detection procedures for a hardware implementation of the advanced encryption standard","volume":"52","author":"G. Bertoni","year":"2003b","journal-title":"IEEE Transactions on Computers"},{"key":"3","first-page":"487","volume-title":"CRYPTO","volume":"740","author":"E. Biham","year":"1992"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Biryukov, A. (2003). Analysis of involutional ciphers: Khazad and Anubis, <i>in<\/i> T. Johansson (Ed.), <i>Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers<\/i>, Lecture Notes in Computer Science, Vol. 2887, Springer, New York, NY, pp. 45-53.","DOI":"10.1007\/978-3-540-39887-5_5"},{"key":"5","first-page":"17","article-title":"Analysis of the influence of errors on the encryption and decryption in PP-1 block cipher","volume":"32","author":"K. Bucholc","year":"2007","journal-title":"Studia z Automatyki i Informatyki"},{"key":"6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.26636\/jtit.2006.3.385","article-title":"Distribution of the best nonzero differential and linear approximations of S-box functions","volume":"3","author":"K. Chmiel","year":"2006a","journal-title":"Journal of Telecommunications and Information Technology"},{"key":"7","first-page":"331","article-title":"Intermediate evaluation of block ciphers","volume":"1","author":"K. Chmiel","year":"2006b"},{"key":"8","first-page":"111","article-title":"On differential and linear approximation of S-box functions","author":"K. Chmiel","year":"2006c"},{"key":"9","first-page":"1852","article-title":"Involutional block cipher for limited resources","author":"K. Chmiel","year":"2008a"},{"issue":"4C","key":"10","first-page":"371","article-title":"Scalable cipher for limited resources","volume":"17","author":"K. Chmiel","year":"2008b","journal-title":"Polish Journal of Environmental Studies"},{"key":"11","first-page":"267","volume-title":"ASIACRYPT","volume":"2501","author":"N. Courtois","year":"2002"},{"article-title":"AES proposal: Rijndael","year":"1999","author":"J. Daemen","key":"12"},{"key":"13","unstructured":"Fuller, J. and Millan, W. (2002). On linear redundancy in the AES S-Box, <i>Cryptology ePrint Archive<\/i> <a target=\"_blank\" href='http:\/\/eprint.iacr.org'>http:\/\/eprint.iacr.org<\/a>"},{"key":"14","doi-asserted-by":"crossref","unstructured":"Fuller, J. and Millan, W. (2003). Linear redundancy in S-boxes, <i>in<\/i> T. Johansson (Ed.) <i>Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers<\/i>, Lecture Notes in Computer Science, Vol. 2887, Springer-Verlag, New York, NY, pp. 74-86.","DOI":"10.1007\/978-3-540-39887-5_7"},{"issue":"1","key":"15","first-page":"27","article-title":"Concurrent error detection in S-boxes","volume":"4","author":"E. Idzikowska","year":"2007","journal-title":"International Journal of Computer Science and Applications"},{"key":"16","doi-asserted-by":"crossref","unstructured":"Johansson, T. (Ed.) (2003). <i>Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers<\/i>, Lecture Notes in Computer Science, Vol. 2887, Springer-Verlag, New York, NY.","DOI":"10.1007\/b93938"},{"key":"17","unstructured":"NIST (2005). Statistical test suite (version 1.8) <a target=\"_blank\" href='http:\/\/csrc.nist.gov\/rng\/rng2.html'>http:\/\/csrc.nist.gov\/rng\/rng2.html<\/a>"},{"key":"18","unstructured":"Socha, P. (2008). Scalable PP-1 block cipher\u2014Implementation, <i>Report No. 558<\/i>, Pozna\u0144 University of Technology, Institute of Control and Information Engineering, Pozna\u0144."}],"container-title":["International Journal of Applied Mathematics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/amcs\/20\/2\/article-p401.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/amcs.2010.20.issue-2\/v10006-010-0030-6\/v10006-010-0030-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T15:50:37Z","timestamp":1740239437000},"score":1,"resource":{"primary":{"URL":"https:\/\/content.sciendo.com\/doi\/10.2478\/v10006-010-0030-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,1]]},"references-count":18,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/v10006-010-0030-6","relation":{},"ISSN":["1641-876X"],"issn-type":[{"type":"print","value":"1641-876X"}],"subject":[],"published":{"date-parts":[[2010,6,1]]}}}