{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:15:15Z","timestamp":1772547315163,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00500-021-06085-6","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T15:06:03Z","timestamp":1629731163000},"page":"13127-13145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Empirical and statistical comparison of intermediate steps of AES-128 and RSA in terms of time consumption"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3932-3048","authenticated-orcid":false,"given":"Prashant","family":"Pranav","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soubhik","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"key":"6085_CR1","volume-title":"The design and analysis of algorithms","author":"A Aho","year":"1975","unstructured":"Aho A, Hopcroft JE, Ullman JD (1975) The design and analysis of algorithms. Addison-Wesley, Boston"},{"key":"6085_CR2","unstructured":"Announcing the ADVANCED ENCRYPTION STANDARD (AES) (2012) Federal Information Processing Standards Publication 197. United States National Institute of Standards and Technology (NIST). November 26, 2001. Retrieved October 2, 2012"},{"key":"6085_CR3","doi-asserted-by":"publisher","unstructured":"Bogdanov A, Chang D, Ghosh M, Sanadhya SK (2015) Bicliques with minimal data and time complexity for AES. In: Lee J, Kim J (eds) Information security and cryptology\u2014ICISC 2014. ICISC 2014. Lecture notes in computer science, vol 8949. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-15943-0_10","DOI":"10.1007\/978-3-319-15943-0_10"},{"key":"6085_CR4","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.amc.2006.11.097","volume":"189","author":"S Chakraborty","year":"2007","unstructured":"Chakraborty S (2007) A simple empirical formula for categorizing computing operations. Appl Math Comput 189:326\u2013340. https:\/\/doi.org\/10.1016\/j.amc.2006.11.097","journal-title":"Appl Math Comput"},{"key":"6085_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0893-9659(00)00043-4","volume":"13","author":"S Chakraborty","year":"2000","unstructured":"Chakraborty S, Chaudhary P (2000) A statistical analysis of an algorithm\u2019s complexity. Appl Math Lett 13:121\u2013126","journal-title":"Appl Math Lett"},{"issue":"1","key":"6085_CR6","first-page":"195","volume":"190","author":"S Chakraborty","year":"2007","unstructured":"Chakraborty S, Sourabh SK (2007) On why an algorithmic time complexity measure can be system invariant rather than system independent. Appl Math Comput 190(1):195\u2013204","journal-title":"Appl Math Comput"},{"key":"6085_CR7","first-page":"384","volume":"189","author":"S Chakraborty","year":"2007","unstructured":"Chakraborty S, Sourabh SK, Bose M, Sushant K (2007) Replacement sort revisited: The \u2018\u201cgold standard\u201d\u2019 unearthed! Appl Math Comput 189:384\u2013394","journal-title":"Appl Math Comput"},{"key":"6085_CR8","first-page":"15","volume":"190","author":"S Chakraborty","year":"2007","unstructured":"Chakraborty S, Sundararajan KK (2007) Winograd\u2019s algorithm statistically revisited: It pays to weigh than to count! Appl Math Comput 190:15\u201320","journal-title":"Appl Math Comput"},{"key":"6085_CR9","unstructured":"Chakraborty S, Sourabh SK (2010) A computer experiment oriented approach to algorithmic complexity. LAP LAMBERT Academic"},{"key":"6085_CR10","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, New York","edition":"3"},{"key":"6085_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(02)00142-8","author":"C Cotta","year":"2004","unstructured":"Cotta C, Moscato P (2004) A mixed evolutionary-statistical analysis of an algorithm\u2019s complexity. Appl Math Lett. https:\/\/doi.org\/10.1016\/S0893-9659(02)00142-8","journal-title":"Appl Math Lett"},{"key":"6085_CR12","unstructured":"Daemen J, Rijmen V (2003) AES proposal:\nRijndael. National Institute of Standards and Technology, p 1"},{"key":"6085_CR13","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5572.001.0001","volume-title":"Privacy on the line. The politics of wiretapping and encryption","author":"W Diffie","year":"2007","unstructured":"Diffie W, Landau S (2007) Privacy on the line. The politics of wiretapping and encryption. MIT Press, Cambridge"},{"key":"6085_CR14","doi-asserted-by":"publisher","unstructured":"Dutta S, Sinha S (2020) An improved pig latin algorithm for lightweight cryptography. https:\/\/doi.org\/10.1007\/978-981-13-8222-2_28.","DOI":"10.1007\/978-981-13-8222-2_28"},{"key":"6085_CR15","volume-title":"Cryptography and network security","author":"BA Forouzan","year":"2010","unstructured":"Forouzan BA, Mukhopadhyay D (2010) Cryptography and network security, 2nd edn. Tata McGraw-Hill, New York","edition":"2"},{"key":"6085_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287681","volume-title":"Measuring empirical computational complexity","author":"SF Goldsmith","year":"2007","unstructured":"Goldsmith SF, Aiken AS, Wilkerson DS (2007) Measuring empirical computational complexity. ACM, New York"},{"key":"6085_CR17","volume-title":"Mathematics for the analysis of algorithms","author":"DH Greene","year":"1991","unstructured":"Greene DH, Knuth DE (1991) Mathematics for the analysis of algorithms, 3rd edn. Birkh\u00e4user, Boston","edition":"3"},{"key":"6085_CR18","volume-title":"Fundamental algorithms,","author":"DE Knuth","year":"1973","unstructured":"Knuth DE (1973) Fundamental algorithms, vol 1. Addison-Wesley, Boston"},{"issue":"1","key":"6085_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/ijoc.12.1.24.11899","volume":"12","author":"C Marie","year":"2000","unstructured":"Coffin M, Saltzman MJ (2000) Statistical analysis of computational tests of algorithms and heuristics. INFORMS J Comput 12(1):24\u201344. https:\/\/doi.org\/10.1287\/ijoc.12.1.24.11899","journal-title":"INFORMS J Comput"},{"key":"6085_CR20","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1007\/s00500-019-03983-8","volume":"24","author":"P Pranav","year":"2020","unstructured":"Pranav P, Chakraborty S, Dutta S (2020) A new cipher system using semi-natural composition in Indian raga. Soft Comput 24:1529\u20131537. https:\/\/doi.org\/10.1007\/s00500-019-03983-8","journal-title":"Soft Comput"},{"key":"6085_CR21","doi-asserted-by":"publisher","unstructured":"Pranav P, Dutta S, Chakraborty S (2021) An involution function-based symmetric stream cipher. In: Nath V, Mandal JK (eds) Proceedings of the fourth international conference on microelectronics, computing and communication systems. Lecture notes in electrical engineering, vol 673. Springer, Singapore. https:\/\/doi.org\/10.1007\/978-981-15-5546-6_5","DOI":"10.1007\/978-981-15-5546-6_5"},{"key":"6085_CR22","volume-title":"Complexity theory and cryptology","author":"J Rothe","year":"2005","unstructured":"Rothe J (2005) Complexity theory and cryptology. Springer, Berlin"},{"issue":"2","key":"6085_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(82)90114-4","volume":"15","author":"A Schoor","year":"1982","unstructured":"Schoor A (1982) Fast algorithm for sparse matrix multiplication. Inf Process Lett 15(2):87\u201389","journal-title":"Inf Process Lett"},{"key":"6085_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/840432","volume":"2014","author":"N Singh","year":"2014","unstructured":"Singh N, Chakraborty S, Mallick D (2014) A new look at worst case complexity: a statistical approach. Int J Anal 2014:1\u201310. https:\/\/doi.org\/10.1155\/2014\/840432","journal-title":"Int J Anal"},{"key":"6085_CR25","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1504\/IJCCIA.2019.103729","volume":"1","author":"N Singh","year":"2019","unstructured":"Singh N, Chakraborty S, Mallick D (2019) Complexity verification through design and analysis of computer experiments. Int J Comput Complex Intell Algorithms 1:178. https:\/\/doi.org\/10.1504\/IJCCIA.2019.103729","journal-title":"Int J Comput Complex Intell Algorithms"},{"key":"6085_CR26","doi-asserted-by":"publisher","unstructured":"Singh NK, Chakraborty S (2011) Partition sort and its empirical analysis. In: Das V.V., Thankachan N. (eds) Computational intelligence and information technology. CIIT 2011. Communications in computer and information science, vol 250. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-25734-6_51","DOI":"10.1007\/978-3-642-25734-6_51"},{"key":"6085_CR27","unstructured":"Singh N, Chakraborty S, Mallick DK (2013) A statistical peek into average case complexity. ArXiv, abs\/1312.4802"},{"key":"6085_CR28","volume-title":"Cryptography and network security","author":"W Stallings","year":"2005","unstructured":"Stallings W (2005) Cryptography and network security, 4th edn. Pearson, London","edition":"4"},{"key":"6085_CR29","volume-title":"Network and Internetwork Security: Principles and Practice","author":"W Stallings","year":"2009","unstructured":"Stallings W (2009) Network and Internetwork Security: Principles and Practice, 5th edn. Prentice Hall, Hoboken","edition":"5th"},{"key":"6085_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755286","volume-title":"Complexity and Cryptography","author":"J Talbot","year":"2006","unstructured":"Talbot J, Welsh D (2006) Complexity and Cryptography. Cambridge University Press, Cambridge"},{"key":"6085_CR31","volume-title":"Modern operating systems","author":"A Tanenbaum","year":"2001","unstructured":"Tanenbaum A (2001) Modern operating systems. Prentice Hall of India, Hoboken"},{"key":"6085_CR32","unstructured":"The Advanced Encryption Standard (Rijndael) (2010) http:\/\/www.quadibloc.com\/crypto\/co040401.htmAccessed March 10, 2019"},{"key":"6085_CR33","unstructured":"Trenholme S \"S-box.\" AES (2010) http:\/\/www.samiam.org\/s-box.html. Accessed 10 March 2019"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06085-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06085-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06085-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T04:06:28Z","timestamp":1634097988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06085-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":33,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["6085"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06085-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"26 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that this research did not receive any funding and that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}