{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T16:33:43Z","timestamp":1769963623318,"version":"3.49.0"},"reference-count":24,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"published-print":{"date-parts":[[2020,7,3]]},"DOI":"10.1080\/17445760.2020.1760863","type":"journal-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T09:41:18Z","timestamp":1588844478000},"page":"461-472","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["Improved algorithms in parallel evaluation of large cryptographic S-boxes"],"prefix":"10.1080","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7651-7415","authenticated-orcid":false,"given":"Behrooz","family":"Khadem","sequence":"first","affiliation":[{"name":"Department of Communication, Faculty of Information and Communication Technology, Imam Hossein Comprehensive University, Tehran, Iran"}]},{"given":"Reza","family":"Ghasemi","sequence":"additional","affiliation":[{"name":"Faculty of Computer Engineering, Sharif University of Technology, Tehran, Iran"}]}],"member":"301","published-online":{"date-parts":[[2020,5,7]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2015.06.005"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Prouff E. DPA attacks and s-boxes. In: International Workshop on Fast Software Encryption. Berlin, Heidelberg: Springer; 2005. p. 424\u2013441.","DOI":"10.1007\/11502760_29"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2017.1410547"},{"issue":"6","key":"CIT0006","first-page":"1206","volume":"20","author":"Mohamed K","year":"2018","journal-title":"Int J Network Secur"},{"key":"CIT0007","unstructured":"Amaral B, Darachev S, Ludvigsson M, et\u00a0al. S-box analysis. In: ECMI modelling week, July 17\u201324, Sofia, Bulgaria. 2016."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1080\/23742917.2018.1485415"},{"key":"CIT0009","unstructured":"Wood Christopher A. Large substitution boxes with efficient combinational implementations [MSC Thesis], Rochester Institute of Technology; 2013."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9391-y"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Ahmad M, Seeru F, Siddiqi AM, et\u00a0al. Dynamic 9\u00d79 substitution-boxes using chaos-based heuristic search. In: Soft computing theories and applications. Singapore: Springer; 2018. p. 839\u2013851.","DOI":"10.1007\/978-981-10-5687-1_75"},{"key":"CIT0012","unstructured":"Ososanya E, Chen JC, Poo R. Performance evaluation of parallel fast Walsh transform algorithms on a shared-memory multiprocessor computer. In: Proceedings of 26th Southeastern Symposium on System Theory. IEEE; 1994. p. 562\u2013566."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1049\/el:19951466"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.07.001"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Picek S, Batina L, Jakobovi\u0107 D, et\u00a0al. S-box, SET, match: a toolbox for s-box analysis. In: IFIP International Workshop on Information Security Theory and Practice. Berlin, Heidelberg: Springer; 2014. p. 140\u2013149.","DOI":"10.1007\/978-3-662-43826-8_10"},{"key":"CIT0016","unstructured":"Sosa PM. Calculating non-linearity of Boolean functions with walsh hadamard transform. In: UCSB, Santa Barbara; 2016. p. 1\u20134."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018007"},{"issue":"5","key":"CIT0018","first-page":"21","volume":"18","author":"Bikov D","year":"2018","journal-title":"Cybern Inf Technol"},{"key":"CIT0019","doi-asserted-by":"crossref","unstructured":"Picek S. Applications of evolutionary computation to cryptology [Ph.D. thesis], RU 46525, Netherlands; 2015.","DOI":"10.1145\/2908961.2927003"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511780448.012"},{"key":"CIT0021","unstructured":"Bouyukliev I, Bikov D. Applications of the binary representation of integers in algorithms for boolean functions. In: Proceedings of the Forty Fourth Spring Conference of the Union of Bulgarian Mathematicians, vol. 44; 2015. p. 161\u2013166."},{"key":"CIT0022","unstructured":"Burnett LD. Heuristic optimization of Boolean functions and substitution boxes for cryptography [Ph.D. dissertation]. Queensland University of Technology, Australia; 2005."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.07.003"},{"key":"CIT0024","unstructured":"Stein W. Sage mathematics software. 2007. Available from: http:\/\/www.sagemath.org\/."}],"container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/17445760.2020.1760863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T08:16:50Z","timestamp":1620289010000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/17445760.2020.1760863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,7]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7,3]]}},"alternative-id":["10.1080\/17445760.2020.1760863"],"URL":"https:\/\/doi.org\/10.1080\/17445760.2020.1760863","relation":{},"ISSN":["1744-5760","1744-5779"],"issn-type":[{"value":"1744-5760","type":"print"},{"value":"1744-5779","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,7]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-12-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}