{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:33Z","timestamp":1725488793584},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_27","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"282-293","source":"Crossref","is-referenced-by-count":8,"title":["Fast Generation of Provable Primes Using Search in Arithmetic Progressions"],"prefix":"10.1007","author":[{"given":"Preda","family":"Mihailescu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lect Notes Comput Sci","first-page":"358","volume-title":"Proceedings CRYPTO\u201992","author":"J. Brandt","year":"1992","unstructured":"Brandt, J.; Damgard, I.: On Generation of Probable Primes by Incremental Search, Proceedings CRYPTO\u201992, Lecture Notes in Computer Science Vol. 740 pp. 358\u201371"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","first-page":"440","volume-title":"Proc. of Asiacrypt 91","author":"J. Brandt","year":"1991","unstructured":"Brandt, J.; Damgard I.; Landrock, P.: Speeding up Prime Number Generation, Proc. of Asiacrypt 91, Lecture Notes in Computer Science, Vol 739, pp. 440\u201350."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.2307\/2152945","volume":"61","author":"I. Damgard","year":"1993","unstructured":"Damgard I.; Landrock, P.; Pomerance, C.: Average Case Bounds for the Strong Probable Prime Test, Math. Comp., Vol 61, Oct 1993, pp. 177\u2013195","journal-title":"Math. Comp."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bosma, W.; VanderHulst, L.: Primality Test Using Cyclotomy, Phd, University of Amsterdam, 1990","DOI":"10.1007\/3-540-46885-4_62"},{"key":"27_CR5","first-page":"231","volume":"37","author":"C. Couvreur","year":"1982","unstructured":"Couvreur, C.; Quisquater, J.J.: An introduction to fast generation of large primes, Philips Journal of Research, vol. 37, pp 231\u2013264, 1982","journal-title":"Philips Journal of Research"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Davenport, Harold: Multiplicative Number Theory, Springer 1980, Second Edtion.","DOI":"10.1007\/978-1-4757-5927-3"},{"key":"27_CR7","unstructured":"Digital Signature Algorithm, Federal Information Processing Standards Publication XX, 1993 February 1."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S. and Kilian, J.: Almost all primes can be quickly certified, Proc. of the 18th Annual ACM Symposium on the Theory of Computing, 1986, pp. 316\u2013329.","DOI":"10.1145\/12130.12162"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1112\/S0025579300016442","volume":"23","author":"P.X. Gallagher","year":"1976","unstructured":"Gallagher, P.X.: On the distribution of primes in short interevals, Mathematika, vol. 23, 1976, pp. 4\u20139","journal-title":"Mathematika"},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","first-page":"216","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 84","author":"J. Gordon","year":"1984","unstructured":"Gordon, J.: Strong primes are easy to find, Advances in Cryptology-EUROCRYPT\u2019 84, Lecture Notes in Computer Science, vol. 209, 1984, pp. 216\u2013223."},{"key":"27_CR11","unstructured":"Knuth, Donald E.: The Art of Computer Programming, Addison-Wesley, 1981"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring Integers With Elliptic Curves, Annals of Mathematics, Vol. 126, 1987, pp649\u2013673.","journal-title":"Annals of Mathematics"},{"key":"27_CR13","unstructured":"Lenstra, A.K. and Lenstra, H.W., jr.: Algorithms in number theory, Technical Report 87-008, May 1987, University of Chicago, Dept. of Computer Science."},{"key":"27_CR14","unstructured":"Maurer, Ueli M.: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters, Internal Report, Dept. of Comp. Science, Princeton University, 1991."},{"key":"27_CR15","unstructured":"Maurer, Ueli M.: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters, Internal Report, Dept. Informatik, ETH Zrich, 1993."},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","first-page":"110","volume-title":"Advances in Cryptology, EUROCRYPT\u2019 90","author":"F. Morain","year":"1990","unstructured":"Morain, F.: Distributed primality proving and the primality of (23539 + 1)\/3, Advances in Cryptology, EUROCRYPT\u2019 90, Lecture Notes in Computer Science, vol. 473, 1990, pp. 110\u2013123."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Nyberg, K.; R\u00fcppel, R.: A New Signature Scheme Based on the DSA Giving Message Recovery, Preprint, 1993.","DOI":"10.1145\/168588.168595"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(79)90002-1","volume":"9","author":"D. A. Plaisted","year":"1979","unstructured":"Plaisted, D. A.: Fast verification, testing and generation of large primes, Theoretical Computer Science, vol 9, 1979, pp. 1\u201317.","journal-title":"Theoretical Computer Science"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing, Proceedings of the Cambridge Philosophical society, Vol. 76, 1974, pp. 521\u2013528.","journal-title":"Proceedings of the Cambridge Philosophical society"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality, Journal of number theory, vol 12, 1980, pp. 128\u2013138","journal-title":"Journal of number theory"},{"key":"27_CR21","unstructured":"Rivest, R.: Are\u2019 strong\u2019 Primes needed for RSA?, preprint, 1991"},{"issue":"2","key":"27_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, Vol. 21, No. 2, 1978, pp. 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"27_CR23","unstructured":"Schneier, B.: Applied Cryptography, Wiley & Sons, 1993"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:13Z","timestamp":1605647773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_27","relation":{},"subject":[]}}