{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:54:12Z","timestamp":1750308852508,"version":"3.41.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T00:00:00Z","timestamp":1496102400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00200-017-0323-1","type":"journal-article","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:45:03Z","timestamp":1496137503000},"page":"283-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A pseudorandom number generator based on worst-case lattice problems"],"prefix":"10.1007","volume":"28","author":[{"given":"Pierre-Louis","family":"Cayrel","sequence":"first","affiliation":[]},{"given":"Mohammed","family":"Meziani","sequence":"additional","affiliation":[]},{"given":"Ousmane","family":"Ndiaye","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Lindner","sequence":"additional","affiliation":[]},{"given":"Rosemberg","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,30]]},"reference":[{"key":"323_CR1","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Electron. Colloq. Comput. Complex. (ECCC) 3(7), 99\u2013108 (1996)"},{"key":"323_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO, volume 5677 of Lecture Notes in Computer Science, pp. 595\u2013618. Springer (2009)","DOI":"10.1007\/978-3-642-03356-8_35"},{"issue":"11","key":"323_CR3","doi-asserted-by":"crossref","first-page":"3927","DOI":"10.1109\/TIT.2007.907471","volume":"53","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., Kurosawa, K., Staddon, J.: Multirecipient encryption schemes: How to save on bandwidth and computation without sacrificing security. IEEE Trans. Inf. Theory 53(11), 3927\u20133943 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"323_CR4","doi-asserted-by":"crossref","first-page":"1703","DOI":"10.1016\/j.jsc.2008.10.004","volume":"44","author":"C Berbain","year":"2009","unstructured":"Berbain, C., Gilbert, H., Patarin, J.: Quad: a multivariate stream cipher with provable security. J. Symb. Comput. 44(12), 1703\u20131723 (2009)","journal-title":"J. Symb. Comput."},{"key":"323_CR5","volume-title":"Post Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography. Springer Publishing Company, Incorporated, Berlin (2008)"},{"key":"323_CR6","doi-asserted-by":"crossref","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of des-like cryptosystems. In: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO \u201990, pp. 2\u201321. Springer (1991)","DOI":"10.1007\/3-540-38424-3_1"},{"key":"323_CR7","doi-asserted-by":"crossref","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of the full 16-round des. In: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO \u201992, pp. 487\u2013496. Springer (1993)","DOI":"10.1007\/3-540-48071-4_34"},{"key":"323_CR8","doi-asserted-by":"crossref","unstructured":"Biswas, B., Sendrier, N.: Mceliece cryptosystem implementation: theory and practice. In: Buchmann, J., Ding, J. (eds.) PQCrypto, volume 5299 of Lecture Notes in Computer Science, pp. 47\u201362. Springer (2008)","DOI":"10.1007\/978-3-540-88403-3_4"},{"key":"323_CR9","unstructured":"Brickell, E.F.: Solving low density knapsacks. In: Chaum, D. (ed.) Advances in Cryptology. Proceedings of CRYPTO \u201983, Santa Barbara, California, USA, August 21\u201324, 1983, pp. 25\u201337. Plenum Press, New York (1983)"},{"key":"323_CR10","doi-asserted-by":"crossref","unstructured":"Buchmann, J., Lindner, R.: Secure parameters for swifft. In: Roy, B.K., Sendrier, N. (eds.) INDOCRYPT, volume 5922 of Lecture Notes in Computer Science, pp. 1\u201317. Springer (2009)","DOI":"10.1007\/978-3-642-10628-6_1"},{"key":"323_CR11","doi-asserted-by":"crossref","unstructured":"Cayrel, P., Meziani, M., Ndiaye, O., Santos, Q.: Efficient software implementations of code-based hash functions and stream-ciphers. In: Ko\u00e7, \u00c7.K., Mesnager, S, Savas, E. (eds.) Arithmetic of Finite Fields, volume 9061 of Lecture Notes in Computer Science, pp. 187\u2013203. Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-16277-5_11"},{"key":"323_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"MJ Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complex. 2, 111\u2013128 (1992)","journal-title":"Comput. Complex."},{"key":"323_CR13","doi-asserted-by":"crossref","unstructured":"de\u00a0Beer, R., van Ormondt, D., Di\u00a0Cesare, F., Graveron-Demilly, D., Karras, DA, Starcuk, Z.: Accelerating batched 1D-FFT with a CUDA-capable computer. In: 2010 IEEE International Conference on Imaging Systems and Techniques (IST), pp. 446\u2013451. IEEE (2010)","DOI":"10.1109\/IST.2010.5548530"},{"key":"323_CR14","doi-asserted-by":"crossref","unstructured":"Feistel, H.: Cryptography and computer privacy. Sci. Am. (1973)","DOI":"10.1038\/scientificamerican0573-15"},{"key":"323_CR15","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Lauradoux, C., Sendrier, N.: Synd: a fast code-based stream cipher with a security reduction. In: IEEE International Symposium on Information Theory, 2007. ISIT 2007, pp. 186 \u2013190, 24\u201329 (2007)","DOI":"10.1109\/ISIT.2007.4557224"},{"key":"323_CR16","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT, volume 4965 of Lecture Notes in Computer Science, pp. 31\u201351. Springer (2008)","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"323_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 89 Proceedings of the twenty-first annual ACM, symposium on Theory of computing, pp. 25\u201332. ACM, New York, USA (1989)","DOI":"10.1145\/73007.73010"},{"key":"323_CR18","doi-asserted-by":"crossref","unstructured":"Golic, J.D.: Cryptanalysis of alleged a5 stream cipher. In: Proceedings of the 16th Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT\u201997, pp. 239\u2013255. Springer (1997)","DOI":"10.1007\/3-540-69053-0_17"},{"key":"323_CR19","unstructured":"Hong, J., Sarkar, P.: Rediscovery of time memory tradeoffs. Cryptology ePrint Archive, Report 2005\/090, (2005). http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"323_CR20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9(4), 199\u2013216 (1996)","journal-title":"J. Cryptol."},{"key":"323_CR21","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP (2), volume 4052 of Lecture Notes in Computer Science, pp. 144\u2013155. Springer (2006)","DOI":"10.1007\/11787006_13"},{"key":"323_CR22","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: Swifft: a modest proposal for fft hashing. In: Nyberg, K. (ed.) FSE, volume 5086 of Lecture Notes in Computer Science, pp. 54\u201372. Springer (2008)","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"323_CR23","doi-asserted-by":"crossref","unstructured":"Mei, C., Jiang, H., Jenness, J.: CUDA-based AES parallelization with fine-tuned GPU memory utilization. In: 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp. 1\u20137. IEEE (2010)","DOI":"10.1109\/IPDPSW.2010.5470766"},{"key":"323_CR24","doi-asserted-by":"crossref","unstructured":"Meziani, M., Hoffmann, G., Cayrel, P.-L.: Improving the performance of the SYND stream cipher. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT, volume 7374 of Lecture Notes in Computer Science, pp. 99\u2013116. Springer (2012)","DOI":"10.1007\/978-3-642-31410-0_7"},{"key":"323_CR25","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16(4):365\u2013411 (2007)","DOI":"10.1007\/s00037-007-0234-9"},{"issue":"1","key":"323_CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"323_CR27","unstructured":"Muller, F.: Differential attacks and stream ciphers. In: The State of the Art of Stream Ciphers, Workshop Record, ECRYPT Network of Excellence in Cryptology, pp. 133\u2013146 (2004)"},{"issue":"2","key":"323_CR28","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2), 336\u2013375 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"323_CR29","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher, M. (ed.) STOC 09 Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 333\u2013342. ACM, New York, USA (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"323_CR30","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) STOC 08 Proceedings of the fortieth annual, ACM symposium on Theory of computing, pp. 187\u2013196. ACM, New York, USA (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"323_CR31","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 84\u201393 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"323_CR32","doi-asserted-by":"crossref","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M.(ed.) CRYPTO, volume 2442 of Lecture Notes in Computer Science, pp. 288\u2013303. Springer (2002)","DOI":"10.1007\/3-540-45708-9_19"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-017-0323-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-017-0323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-017-0323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:10:45Z","timestamp":1750281045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-017-0323-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,30]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["323"],"URL":"https:\/\/doi.org\/10.1007\/s00200-017-0323-1","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2017,5,30]]}}}