{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:59:43Z","timestamp":1772301583399,"version":"3.50.1"},"reference-count":41,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:00:00Z","timestamp":1589414400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,5,14]]},"abstract":"<jats:p>Key schedule algorithms play an important role in modern encryption algorithms, and their security is as crucial as the security of the encryption algorithms themselves. Many studies have been performed on the cryptographic strength evaluation of the encryption algorithms; however, strength evaluation of the key schedule algorithms often obtains less attention that can lead towards the possible loophole in the overall encryption process. In this paper, a criterion is proposed to evaluate the cryptographic strength of the key schedule algorithms. This criterion includes different methods of data generation from subkeys and a suitable set of statistical tests. The statistical tests are used to explore the cryptographic properties such as diffusion, confusion, independence, and randomness in the subkeys generated by the key schedule algorithm. The proposed criterion has been applied to some of the key schedule algorithms of different block ciphers. The results confirm that the proposed criterion can effectively differentiate between strong- and weak-key schedule algorithms.<\/jats:p>","DOI":"10.1155\/2020\/3189601","type":"journal-article","created":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T23:46:24Z","timestamp":1589499984000},"page":"1-9","source":"Crossref","is-referenced-by-count":18,"title":["Cryptographic Strength Evaluation of Key Schedule Algorithms"],"prefix":"10.1155","volume":"2020","author":[{"given":"Shazia","family":"Afzal","sequence":"first","affiliation":[{"name":"Riphah Institute of Systems Engineering, Riphah International University, Rawalpindi, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Yousaf","sequence":"additional","affiliation":[{"name":"Riphah Institute of Systems Engineering, Riphah International University, Rawalpindi, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Humaira","family":"Afzal","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Bahauddin Zakariya University, Multan, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nawaf","family":"Alharbe","sequence":"additional","affiliation":[{"name":"College of Community, Taibah University, Medina, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1267-5510","authenticated-orcid":true,"given":"Muhammad Rafiq","family":"Mufti","sequence":"additional","affiliation":[{"name":"Department of Computer Science, COMSATS University Islamabad, Vehari Campus, Vehari, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8132547"},{"key":"2","first-page":"1","article-title":"Related-key cryptanalysis of the full AES-192 and AES-256","author":"A. Biryukov"},{"key":"3","article-title":"A better key schedule for DES-like ciphers","author":"U. Blumenthal"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30108-0_20"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58108-1_26"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_19"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45450-0_19"},{"issue":"3","key":"8","article-title":"Statistical analysis of key schedule algorithms of different block ciphers","volume":"27","author":"S. Afzal","year":"2015","journal-title":"Science International"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.9790\/0661-1903042126"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_20"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74735-2_31"},{"issue":"1","key":"12","first-page":"23","article-title":"Twofish: a 128-bit block cipher","volume":"15","author":"B. Schneier","year":"1998","journal-title":"NIST AES Proposal"},{"key":"13","article-title":"The design of Rijndael","volume-title":"AES-The Advanced Encryption Standard Process","author":"J. Daemen","year":"2013"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54705-3_6"},{"issue":"3","key":"15","first-page":"160","article-title":"A new shift column transformation: an enhancement of Rijndael key scheduling","volume":"1","author":"S. Sulaiman","year":"2012","journal-title":"International Journal of Cyber-Security and Digital Forensics (IJCSDF)"},{"key":"16","article-title":"Serpent: a proposal for the advanced encryption standard","volume-title":"First Advanced Encryption Standard (AES) Conference","author":"A. Ross","year":"1998"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45537-x_1"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2019.02.001"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/3309074.3309095"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2015.16"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2011.2161289"},{"key":"22","unstructured":"UkropM.Randomness analysis in authenticated encryption systems2016Brno, CzechiaMasarykovauniverzita, FakultainformatikyPh.D. thesis"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11039-0_7"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/fit.2014.38"},{"key":"25","first-page":"150","volume-title":"Modern Cryptanalysis: Techniques for Advanced Code Breaking","author":"C. Swenson","year":"2008"},{"key":"26"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/bf00193563"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23483-7_271"},{"key":"29","first-page":"129","article-title":"Simple and effective key scheduling for symmetric ciphers","author":"C. M. Adams"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.5121\/ijcis.2014.4103"},{"key":"31","volume-title":"Update to Current Use and Deprecation of TDEA","author":"Computer Security Resource Center","year":"2017"},{"key":"32","volume-title":"Technical Reference Details about Encryption in Office 365","author":"Microsoft","year":"2019"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.18535\/ijsrm\/v4i11.01x"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74619-5_14"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28879-1_17"},{"key":"36","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-319-13039-2_8","article-title":"On the key schedule of lightweight block ciphers","volume-title":"Progress in Cryptology\u2014INDOCRYPT 2014","author":"J. Huang","year":"2014"},{"key":"37","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-02620-1_7","article-title":"Lightweight block ciphers revisited: cryptanalysis of reduced round PRESENT and HIGHT","volume-title":"Australasian Conference on Information Security and Privacy","author":"O. \u00d6zen","year":"2009"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9802475"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.21817\/ijet\/2017\/v9i2\/170902171"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_27"},{"key":"41","unstructured":"SongB.Observations on the cryptologic properties of the AES algorithm2004Wollongong, AustraliaUniversity of WollongongPh.D. thesis"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/3189601.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/3189601.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/3189601.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T09:58:20Z","timestamp":1617789500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/3189601\/"}},"subtitle":[],"editor":[{"given":"Roberto","family":"Di Pietro","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,5,14]]},"references-count":41,"alternative-id":["3189601","3189601"],"URL":"https:\/\/doi.org\/10.1155\/2020\/3189601","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"value":"1939-0122","type":"electronic"},{"value":"1939-0114","type":"print"}],"subject":[],"published":{"date-parts":[[2020,5,14]]}}}