{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:18:50Z","timestamp":1758475130041,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Forctis AG","award":["Private Grant"],"award-info":[{"award-number":["Private Grant"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s13389-022-00297-8","type":"journal-article","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T12:05:05Z","timestamp":1661342705000},"page":"255-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Design and implementation of a novel cryptographically secure pseudorandom number generator"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3593-9099","authenticated-orcid":false,"given":"Juan","family":"Di Mauro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9060-4304","authenticated-orcid":false,"given":"Eduardo","family":"Salazar","sequence":"additional","affiliation":[]},{"given":"Hugo D.","family":"Scolnik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,24]]},"reference":[{"key":"297_CR1","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, New York (1996)"},{"key":"297_CR2","volume-title":"Open Problems in Mathematics and Computational Science","author":"M Stipcevic","year":"2014","unstructured":"Stipcevic, M., Koc, C.K.: True Random Number Generators. In: Koc, C. (ed.) Open Problems in Mathematics and Computational Science. Springer, Cham (2014)"},{"key":"297_CR3","doi-asserted-by":"publisher","unstructured":"Rukhin, A., Soto, J., Nechvatal, J., Smid, M.: (NIST), Barker E., Leigh S., Levenson M., Vangel M., Banks D., Heckert N., Dray J., Vo S., Bassham L.: A Statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST. https:\/\/doi.org\/10.6028\/NIST.SP.800-22r1a(2010). Accessed 12 July 2022","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"297_CR4","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Simard, R.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Software. Vol 33, article 22 (2007). (Software available at http:\/\/www-labs.iro.umontreal.ca\/~simul\/testu01\/tu01.html)","DOI":"10.1145\/1268776.1268777"},{"key":"297_CR5","unstructured":"Practically Random. https:\/\/sourceforge.net\/projects\/pracrand\/. Accessed 12 July (2022)"},{"key":"297_CR6","unstructured":"RaBiGeTe. http:\/\/cristianopi.altervista.org\/RaBiGeTe_MT\/. Accessed 12 July (2022)"},{"key":"297_CR7","unstructured":"Diehard. https:\/\/web.archive.org\/web\/20160125103112\/http:\/stat.fsu.edu\/pub\/diehard\/. Accessed 12 July (2022)"},{"key":"297_CR8","unstructured":"Dieharder. https:\/\/webhome.phy.duke.edu\/~rgb\/General\/dieharder.php. Accessed 12 July (2022)"},{"key":"297_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0307-3","volume-title":"Exploring Randomness","author":"G Chaitin","year":"2001","unstructured":"Chaitin, G.: Exploring Randomness. Springer-Verlag, London (2001)"},{"issue":"5","key":"297_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/scientificamerican0575-47","volume":"232","author":"G Chaitin","year":"1975","unstructured":"Chaitin, G.: Randomness and mathematical proof. Sci. Am. 232(5), 47\u201352 (1975)","journal-title":"Sci. Am."},{"issue":"1","key":"297_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"297_CR12","unstructured":"Beale, P.D.: A new class of scalable parallel pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers ArXiv. https:\/\/arxiv.org\/abs\/1411.2484. (2014). Accesed 12 December (2019)"},{"key":"297_CR13","unstructured":"O\u2019Neill, M.: PCG: A family of simple fast space-efficient statistically good algorithms for random number generation. Harvey Mudd College. https:\/\/www.cs.hmc.edu\/tr\/hmc-cs-2014-0905.pdf (2014). Accesed 2 December (2019)"},{"key":"297_CR14","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. EUROCRYPT, pp. 224-314 (1984)","DOI":"10.1007\/3-540-39757-4_20"},{"issue":"3","key":"297_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT Numer. Math. 15(3), 331\u2013334 (1975)","journal-title":"BIT Numer. Math."},{"key":"297_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over $$GF(p)$$ and its cryptographic significance. IEEE Trans. Inf. Theory 24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR17","doi-asserted-by":"crossref","unstructured":"Adleman, L.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In: 20th annual symposium on foundations of computer science (1979)","DOI":"10.1109\/SFCS.1979.2"},{"key":"297_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro, R.: An improved pseudo-random generator based on discrete log. In: Annual international cryptology conference. Springer, Berlin, Heidelberg, (2000)","DOI":"10.1007\/3-540-44598-6_29"},{"key":"297_CR19","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography, (Draft), http:\/\/toc.cryptobook.us\/ (2020). Accessed 1 February (2022)"},{"issue":"3","key":"297_CR20","doi-asserted-by":"publisher","first-page":"653","DOI":"10.4007\/annals.2019.189.3.1","volume":"189","author":"E Chattopadhyay","year":"2019","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. Ann. Math. 189(3), 653\u2013705 (2019)","journal-title":"Ann. Math."},{"issue":"4","key":"297_CR21","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"297_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"An Efficient Discrete Log Pseudo Random Generator. CRYPTO 1998","author":"S Patel","year":"1998","unstructured":"Patel, S., Sundaram, G.S.: An Efficient Discrete Log Pseudo Random Generator. CRYPTO 1998. Lecture Notes in Computer Science, vol. 1462. Springer, Berlin, Heidelberg (1998)"},{"key":"297_CR23","doi-asserted-by":"crossref","unstructured":"Verkhovsky B.: Deterministic algorithm computing all generators: application in cryptographic systems design. Int. J. Commun. Network Syst. Sci. pp. 715-719 (2012)","DOI":"10.4236\/ijcns.2012.511074"},{"key":"297_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1779-2","volume-title":"A Classical Introduction to Modern Number Theory","author":"K Ireland","year":"1982","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer, Cham (1982)"},{"key":"297_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139165464","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2005","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2005)"},{"key":"297_CR26","doi-asserted-by":"crossref","unstructured":"Pareschi, F., Rovatti, R., Setti, G.: Second-level NIST randomness tests for improving test reliability. ISCAS-IEEE, pp. 1437-40 (2007)","DOI":"10.1109\/ISCAS.2007.378572"},{"key":"297_CR27","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P.: Testing random number generators. In: Proceedings of the 24th conference on winter simulation. WSC\u201992, ACM, New York, USA, pp. 305-313 (1992)","DOI":"10.1145\/167293.167354"},{"issue":"3","key":"297_CR28","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1198\/000313008X332421","volume":"62","author":"D Murdoch","year":"2008","unstructured":"Murdoch, D., Tsay, Y.-L., Adcock, J.: P-values are random variables. Am. Stat. 62(3), 242\u2013245 (2008)","journal-title":"Am. Stat."},{"issue":"3","key":"297_CR29","first-page":"1","volume":"2019","author":"P Ekdahl","year":"2019","unstructured":"Ekdahl, P., Johansson, T., Maximov, A., Yang, J.: A new SNOW stream cipher called SNOW-V. IACR Trans. Sym. Cryptol. 2019(3), 1\u201342 (2019)","journal-title":"IACR Trans. Sym. Cryptol."},{"issue":"12","key":"297_CR30","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1093\/comjnl\/bxaa003","volume":"63","author":"L Jiao","year":"2020","unstructured":"Jiao, L., Li, Y., Hao, Y.: A guess-and-determine attack on SNOW-V stream cipher. Comput. J. 63(12), 1789\u20131812 (2020)","journal-title":"Comput. J."},{"key":"297_CR31","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. Volume 1: Efficient Algorithms. The MIT Press (1996)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-022-00297-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-022-00297-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-022-00297-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T13:23:07Z","timestamp":1662816187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-022-00297-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,24]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s13389-022-00297-8","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2022,8,24]]},"assertion":[{"value":"24 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}