{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:09:03Z","timestamp":1725898143443},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643821"},{"type":"electronic","value":"9783540697671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0030409","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:24:34Z","timestamp":1138202674000},"page":"66-74","source":"Crossref","is-referenced-by-count":0,"title":["The least witness of a composite number"],"prefix":"10.1007","author":[{"given":"R.","family":"Balasubramanian","sequence":"first","affiliation":[]},{"given":"S. V.","family":"Nagaraj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"5_CR1","unstructured":"L. Adleman and M. Huang, Primality testing and two dimensional Abelian varieties over finite fields, Lec. Notes in Math, 1512, Springer-Verlag (1994)."},{"key":"5_CR2","first-page":"261","volume":"36","author":"L. Adleman","year":"1981","unstructured":"L. Adleman and F. T. Leighton, An O(n 1\/10.89) primality testing algorithm, Math. Comp. 36 (1981) 261\u2013266.","journal-title":"Math. Comp."},{"key":"5_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-58691-1_70","volume-title":"Algorithmic Number Theory","author":"L. Adleman","year":"1994","unstructured":"L. Adleman and K. S. McCurley, Open problems in number-theoretic complexity-II, in: L. M. Adleman and M. D. Huang (eds.), Algorithmic Number Theory, LNCS 877, Springer-Verlag, Berlin (1994), 291\u2013322."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.2307\/2006975","volume":"117","author":"L. Adleman","year":"1983","unstructured":"L. Adleman, C. Pomerance and R. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. 117 (1983) 173\u2013206.","journal-title":"Ann. of Math."},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2118540","volume":"140","author":"W. R. Alford","year":"1994","unstructured":"W. R. Alford, A. Granville and C. Poinerance, There are infinitely many Carmichael numbers, Ann. of Math. 140 (1994) 1\u201320.","journal-title":"Ann. of Math."},{"key":"5_CR6","series-title":"LNCS","first-page":"1","volume-title":"Algorithmic Number Theory","author":"W. R. Alford","year":"1994","unstructured":"W. R. Alford, A. Granville and C. Pomerance, On the difficulty of finding reliable witnesses, in: L. M. Adleman and M. D. Huang (eds.), Algorithmic Number Theory, LNCS 877, Springer-Verlag, Berlin (1994), 1\u201316."},{"key":"5_CR7","volume-title":"Analytic methods in the analysis and design of number-theoretic algorithms","author":"E. Bach","year":"1985","unstructured":"E. Bach, Analytic methods in the analysis and design of number-theoretic algorithms, MIT Press, Cambridge, Mass. (1985)."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/S0025-5718-1993-1195432-5","volume":"61","author":"E. Bach","year":"1993","unstructured":"E. Bach and L. Huelsbergen, Statistical evidence for small generating sets, Math. Comp 61 (1993), 69\u201382.","journal-title":"Math. Comp"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1090\/S0025-5718-97-00857-0","volume":"66","author":"R. Balasubramanian","year":"1997","unstructured":"R. Balasubramanian and S. V. Nagaraj, Density of Carmichael numbers with three prime factors, Math. Comp. 66 (1997), 1705\u20131708.","journal-title":"Math. Comp."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00206325","volume":"1","author":"P. Beauchemin","year":"1988","unstructured":"P. Beauchemin, G. Brassard, C. Crepeau, C. Goutier and C. Pomerance, The generation of random numbers that are probably prime, J. Cryptology 1 (1988) 53\u201364.","journal-title":"J. Cryptology"},{"key":"5_CR11","unstructured":"D. Bleichenbacher, Efficiency and security of crypto-systems based on number theory, Ph.D Thesis, Swiss Federal Institute of Technology, Diss. ETH No. 11404, Zurich 1996."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"W. Bosma and M. P. van der Hulst, Primality testing with cyclotomy, Ph.D Thesis, Faculteit Wiskunde en Informatica, Univ. of Amsterdam (1990).","DOI":"10.1007\/3-540-46885-4_62"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/plms\/s3-12.1.179","volume":"12","author":"D. A. Burgess","year":"1962","unstructured":"D. A. Burgess, On character sums and primitive roots, Proc. London Math. Soc. 12 (1962) 179\u2013192.","journal-title":"Proc. London Math. Soc."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1112\/plms\/s3-13.1.524","volume":"13","author":"D. A. Burgess","year":"1963","unstructured":"D. A. Burgess, On character sums and L-series II, Proc. London Math. Soc. 13 (1963) 524\u2013536.","journal-title":"Proc. London Math. Soc."},{"key":"5_CR15","unstructured":"R. J. Burthe, The average witness is 2, Ph.D Thesis, University of Georgia (1995)."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.4064\/aa-80-4-311-326","volume":"80","author":"R. J. Burthe Jr.","year":"1997","unstructured":"R. J. Burthe Jr., Uper bounds for least witnesses and generating sets, Acta Arith. 80 (1997) 311\u2013326.","journal-title":"Acta Arith."},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"327","DOI":"10.4064\/aa-80-4-327-341","volume":"80","author":"R. J. Burthe Jr.","year":"1997","unstructured":"R. J. Burthe Jr., The average witness is 2, Acta Arith. 80 (1997) 327\u2013341.","journal-title":"Acta Arith."},{"key":"5_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5927-3","volume-title":"Multiplicative Number Theory","author":"H. Davenport","year":"1980","unstructured":"H. Davenport, Multiplicative Number Theory, 2nd Ed., (Springer Verlag, New York, 1980).","edition":"2nd Ed."},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1090\/S0025-5718-1993-1189518-9","volume":"61","author":"I. Damgaard","year":"1993","unstructured":"I. Damgaard, P. Landrock and C. Pomerance, Average case error estimates for the strong probable prime test, Math. Comp 61 (1993) 177\u2013194.","journal-title":"Math. Comp"},{"key":"5_CR20","first-page":"177","volume-title":"Proc. of the First Conference of the CNTA, Alberta, April 1988","author":"A. Granville","year":"1990","unstructured":"A. Granville, Some conjectures related to Fermat's last theorem, in: Proc. of the First Conference of the CNTA, Alberta, April 1988, pp. 177\u2013192, (Walter de Gruyter, Berlin 1990)."},{"key":"5_CR21","first-page":"335","volume":"9","author":"A. Granville","year":"1991","unstructured":"A. Granville, On pairs of co-prime integers with no large prime factors, Expo. Math. 9 (1991), 335\u2013350.","journal-title":"Expo. Math."},{"key":"5_CR22","unstructured":"D. R. Heath-Brown, Personal Communication, April 1997."},{"key":"5_CR23","volume-title":"Graduate texts in Mathematics","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, A Course in Number Theory and Cryptography Graduate texts in Mathematics, (Springer Verlag, New York 1987)."},{"key":"5_CR24","volume-title":"Mathematics of Paul Erdos","author":"S. Konyagin","year":"1997","unstructured":"S. Konyagin and C. Pomerance, On primes recognisable in deterministic polynomial time, in: R. L. Graham and J. Nesetril (eds.), Mathematics of Paul Erdos, Springer-Verlag, Berlin (1997)."},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0020-0190(79)90149-2","volume":"8","author":"H. W. Lenstra Jr.","year":"1979","unstructured":"H. W. Lenstra, Jr., Miller's primality test, Info. Proc. Lett. 8 (1979) 86\u201388.","journal-title":"Info. Proc. Lett."},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. L. Miller","year":"1976","unstructured":"G. L. Miller, Riemann hypothesis and tests for primality, J. Comput. System Sci. 13 (1976), 300\u2013317.","journal-title":"J. Comput. System Sci."},{"key":"5_CR27","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF01275488","volume":"3","author":"R. Peralta","year":"1993","unstructured":"R. Peralta and V. Shoup, Primality testing with fewer random bits, Comp. Compl. 3 (1993), 355\u2013367.","journal-title":"Comp. Compl."},{"key":"5_CR28","unstructured":"R. Pinch, Personal Communication, April 1997."},{"key":"5_CR29","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. O. Rabin","year":"1980","unstructured":"M. O. Rabin, Probabilistic algorithm for testing primality, J. Number Theory 12 (1980), 128\u2013138.","journal-title":"J. Number Theory"},{"key":"5_CR30","unstructured":"G. Tenenbaum, Introduction to analytic and probabilistic number theory, Cambridge Studies in Advanced Mathematics No. 46, (Cambridge University Press, 1995)"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:39:11Z","timestamp":1555425551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643821","9783540697671"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0030409","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}