{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T05:17:36Z","timestamp":1701926256130},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s12095-022-00623-1","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T02:02:41Z","timestamp":1676599361000},"page":"675-707","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing balanced sequences obtained from ElGamal function to random balanced sequences"],"prefix":"10.1007","volume":"15","author":[{"given":"Daniel","family":"Panario","sequence":"first","affiliation":[]},{"given":"Lucas Pandolfo","family":"Perin","sequence":"additional","affiliation":[]},{"given":"Brett","family":"Stevens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,17]]},"reference":[{"key":"623_CR1","doi-asserted-by":"crossref","unstructured":"Golomb, S.W., Gong, G.: Signal design for good correlation. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546907"},{"key":"623_CR2","doi-asserted-by":"crossref","unstructured":"Mullen, G.L., Panario, D.: Handbook of finite fields, 1st ed. Chapman & Hall\/CRC (2013)","DOI":"10.1201\/b15006"},{"issue":"2-3","key":"623_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-009-9333-8","volume":"55","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn, C.J.: Covering arrays from cyclotomy. Des. Codes Crypt. 55(2-3), 201\u2013219 (2010)","journal-title":"Des. Codes Crypt."},{"key":"623_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10623-016-0316-2","volume":"85","author":"G Tzanakis","year":"2017","unstructured":"Tzanakis, G., Panario, D., Moura, L., Stevens, B.: Covering arrays from m-sequences and character sums. Des. Codes Crypt. 85, 437\u2013456 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"623_CR5","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory IT-31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"623_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1080\/01611194.2020.1790128","volume":"44","author":"J von zur","year":"2020","unstructured":"von zur, J., Gathen, L., Niehues, B., Pandolfo Perin, L., Zumalac\u00e1rregui, A.: Sidon sets and the statistics of the ElGamal function. Cryptologia 44(5), 438\u2013450 (2020)","journal-title":"Cryptologia"},{"issue":"15","key":"623_CR7","doi-asserted-by":"publisher","first-page":"3320","DOI":"10.1016\/j.dam.2009.06.029","volume":"157","author":"K Drakakis","year":"2009","unstructured":"Drakakis, K., Gow, R., McGuire, G.: APN permutations on $\\mathbb {Z}_{n}$ and Costas arrays. Discret. Appl. Math. 157(15), 3320\u20133326 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"623_CR8","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TIT.2009.2039164","volume":"56","author":"K Drakakis","year":"2010","unstructured":"Drakakis, K., Requena, V., McGuire, G.: On the nonlinearity of exponential Welch Costas functions. IEEE Trans. Inform. Theory 56(3), 1230\u20131238 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"623_CR9","doi-asserted-by":"publisher","first-page":"Art.41,31","DOI":"10.1145\/1916461.1916465","volume":"37","author":"K Taylor","year":"2011","unstructured":"Taylor, K., Rickard, S., Drakakis, K.: Costas arrays: survey, standardization, and MATLAB toolbox. ACM Trans. Math. Software 37(4), Art.41,31 (2011)","journal-title":"ACM Trans. Math. Software"},{"key":"623_CR10","doi-asserted-by":"crossref","unstructured":"Drakakis, K.: On the measurement of the (non)linearity of Costas permutations. J. Appl. Math., pp. Art. ID 149658, 14 (2010)","DOI":"10.1155\/2010\/149658"},{"key":"623_CR11","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Amer. Math. Monthly 62, 26\u201329 (1955)","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"623_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0097-3165(83)90012-2","volume":"35","author":"EA Bender","year":"1983","unstructured":"Bender, E.A., Richmond, L.B., Williamson, S.G.: Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions. J. Combin. Theory Ser. A 35(3), 263\u2013278 (1983)","journal-title":"J. Combin. Theory Ser. A"},{"key":"623_CR13","doi-asserted-by":"crossref","unstructured":"Eaton, M.L.: Multivariate Statistics: a vector space approach. Inst. Math. Stat., 53 (2007)","DOI":"10.1214\/lnms\/1196285102"},{"key":"623_CR14","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511801655"},{"key":"623_CR15","first-page":"203","volume":"28","author":"T van Aardenne-Ehrenfest","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin 28, 203\u2013217 (1951)","journal-title":"Simon Stevin"},{"key":"623_CR16","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 8.6). https:\/\/www.sagemath.org (2020)"},{"issue":"4","key":"623_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF03023749","volume":"10","author":"MR Murty","year":"1988","unstructured":"Murty, M.R.: Artin\u2019s conjecture for primitive roots. Math. Intelligencer 10(4), 59\u201367 (1988)","journal-title":"Math. Intelligencer"},{"issue":"6","key":"623_CR18","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1515\/integers-2012-0043","volume":"12","author":"P Moree","year":"2012","unstructured":"Moree, P.: Artin\u2019s primitive root conjecture\u2014a survey. Integers 12 (6), 1305\u20131416 (2012)","journal-title":"Integers"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00623-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00623-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00623-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T01:24:21Z","timestamp":1701912261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00623-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00623-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"22 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"All authors consent. No other consent applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"None","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}