{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T08:36:57Z","timestamp":1772267817489,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T00:00:00Z","timestamp":1523232000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11277-018-5698-1","type":"journal-article","created":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T11:54:24Z","timestamp":1523274864000},"page":"439-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":87,"title":["A Method of Generating 8\u2009\u00d7\u20098 Substitution Boxes Based on Elliptic Curves"],"prefix":"10.1007","volume":"101","author":[{"given":"Umar","family":"Hayat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naveed Ahmed","family":"Azam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Asif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,9]]},"reference":[{"key":"5698_CR1","first-page":"689","volume":"2","author":"XY Shi","year":"1997","unstructured":"Shi, X. Y., Xiao, H., You, X. C., & Lam, K. Y. (1997). A method for obtaining cryptographically strong 8\u2009\u00d7\u20098 S-boxes. International Conference on Information Network and Application, 2, 689\u2013693.","journal-title":"International Conference on Information Network and Application"},{"key":"5698_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/81.904880","volume":"48","author":"G Jakimoski","year":"2001","unstructured":"Jakimoski, G., & Kocarev, L. (2001). Chaos and cryptography: block encryption ciphers. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 48, 163\u2013170.","journal-title":"IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications"},{"key":"5698_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.chaos.2004.04.023","volume":"23","author":"T Guoping","year":"2005","unstructured":"Guoping, T., Xiaofeng, L., & Yong, C. (2005). A novel method for designing S-boxes based on chaotic maps. Chaos, Solitons & Fractals, 23, 413\u2013419.","journal-title":"Chaos, Solitons & Fractals"},{"key":"5698_CR4","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.chaos.2006.08.003","volume":"36","author":"C Guo","year":"2008","unstructured":"Guo, C. (2008). A novel heuristic method for obtaining S-boxes. Chaos, Solitons & Fractals, 36, 1028\u20131036.","journal-title":"Chaos, Solitons & Fractals"},{"key":"5698_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1080\/01611190802653228","volume":"33","author":"J Kim","year":"2009","unstructured":"Kim, J., & Phan, R. C. W. (2009). Advanced differential-style cryptanalysis of the NSA\u2019s skipjack block cipher. Cryptologia, 33, 246\u2013270.","journal-title":"Cryptologia"},{"key":"5698_CR6","unstructured":"Neural, Y. W., Li, Y., Min, L., & Sihong, S. A method for designing S-box based on chaotic neural network. In 2010 Sixth international conference on natural computation (ICNC 2010)."},{"key":"5698_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-012-0914-5","author":"I Hussain","year":"2012","unstructured":"Hussain, I., Shah, T., Gondal, M. A., Khan, W. A., & Mehmood, H. (2012). A group theoretic approach to construct cryptographically strong substitution boxes. Neural Computing and Applications. \n                    https:\/\/doi.org\/10.1007\/s00521-012-0914-5\n                    \n                  .","journal-title":"Neural Computing and Applications"},{"key":"5698_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.optlastec.2014.01.018","volume":"61","author":"I Hussain","year":"2014","unstructured":"Hussain, I., Azam, N. A., & Shah, T. (2014). Stego optical encryption based on chaotic S-box transformation. Optics & Laser Technology, 61, 50\u201356.","journal-title":"Optics & Laser Technology"},{"key":"5698_CR9","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"20","author":"CE Shannon","year":"1949","unstructured":"Shannon, C. E. (1949). Communications theory of secrecy systems. Bell Labs Technical Journal, 20, 656\u2013715.","journal-title":"Bell Labs Technical Journal"},{"key":"5698_CR10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-46885-4_53","volume":"434","author":"M Willi","year":"1990","unstructured":"Willi, M., & Othmar, S. (1990). Nonlinearity criteria for cryptographic functions. Advances in Cryptology\u2013EUROCRYPT \u201989 LNCS, 434, 549\u2013562.","journal-title":"Advances in Cryptology\u2013EUROCRYPT \u201989 LNCS"},{"key":"5698_CR11","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume":"765","author":"M Mitsuru","year":"1994","unstructured":"Mitsuru, M. (1994). Linear cryptanalysis method for DES cipher. Advances in Cryptology\u2013EUROCRYPT \u201893 LNCS, 765, 386\u2013397.","journal-title":"Advances in Cryptology\u2013EUROCRYPT \u201893 LNCS"},{"key":"5698_CR12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume":"537","author":"B Eli","year":"1991","unstructured":"Eli, B., & Adi, S. (1991). Differential crypt analysis of DES-like cryptosystems. Advances in Cryptology - CRYPTO \u201890 LNCS, 537, 2\u201321.","journal-title":"Advances in Cryptology - CRYPTO \u201890 LNCS"},{"key":"5698_CR13","unstructured":"Thomas, J., & Knudsen, L, R. (1997). The interpolation attack on block ciphers. In International workshop on fast software encription (FSE), Fast Software Encription (pp. 28\u201340)."},{"key":"5698_CR14","unstructured":"Nicolas, C., Alexander, K., Jacques, P., & Adi, S. (2000). Effcient algorithms for solving overdefined systems of multivariate polynomial equations. In International conference on the theory and application of cryptographic techniques EUROCRYPT 2000: advances in cryptology-EUROCRYPT (pp. 392\u2013407)."},{"key":"5698_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36178-2_17","volume":"2501","author":"NT Courtois","year":"2002","unstructured":"Courtois, N. T., & Josef, P. (2002). Cryptanalysis of block ciphers with overdefined systems of equations. ASIACRYPT 2002 LNCS, 2501, 267\u2013287.","journal-title":"ASIACRYPT 2002 LNCS"},{"key":"5698_CR16","unstructured":"Daemen, J., & Rijmen, V. (1999). AES proposal: Rijndael (Version 2). NIST AES, csrc.nist.gov\/encryption\/aes."},{"key":"5698_CR17","doi-asserted-by":"crossref","unstructured":"Ferguson, N., Schroeppel, R., & Whiting, D. A. (2001). Simple algebraic representation of Rijndael. In Selected areas in cryptography SAC 01, LNCS 2259 (pp. 103\u2013111).","DOI":"10.1007\/3-540-45537-X_8"},{"key":"5698_CR18","doi-asserted-by":"crossref","unstructured":"Murphy, S., & Robshaw, M. J. (2002). Essential algebraic structure within the AES. In Proceedings of the 22th annual international cryptology (pp. 1\u201316). Berlin: Springer.","DOI":"10.1007\/3-540-45708-9_1"},{"key":"5698_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1142\/S0219498803000532","volume":"2","author":"J Rosenthal","year":"2003","unstructured":"Rosenthal, J. (2003). A polynomial description of the Rijndael advanced encryption standard. Journal of Algebra and its Applications, 2, 223\u2013236.","journal-title":"Journal of Algebra and its Applications"},{"key":"5698_CR20","unstructured":"Liu, J., Wai, B., Cheng, X., & Wang, X. (2005). An AES S-box to increase complexity and cryptographic analysis. In Proceedings of the 19th international conference on advanced information networking and applications, Taiwan (pp. 724\u2013728)."},{"key":"5698_CR21","first-page":"751","volume":"3","author":"L Cui","year":"2007","unstructured":"Cui, L., & Cao, Y. (2007). A new S-box structure named affine power-affine. International Journal of Innovative Computing, Information and Control, 3, 751\u2013759.","journal-title":"International Journal of Innovative Computing, Information and Control"},{"key":"5698_CR22","first-page":"253","volume":"1","author":"MT Tran","year":"2008","unstructured":"Tran, M. T., Bui, D. K., & Doung, A. D. (2008). Gray S-box for advanced encryption standard. International Conference on Computational Intelligence and Security, 1, 253\u2013258.","journal-title":"International Conference on Computational Intelligence and Security"},{"key":"5698_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1110","author":"M Khan","year":"2014","unstructured":"Khan, M., & Azam, N. A. (2014). Right translated AES Gray S-box. Security and Network Communication. \n                    https:\/\/doi.org\/10.1002\/sec.1110\n                    \n                  .","journal-title":"Security and Network Communication"},{"key":"5698_CR24","doi-asserted-by":"publisher","unstructured":"Khan, M., & Azam, N. A. (2015) S-boxes based on affine mapping and orbit of power function. 3D Research. \n                    https:\/\/doi.org\/10.1007\/s13319-015-0043-x\n                    \n                  .","DOI":"10.1007\/s13319-015-0043-x"},{"key":"5698_CR25","unstructured":"Hao, Y., Longyan, L., & Yong, W. (2010). An S-box construction algorithm based on spatiotemporal chaos. In International conference on communications and mobile computing."},{"key":"5698_CR26","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.physleta.2012.03.011","volume":"376","author":"W Yong","year":"2012","unstructured":"Yong, W., Kwok, W., Changbing, L., & Yang, L. (2012). A novel method to design S-box based on chaotic map and genetic algorithm. Physics Letters A, 376, 827\u2013833.","journal-title":"Physics Letters A"},{"issue":"376","key":"5698_CR27","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.physleta.2012.01.009","volume":"376","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Wong, K. W., Li, C., & Li, Y. (2012). A novel method to design S-box based on chaotic map and genetic algorithm. Physics Letters A, 376(376), 827\u2013833.","journal-title":"Physics Letters A"},{"key":"5698_CR28","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.optlastec.2014.01.018","volume":"61","author":"I Hussain","year":"2014","unstructured":"Hussain, I., Azam, N. A., & Shah, T. (2014). Stego optical encryption based on chaotic S-box transformation. Optics and Laser Technology, 61, 50\u201356.","journal-title":"Optics and Laser Technology"},{"key":"5698_CR29","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00521-015-1887-y","volume":"27","author":"M Khan","year":"2016","unstructured":"Khan, M., Shah, T., & Syeda, I. B. (2016). Construction of S-box based on chaotic Boolean functions and its application in image encryption. Neural Computing and Applications, 27, 677\u2013685. \n                    https:\/\/doi.org\/10.1007\/s00521-015-1887-y\n                    \n                  .","journal-title":"Neural Computing and Applications"},{"key":"5698_CR30","doi-asserted-by":"publisher","unstructured":"Vijayan, P., Paul, V., & Wahi, A. (2017). Dynamic colour table: A novel S-box for cryptographic applications. International Journal of Communication Systems. \n                    https:\/\/doi.org\/10.1002\/dac.3318\n                    \n                  .","DOI":"10.1002\/dac.3318"},{"key":"5698_CR31","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s11760-016-1007-1","volume":"11","author":"F \u00d6zkaynak","year":"2017","unstructured":"\u00d6zkaynak, F., \u00c7elik, V., & \u00d6zer, A. B. (2017). A new S-box construction method based on the fractional-order chaotic Chen system. SIViP, 11, 659. \n                    https:\/\/doi.org\/10.1007\/s11760-016-1007-1\n                    \n                  .","journal-title":"SIViP"},{"key":"5698_CR32","first-page":"417","volume":"85","author":"V Miller","year":"1986","unstructured":"Miller, V. (1986). Uses of elliptic curves in cryptography. Advances in Cryptology, 85, 417\u2013426.","journal-title":"Advances in Cryptology"},{"issue":"177","key":"5698_CR33","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"K Neal","year":"1987","unstructured":"Neal, K. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48(177), 203\u2013209.","journal-title":"Mathematics of Computation"},{"key":"5698_CR34","first-page":"286","volume":"1592","author":"HC Jung","year":"1999","unstructured":"Jung, H. C., Seongtaek, C., & Choonsik, P. (1999). S-boxes with controllable nonlinearity, EUROCRYPT\u201999. LNCS, 1592, 286\u2013294.","journal-title":"LNCS"},{"key":"5698_CR35","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1008354106356","volume":"19","author":"K Neal","year":"2000","unstructured":"Neal, K., Alfred, M., & Scott, V. (2000). The state of elliptic curve cryptography. Designs, Codes and Cryptography, 19, 173\u2013193.","journal-title":"Designs, Codes and Cryptography"},{"key":"5698_CR36","doi-asserted-by":"crossref","unstructured":"Amara, M., & Siad, A.(2011). Elliptic curve cryptography and its applications. In 7th international workshop on systems, signal processing and their applications (pp. 247\u2013250).","DOI":"10.1109\/WOSSPA.2011.5931464"},{"issue":"2","key":"5698_CR37","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/S1363-4127(97)81331-3","volume":"2","author":"SA Vansfone","year":"1997","unstructured":"Vansfone, S. A. (1997). Elliptic curve cryptography. The answer to strong, fast public-key cryptography for securing constrained environments. Information Security Technical Report, 2(2), 78\u201387.","journal-title":"Information Security Technical Report"},{"key":"5698_CR38","volume-title":"Cryptography and network security","author":"S Williams","year":"2000","unstructured":"Williams, S. (2000). Cryptography and network security (4th ed.). New York: Prentice Hall.","edition":"4"},{"key":"5698_CR39","doi-asserted-by":"crossref","unstructured":"Gong, G., Berson, T. A., & Stinson, D. R. (2000). Elliptic curve pseudorandom sequence generators. In Selected areas in cryptography (Kingston, ON, 1999), (pp. 34\u201348). Berlin: Springer.","DOI":"10.1007\/3-540-46513-8_3"},{"key":"5698_CR40","first-page":"561","volume":"6","author":"M Caragiu","year":"2006","unstructured":"Caragiu, M., Johns, R. A., & Gieseler, J. (2006). Quasi-random structures from elliptic curves. Journal of Algebra, Number Theory and Applications, 6, 561\u2013571.","journal-title":"Journal of Algebra, Number Theory and Applications"},{"key":"5698_CR41","doi-asserted-by":"crossref","unstructured":"Farashahi, R. R., & Sidorenko, S. B. A. (2007). Efficient pseudorandom generators based on the DDH assumption. In Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS (Vol. 4450, pp. 426\u2013441). Heidelberg: Springer.","DOI":"10.1007\/978-3-540-71677-8_28"},{"issue":"1","key":"5698_CR42","doi-asserted-by":"publisher","first-page":"31","DOI":"10.12785\/amis\/090105","volume":"9","author":"R Omar","year":"2015","unstructured":"Omar, R., & Zbigniew, K. (2015). On pseudo-random number generators using elliptic curves and chaotic systems. Applied Mathematics and Information Sciences, 9(1), 31\u201338.","journal-title":"Applied Mathematics and Information Sciences"},{"key":"5698_CR43","volume-title":"SEC 1: Elliptic curve cryptography","author":"DRL Brown","year":"2009","unstructured":"Brown, D. R. L. (2009). SEC 1: Elliptic curve cryptography. Mossossaiga: Certicom Corp."},{"key":"5698_CR44","first-page":"523","volume":"218","author":"AF Webster","year":"1986","unstructured":"Webster, A. F., & Tavares, S. E. (1986). On the design of S-boxes. Advances in Cryptology\u2013CRYPT0 \u201885 LNCS, 218, 523\u2013534.","journal-title":"Advances in Cryptology\u2013CRYPT0 \u201885 LNCS"},{"key":"5698_CR45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to finite fields and their applications","author":"R Lidl","year":"1994","unstructured":"Lidl, R., & Niederreiter, H. (1994). Introduction to finite fields and their applications (2nd ed.). Cambridge: Cambridge University Press.","edition":"2"},{"key":"5698_CR46","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1016\/j.cnsns.2012.12.024","volume":"18","author":"MD Bustamante","year":"2013","unstructured":"Bustamante, M. D., & Hayat, U. (2013). Complete classification of discrete resonant Rossby\/drift wave triads on periodic domains. Communications in Nonlinear Science and Numerical Simulation, 18, 2402\u20132419.","journal-title":"Communications in Nonlinear Science and Numerical Simulation"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-018-5698-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5698-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5698-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:05:51Z","timestamp":1554771951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-018-5698-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,9]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["5698"],"URL":"https:\/\/doi.org\/10.1007\/s11277-018-5698-1","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,9]]},"assertion":[{"value":"9 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}