{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:24:05Z","timestamp":1743089045273,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642552236"},{"type":"electronic","value":"9783642552243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55224-3_10","type":"book-chapter","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T20:44:02Z","timestamp":1399322642000},"page":"96-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Engineering Nonlinear Pseudorandom Number Generators"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Neves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filipe","family":"Araujo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"key":"10_CR1","unstructured":"Bernstein, D.J.: ChaCha, a variant of Salsa20. In: Workshop Record of SASC 2008: The State of the Art of Stream Ciphers, January 2008"},{"key":"10_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, Ch.: Twisted edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008)"},{"key":"10_CR3","unstructured":"Bernstein, D.J., Lange, T.: Analysis and optimization of elliptic-curve single-scalar multiplication. IACR Cryptology ePrint Archive 2007, 455 (2007)"},{"key":"10_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"ASIACRYPT 2007","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10998-014-0021-8","volume":"68","author":"Z Chen","year":"2012","unstructured":"Chen, Z., Gomez, D., Pirsic, G.: On lattice profile of the elliptic curve linear congruential generators. Period. Math. Hung. 68, 1\u201312 (2012)","journal-title":"Period. Math. Hung."},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"DV Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dworkin, M.: Recommendation for block cipher modes of operation: methods and techniques. Special Publication 800\u201338A, National Institute of Standards and Technology, Gaithersburg, MD 20899\u20138930 (2001)","DOI":"10.6028\/NIST.SP.800-38a"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"3382","DOI":"10.1103\/PhysRevLett.69.3382","volume":"69","author":"AM Ferrenberg","year":"1992","unstructured":"Ferrenberg, A.M., Landau, D.P., Wong, Y.J.: Monte Carlo simulations: hidden errors from \u201cgood\u201d random number generators. Phys. Rev. Lett. 69, 3382\u20133384 (1992)","journal-title":"Phys. Rev. Lett."},{"key":"10_CR10","unstructured":"Lenstra, H.W. Jr.: Elliptic curves and number-theoretic algorithms. In: Gleason, A.M. (ed.) Proceedings of the International Congress of Mathematicians, vol. 1, pp. 99\u2013120. American Mathematical Society, Providence (1987)"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-003-6153-0","volume":"35","author":"F Hess","year":"2005","unstructured":"Hess, F., Shparlinski, I.E.: On the linear complexity and multidimensional distribution of congruential generators over elliptic curves. Des. Codes Crypt. 35(1), 111\u2013117 (2005). http:\/\/dx.doi.org\/10.1007\/s10623-003-6153-0","journal-title":"Des. Codes Crypt."},{"key":"10_CR12","series-title":"LNCS","first-page":"248","volume-title":"SAC 2003","author":"A Klimov","year":"2004","unstructured":"Klimov, A., Shamir, A.: Cryptographic applications of T-Functions. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 248\u2013261. Springer, Heidelberg (2004)"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1268776.1268777","volume":"33","author":"P L\u2019Ecuyer","year":"2007","unstructured":"L\u2019Ecuyer, P., Simard, R.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22 (2007)","journal-title":"ACM Trans. Math. Softw."},{"key":"10_CR14","unstructured":"Lehmer, D.: Mathematical methods in large-scale computing units. In: Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery, pp. 141\u2013146. Harvard University Press, Cambridge, Massachusetts (1949)"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1073\/pnas.61.1.25","volume":"61","author":"G Marsaglia","year":"1968","unstructured":"Marsaglia, G.: Random numbers fall mainly in the planes. PNAS 61(1), 25\u201328 (1968). http:\/\/dx.doi.org\/10.1073\/pnas.61.1.25","journal-title":"PNAS"},{"issue":"14","key":"10_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v008.i14","volume":"8","author":"G Marsaglia","year":"2003","unstructured":"Marsaglia, G.: Xorshift RNGs. J. Stat. Softw. 8(14), 1\u20136 (2003)","journal-title":"J. Stat. Softw."},{"issue":"1","key":"10_CR17","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":"10_CR18","series-title":"LNCS","first-page":"417","volume-title":"CRYPTO 1985","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48, 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"10_CR20","series-title":"LNCS","first-page":"92","volume-title":"PPAM 2011, Part I","author":"S Neves","year":"2012","unstructured":"Neves, S., Araujo, F.: Fast and small nonlinear pseudorandom number generators for computer simulation. In: Dongarra, J., Karczewski, K., Wa\u015bniewski, J., Wyrzykowski, R. (eds.) PPAM 2011, Part I. LNCS, vol. 7203, pp. 92\u2013101. Springer, Heidelberg (2012)"},{"key":"10_CR21","unstructured":"NVIDIA Corporation: CURAND Library (July 2013), http:\/\/docs.nvidia.com\/cuda\/curand\/"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/1113316.1113319","volume":"15","author":"F Panneton","year":"2005","unstructured":"Panneton, F., L\u2019ecuyer, P.: On the Xorshift random number generators. ACM Trans. Model. Comput. Simul. 15(4), 346\u2013361 (2005)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-540-74496-2_36","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods 2006","author":"M Saito","year":"2008","unstructured":"Saito, M., Matsumoto, M.: SIMD-oriented fast Mersenne Twister: a 128-bit pseudorandom number generator. In: Keller, A., Heinrich, S., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 607\u2013622. Springer, Berlin (2008)"},{"key":"10_CR24","unstructured":"Salmon, J.K., Moraes, M.A., Dror, R.O., Shaw, D.E.: Parallel random numbers: as easy as 1, 2, 3. In: Lathrop, S., Costa, J., Kramer, W. (eds.) SC, p. 16. ACM (2011). http:\/\/doi.acm.org\/10.1145\/2063384.2063405"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/inco.2001.3045","volume":"171","author":"A Shamir","year":"2002","unstructured":"Shamir, A., Tsaban, B.: Guaranteeing the diversity of number generators. Inf. Comput. 171(2), 350\u2013363 (2002)","journal-title":"Inf. Comput."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1090\/S0025-5718-1965-0184406-1","volume":"19","author":"RC Tausworthe","year":"1965","unstructured":"Tausworthe, R.C.: Random numbers generated by linear recurrence modulo two. Math. Comput. 19, 201\u2013209 (1965)","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55224-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T02:37:37Z","timestamp":1676860657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55224-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552236","9783642552243"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55224-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}