{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:44:48Z","timestamp":1725471888143},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540465591"},{"type":"electronic","value":"9783540465614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11894063_13","type":"book-chapter","created":{"date-parts":[[2006,10,16]],"date-time":"2006-10-16T17:49:01Z","timestamp":1161020941000},"page":"160-173","source":"Crossref","is-referenced-by-count":20,"title":["Fast Generation of Prime Numbers on Portable Devices: An Update"],"prefix":"10.1007","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Paillier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"ANSI X9.31. Public-key cryptography using RSA for the financial services industry. American National Standard for Financial Services, draft (1995)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Mathematics of Computation\u00a061, 29\u201368 (1993)","journal-title":"Mathematics of Computation"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 425\u2013439. Springer, Heidelberg (1997)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1007\/3-540-46885-4_62","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"W. Bosma","year":"1990","unstructured":"Bosma, W., van der Hulst, M.-P.: Faster primality testing. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 652\u2013656. Springer, Heidelberg (1990)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"13_CR7","volume-title":"Introduction to the Theory of Groups of Finite Order","author":"R.D. Carmichael","year":"1956","unstructured":"Carmichael, R.D.: Introduction to the Theory of Groups of Finite Order. Dover, Mineola (1956)"},{"key":"13_CR8","first-page":"231","volume":"37","author":"C. Couvreur","year":"1982","unstructured":"Couvreur, C., Quisquater, J.-J.: An introduction to fast generation of large prime numbers. Philips Journal of Research\u00a037, 231\u2013264 (1982)","journal-title":"Philips Journal of Research"},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/9789812779380","volume-title":"Chinese Remainder Theorem","author":"C. Ding","year":"1996","unstructured":"Ding, C., Pei, D., Salomaa, A.: Chinese Remainder Theorem. Word Scientific, Singapore (1996)"},{"key":"13_CR10","first-page":"4","volume":"23","author":"P.X. Gallagher","year":"1976","unstructured":"Gallagher, P.X.: On the distribution of primes in short intervals. Mathematica\u00a023, 4\u20139 (1976)","journal-title":"Mathematica"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02403921","volume":"44","author":"G.H. Hardy","year":"1922","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. Acta Mathematica\u00a044, 1\u201370 (1922)","journal-title":"Acta Mathematica"},{"key":"13_CR12","unstructured":"Joye, M., Paillier, P.: Fast generation of prime numbers on portable\u00a0devices: An update. Extended version of this work, Available on: http:\/\/eprint.iacr.org"},{"key":"13_CR13","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: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 340\u2013354. Springer, Heidelberg (2000)"},{"key":"13_CR14","volume-title":"The Art of Computer Programming - Seminumerical Algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming - Seminumerical Algorithms, 2nd edn., vol.\u00a02. Addison-Wesley, Reading (1981)","edition":"2"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.comnet.2004.12.007","volume":"49","author":"C. Lu","year":"2005","unstructured":"Lu, C., Dos Santos, A.L.M.: A note on efficient implementation of prime generation in small portable devices. Computer Networks\u00a049, 476\u2013491 (2005)","journal-title":"Computer Networks"},{"key":"13_CR16","first-page":"214","volume-title":"17th ACM Symposium on Applied Computing","author":"C. Lu","year":"2002","unstructured":"Lu, C., Dos Santos, A.L.M., Pimentel, F.R.: Implementation of fast RSA key generation on smart cards. In: 17th ACM Symposium on Applied Computing, pp. 214\u2013221. ACM Press, New York (2002)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"U. Maurer","year":"1995","unstructured":"Maurer, U.: Fast generation of prime numbers and secure public-key cryptographic parameters. Journal of Cryptology\u00a08, 123\u2013155 (1995)","journal-title":"Journal of Cryptology"},{"key":"13_CR18","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(80)90007-9","volume":"12","author":"L. Monier","year":"1980","unstructured":"Monier, L.: Evaluation and comparison of two efficient probabilistic primality testing algorithms. Theoretical Computer Science\u00a012, 97\u2013108 (1980)","journal-title":"Theoretical Computer Science"},{"key":"13_CR20","unstructured":"Pocklington, C.: The determination of the prime or composite nature of large numbers by Fermat\u2019s theorem. In: Proc. of the Cambridge Philosophical Society, vol.\u00a018, pp. 29\u201330 (1914)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.-J. Quisquater","year":"1982","unstructured":"Quisquater, J.-J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters\u00a018, 905\u2013907 (1982)","journal-title":"Electronics Letters"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Riesel, H.: Prime Numbers and Computer Methods for Factorization, Birkh\u00e4user (1985)","DOI":"10.1007\/978-1-4757-1089-2"},{"key":"13_CR23","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.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"13_CR24","first-page":"9","volume":"3","author":"R.D. Silverman","year":"1997","unstructured":"Silverman, R.D.: Fast generation of random, strong RSA primes. Cryptobytes\u00a03, 9\u201313 (1997)","journal-title":"Cryptobytes"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R., Strassen, V.: A fast Monte-Carlo test for primality. SIAM Journal on Computing\u00a06, 84\u201385 (1977)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894063_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:55:31Z","timestamp":1605624931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894063_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540465591","9783540465614"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11894063_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}