{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T10:42:17Z","timestamp":1742640137374,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tit.2018.2859045","type":"journal-article","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T00:14:17Z","timestamp":1532477657000},"page":"1307-1317","source":"Crossref","is-referenced-by-count":6,"title":["Close to Uniform Prime Number Generation With Fewer Random Bits"],"prefix":"10.1109","volume":"65","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2736-2963","authenticated-orcid":false,"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-01-01351-5"},{"key":"ref30","first-page":"173","article-title":"Some number-theoretic conjectures and their relation to the generation of cryptographic primes","volume":"2","author":"maurer","year":"1992","journal-title":"Cryptography and Coding"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02403921"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/357830.357847"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8295-8_21"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814549"},{"key":"ref14","first-page":"281","article-title":"Recherches analytiques sur la théorie des nombres premiers","volume":"2","author":"de la vall\u00e9e poussin","year":"1896","journal-title":"Ann Soc Scient Bruxelles"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060851"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/pspum\/028.1\/0427249"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/1971450"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01218882"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5927-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0217012"},{"key":"ref4","first-page":"358","article-title":"On generation of probable primes by incremental search","volume":"740","author":"brandt","year":"1992","journal-title":"Proc Annu Int Cryptol Conf"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300016442"},{"key":"ref3","first-page":"440","article-title":"Speeding up prime number generation","volume":"739","author":"brandt","year":"1991","journal-title":"Proc Int Conf Theory Appl Cryptol"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11894063_13"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-003-0051-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44499-8_27"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202269"},{"key":"ref7","first-page":"636","article-title":"Fast generation of secure RSA-moduli with almost maximal diversity","author":"maurer","year":"1989","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"journal-title":"Randomness requirements for security","year":"4086","author":"eastlake","key":"ref2"},{"key":"ref9","first-page":"282","article-title":"Fast generation of provable primes using search in arithmetic progressions","volume":"839","author":"mih?ilescu","year":"1994","journal-title":"Proc Annu Int Cryptol Conf"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_82"},{"key":"ref20","first-page":"226","article-title":"Über die Primzahlen der arithmetischen Progression","volume":"8","author":"tur\u00e1n","year":"1936","journal-title":"Acta Sci Math Szeged"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1307\/mmj\/1028999608","article-title":"Primes in arithmetic progressions","volume":"13","author":"davenport","year":"1966","journal-title":"Michigan Math J"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1070\/RM1966v021n01ABEH004146"},{"journal-title":"An Introduction to the Theory of Numbers","year":"1960","author":"hardy","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300007968"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2004.160.781"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8620171\/08418738.pdf?arnumber=8418738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:43:09Z","timestamp":1657744989000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8418738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":31,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2859045","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}