{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:09:16Z","timestamp":1743221356965,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300561"},{"type":"electronic","value":"9783642300578"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30057-8_22","type":"book-chapter","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T17:05:50Z","timestamp":1337360750000},"page":"372-389","source":"Crossref","is-referenced-by-count":5,"title":["Generating Provable Primes Efficiently on Embedded Devices"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Clavier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benoit","family":"Feix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"Thierry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Paillier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","first-page":"781","volume":"2","author":"M. Agrawal","year":"2002","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics\u00a02, 781\u2013793 (2002)","journal-title":"Annals of Mathematics"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58691-1_36","volume-title":"Algorithmic Number Theory","author":"W.R. Alford","year":"1994","unstructured":"Alford, W.R., Granville, A., Pomerance, C.: On the Difficulty of Finding Reliable Witnesses. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 1\u201316. Springer, Heidelberg (1994)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2307\/1969420","volume":"55","author":"N.C. Ankeny","year":"1952","unstructured":"Ankeny, N.C.: The least quadratic non residue. Annals of Mathematics\u00a055, 65\u201372 (1952)","journal-title":"Annals of Mathematics"},{"key":"22_CR4","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":"22_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E. Bach","year":"1990","unstructured":"Bach, E.: Explicit bounds for primality testing and related problems. Mathematics of Computation\u00a055, 355\u2013380 (1990)","journal-title":"Mathematics of Computation"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Brillhart, J., Lehmer, D.H., Selfridge, J.L., Tuckerman, B., Wagstaff Jr., S.S.: Factorization of b n \u00b11, b\u2009=\u20092, 3, 5, 7, 10, 11, 12 Up to High Powers, vol.\u00a022. American Mathematical Society (1988)","DOI":"10.1090\/conm\/022"},{"issue":"6","key":"22_CR7","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TC.2004.13","volume":"53","author":"B. Chevallier-Mames","year":"2004","unstructured":"Chevallier-Mames, B., Ciet, M., Joye, M.: Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity. IEEE Transactions on Computers\u00a053(6), 760\u2013768 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-74735-2_30","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"C. Clavier","year":"2007","unstructured":"Clavier, C., Coron, J.-S.: On the Implementation of a Fast Prime Generation Algorithm. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 443\u2013449. Springer, Heidelberg (2007)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12510-2_6","volume-title":"Smart Card Research and Advanced Application","author":"J.-C. Courr\u00e8ge","year":"2010","unstructured":"Courr\u00e8ge, J.-C., Feix, B., Roussellet, M.: Simple Power Analysis on Exponentiation Revisited. In: Gollmann, D., Lanet, J.-L., Iguchi-Cartigny, J. (eds.) CARDIS 2010. LNCS, vol.\u00a06035, pp. 65\u201379. Springer, Heidelberg (2010)"},{"issue":"6","key":"22_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-04138-9_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"T. Finke","year":"2009","unstructured":"Finke, T., Gebhardt, M., Schindler, W.: A New Side-Channel Attack on RSA Prime Generation. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 141\u2013155. Springer, Heidelberg (2009)"},{"key":"22_CR12","unstructured":"FIPS PUB 186-3. Digital Signature Standard. National Institute of Standards and Technology (October 2009)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Garner, H.L.: The residue number system. In: Proceedings of the Western Joint Computer Conference, pp. 146\u2013153 (1959)","DOI":"10.1145\/1457838.1457864"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1090\/S0025-5718-1993-1192971-8","volume":"61","author":"G. Jaechke","year":"1993","unstructured":"Jaechke, G.: On strong pseudoprimes to several bases. Mathematics of Computation\u00a061, 915\u2013926 (1993)","journal-title":"Mathematics of Computation"},{"key":"22_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":"22_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":"22_CR17","unstructured":"Joye, M., Villegas, K.: A protected division algorithm. In: Proceedings of the Fifth Smart Card Research and Advanced Application Conference, CARDIS 2002 (2002)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"22_CR19","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":"22_CR20","first-page":"1003","volume":"35","author":"C. Pomerance","year":"1990","unstructured":"Pomerance, C., Selfridge, C., Wagstaff, J.L.: The pseudoprimes to 25.10e9. Mathematics of Computation\u00a035, 1003\u20131026 (1990)","journal-title":"Mathematics of Computation"},{"key":"22_CR21","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\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"issue":"16","key":"22_CR22","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1049\/el:19860598","volume":"22","author":"J. Shawe-Taylor","year":"1986","unstructured":"Shawe-Taylor, J.: Generating strong primes. Electronic Letters\u00a022(16), 875\u2013877 (1986)","journal-title":"Electronic Letters"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30057-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:10:48Z","timestamp":1743153048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30057-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300561","9783642300578"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}