{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:26:46Z","timestamp":1772119606437,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_82","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"991-1002","source":"Crossref","is-referenced-by-count":10,"title":["Close to Uniform Prime Number Generation with Fewer Random Bits"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"82_CR1","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math.\u00a0160(2), 781\u2013793 (2004)","journal-title":"Ann. Math."},{"key":"82_CR2","first-page":"51","volume":"21","author":"M.B. Barban","year":"1966","unstructured":"Barban, M.B.: The \u201clarge sieve\u201d method and its application to number theory. Uspehi Mat. Nauk\u00a021, 51\u2013102 (1966)","journal-title":"Uspehi Mat. Nauk"},{"key":"82_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-48071-4_26","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"J. Brandt","year":"1993","unstructured":"Brandt, J., Damg\u00e5rd, I.: On generation of probable primes by incremental search. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 358\u2013370. Springer, Heidelberg (1993)"},{"key":"82_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/3-540-57332-1_37","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"J. Brandt","year":"1993","unstructured":"Brandt, J., Damg\u00e5rd, I., Landrock, P.: Speeding up prime number generation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 440\u2013449. Springer, Heidelberg (1993)"},{"issue":"3","key":"82_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. ACM Trans. Inf. Syst. Secur.\u00a03(3), 161\u2013185 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"82_CR6","doi-asserted-by":"crossref","unstructured":"Davenport, H.: Multiplicative Number Theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a074. Springer (1980)","DOI":"10.1007\/978-1-4757-5927-3"},{"key":"82_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1307\/mmj\/1028999608","volume":"13","author":"H. Davenport","year":"1966","unstructured":"Davenport, H., Halberstam, H.: Primes in arithmetic progressions. Michigan Math. J.\u00a013, 485\u2013489 (1966)","journal-title":"Michigan Math. J."},{"key":"82_CR8","first-page":"281","volume":"20","author":"C.-J. Vall\u00e9e Poussin De la","year":"1896","unstructured":"De la Vall\u00e9e Poussin, C.-J.: Recherches analytiques sur la th\u00e9orie des nombres premiers. Ann. Soc. Sci. Bruxelles\u00a020, 281\u2013397 (1896)","journal-title":"Ann. Soc. Sci. Bruxelles"},{"key":"82_CR9","doi-asserted-by":"crossref","unstructured":"Eastlake, D., Schiller, J., Crocker, S.: Randomness Requirements for Security. RFC 4086 (Best Current Practice) (June 2005)","DOI":"10.17487\/rfc4086"},{"key":"82_CR10","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Tibouchi, M.: Close to uniform prime number generation with fewer random bits. arXiv.org e-Print archive (2014), Full version of this paper","DOI":"10.1007\/978-3-662-43948-7_82"},{"key":"82_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971450","volume":"129","author":"J.B. Friedlander","year":"1989","unstructured":"Friedlander, J.B., Granville, A.: Limitations to the equi-distribution of primes I. Ann. Math.\u00a0129, 363\u2013382 (1989)","journal-title":"Ann. Math."},{"issue":"1","key":"82_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1112\/S0025579300007968","volume":"14","author":"P.X. Gallagher","year":"1967","unstructured":"Gallagher, P.X.: The large sieve. Mathematika\u00a014(1), 14\u201320 (1967)","journal-title":"Mathematika"},{"key":"82_CR13","unstructured":"Hardy, G.H., Littlewood, J.E.: Some problems of \u2018partitio numerorum\u2019: III. on the expression of a number as a sum of primes 44, 1\u201370 (1922)"},{"key":"82_CR14","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 4th edn. Clarendon Press (1960)"},{"key":"82_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11894063_13","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"M. Joye","year":"2006","unstructured":"Joye, M., Paillier, P.: Fast generation of prime numbers on portable devices: An update. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 160\u2013173. Springer, Heidelberg (2006)"},{"key":"82_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-44499-8_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"M. Joye","year":"2000","unstructured":"Joye, M., Paillier, P., Vaudenay, S.: Efficient generation of prime numbers. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 340\u2013354. Springer, Heidelberg (2000)"},{"key":"82_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/3-540-46885-4_60","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"U.M. Maurer","year":"1990","unstructured":"Maurer, U.M.: Fast generation of secure RSA-moduli with almost maximal diversity. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 636\u2013647. Springer, Heidelberg (1990)"},{"issue":"3","key":"82_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"U.M. Maurer","year":"1995","unstructured":"Maurer, U.M.: Fast generation of prime numbers and secure public-key cryptographic parameters. J. Cryptology\u00a08(3), 123\u2013155 (1995)","journal-title":"J. Cryptology"},{"key":"82_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-48658-5_27","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"P. Mih\u0103ilescu","year":"1994","unstructured":"Mih\u0103ilescu, P.: Fast generation of provable primes using search in arithmetic progressions. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 282\u2013293. Springer, Heidelberg (1994)"},{"key":"82_CR20","doi-asserted-by":"crossref","unstructured":"Mih\u0103ilescu, P.: Security of biased sources for cryptographic keys. In: Cryptography and computational number theory (Singapore, 1999). Progr. Comput. Sci. Appl. Logic, vol.\u00a020, pp. 287\u2013302. Birkh\u00e4user, Basel (2001)","DOI":"10.1007\/978-3-0348-8295-8_21"},{"key":"82_CR21","doi-asserted-by":"crossref","unstructured":"Montgomery, H.L.: Topics in Multiplicative Number Theory. Lecture Notes in Mathematics, vol.\u00a0227. Springer (1971)","DOI":"10.1007\/BFb0060851"},{"key":"82_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1090\/pspum\/028.1\/0427249","volume":"28","author":"H.L. Montgomery","year":"1976","unstructured":"Montgomery, H.L.: Problems concerning prime numbers. Proc. Symp. Pure Math.\u00a028, 307\u2013310 (1976)","journal-title":"Proc. Symp. Pure Math."},{"key":"82_CR23","unstructured":"Rabin, M.: Probabilistic algorithms for testing primality 12, 128\u2013138 (1980)"},{"key":"82_CR24","doi-asserted-by":"crossref","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra (Version 2). Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511814549"},{"issue":"4","key":"82_CR25","first-page":"226","volume":"8","author":"P. Tur\u00e1n","year":"1936","unstructured":"Tur\u00e1n, P.: \u00dcber die Primzahlen der arithmetischen Progression. Acta Sci. Math. Szeged\u00a08(4), 226\u2013235 (1936)","journal-title":"Acta Sci. Math. Szeged"},{"issue":"1","key":"82_CR26","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/BF01218882","volume":"40","author":"A. Walfisz","year":"1936","unstructured":"Walfisz, A.: Zur additiven Zahlentheorie II. Mathematische Zeitschrift\u00a040(1), 592\u2013607 (1936)","journal-title":"Mathematische Zeitschrift"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:11:35Z","timestamp":1558908695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}